COMPGEOM 2000 - PDF Preprint Papers

COMPGEOM 2000 ACM Symposium on Computational Geometry

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMPGEOM-2000 Paper

click to vote

COMPGEOM
2000
ACM

390views Discrete Geometry» more COMPGEOM 2000»

Delaunay triangulations and Voronoi diagrams for Riemannian manifolds

13 years 9 months ago

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 Eu...

Greg Leibon, David Letscher

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	390	Delaunay triangulations and Voronoi diagrams for Riemannian manifolds	claim
2	226	Fast computation of generalized Voronoi diagrams using graphics hardware	claim
3	143	An efficient, exact, and generic quadratic programming solver for geometric optimization	claim
4	139	Computing approximate shortest paths on convex polytopes	claim
5	139	Fast software for box intersections	claim
6	130	Look - a Lazy Object-Oriented Kernel for geometric computation	claim
7	130	An algorithm for searching a polygonal region with a flashlight	claim
8	130	Algebraic methods and arithmetic filtering for exact predicates on circle arcs	claim
9	113	Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus	claim
10	107	Mesh generation for domains with small angles	claim
11	107	Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations	claim
12	106	Smooth surface reconstruction via natural neighbour interpolation of distance functions	claim
13	106	Point set labeling with specified positions	claim
14	97	Pitfalls in computing with pseudorandom determinants	claim
15	92	Multivariate regression depth	claim
16	90	When crossings count - approximating the minimum spanning tree	claim
17	89	A trace bound for the hereditary discrepancy	claim
18	87	Kinetic connectivity for unit disks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers