Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 2 de 2
Filtrar
Mais filtros








Base de dados
Intervalo de ano de publicação
1.
Discrete Comput Geom ; 69(1): 156-191, 2023.
Artigo em Inglês | MEDLINE | ID: mdl-36605029

RESUMO

We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex  A , and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use.

2.
J Appl Comput Topol ; 3(1): 29-58, 2019.
Artigo em Inglês | MEDLINE | ID: mdl-31633006

RESUMO

In this paper we discuss three results. The first two concern general sets of positive reach: we first characterize the reach of a closed set by means of a bound on the metric distortion between the distance measured in the ambient Euclidean space and the shortest path distance measured in the set. Secondly, we prove that the intersection of a ball with radius less than the reach with the set is geodesically convex, meaning that the shortest path between any two points in the intersection lies itself in the intersection. For our third result we focus on manifolds with positive reach and give a bound on the angle between tangent spaces at two different points in terms of the reach and the distance between the two points.

SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA