Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

COMPGEOM
2000
ACM

favoriteEmaildiscussreport

390views Discrete Geometry» more COMPGEOM 2000»

Delaunay triangulations and Voronoi diagrams for Riemannian manifolds

13 years 9 months ago

Delaunay triangulations and Voronoi diagrams for Riemannian manifolds

Download dehn.slu.edu

For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists. This triangulation has the same properties as in Euclidean space. Algorithms for constructing these triangulations will also be described.

Greg Leibon, David Letscher

Real-time Traffic

Closed Riemannian Manifold | COMPGEOM 2000 | Dense Set | Discrete Geometry | Unique Delannay Triangulation |

claim paper

Related Content

» Estimation of the necessary number of points in Riemannian Voronoi

» Anisotropic Geodesics for Perceptual Grouping and Domain Meshing

» Voronoi Diagrams for Moving Disks and Applications

» Delaunay triangulations approximate anchor hulls

» Triangulations of Line Segment Sets in the Plane

» Splitting a Delaunay Triangulation in Linear Time

» Facial Feature Location with Delaunay TriangulationVoronoi Diagram Calculation

» Construction of IsoContours Bisectors and Voronoi Diagrams on Triangulated Surfaces

» A Note on Point Location in Delaunay Triangulations of Random Points

Post Info
More Details (n/a)

Added	01 Aug 2010
Updated	01 Aug 2010
Type	Conference
Year	2000
Where	COMPGEOM
Authors	Greg Leibon, David Letscher

Comments (0)