Greg Leibon
- 1.N. Amenta and M. Bern. Surface Reconstruction by Voronoi Filtering. Discrete Comput. Geom. 22 (1999) 471-504.Google Scholar
- 2.M. Bern and D. Eppstein. Mesh Generation and Optimal Triangulation. Computing in Euclidean Geometry, edited by F. K. Hwang and D.-Z. Du, World Scientific, 1992, 47-123.Google Scholar
- 3.I. Chavel. Riemannian Geometry: A Modern Introduction. Cambridge University Press, 1993.Google Scholar
- 4.P. Chew. Guaranteed-Quality Mesh Generation for Curved Surfaces. Proc. 9th Symp. Computational Geometry, 1993, 274-280. Google ScholarDigital Library
- 5.H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, Germany, 1987. Google ScholarDigital Library
- 6.W. Klingenberg. Riemannian Geometry. de Gruyter, Berlin, 1982.Google Scholar
- 7.C. Lawson. Generation of a Triangular Grid with Applications to Contour Plotting. Memo 299. Jet Propulsion Laboratory, Pasadena, CA, 1972.Google Scholar
- 8.G. Leibon. Random Delaunay Triangulations, the Thruston-Andreev Theorem, and Metric Uniformization. Ph.D. Thesis, UCSD, 1999.Google Scholar
- 9.G. Leibon and D. Letscher. Delaunay Triangulations for Riemannian Manifolds. Part I: Existence. Submitted for publication, 2000.Google Scholar
- 10.D. Letscher. Delaunay Triangulations for Riemannian Manifolds. Part II: Algorithms. In Preparation, 2000.Google Scholar
- 11.J. Nash. The Imbedding Problem for Riemannian Manfiolds. Ann. of Math. {}3 (1956), 20-63.Google Scholar
Index Terms
- Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
Recommendations
Conforming weighted delaunay triangulations
Given a set of points together with a set of simplices we show how to compute weights associated with the points such that the weighted Delaunay triangulation of the point set contains the simplices, if possible. For a given triangulated surface, this ...
Constructing Intrinsic Delaunay Triangulations from the Dual of Geodesic Voronoi Diagrams
Intrinsic Delaunay triangulation (IDT) naturally generalizes Delaunay triangulation from R2 to curved surfaces. Due to many favorable properties, the IDT whose vertex set includes all mesh vertices is of particular interest in polygonal mesh processing. ...
Delaunay/Voronoi Dual Representation of Smooth 2-Manifolds
CADGRAPHICS '11: Proceedings of the 2011 12th International Conference on Computer-Aided Design and Computer GraphicsDelaunay triangulation and Voronoi diagram are widely used in computer graphics, computational geometry and other fields. Different from the planar case, Delaunay triangulation of a point set on smooth 2-manifolds does not always exist. In this paper we ...
Comments