A weak definition of Delaunay triangulation

Details A weak definition of Delaunay triangulation A weak definition of Delaunay triangulation

2003-10-16

arxiv.org/abs/cs/0310031v1

Computer Science

Computational Geometry

8 pages, 4 figures

Scientific paper

We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it applies to hyperbolic and hemispherical geometries and to Edelsbrunner's weighted Delaunay triangulation. In spherical geometry, we establish a similar theorem under a genericity condition. The weak definition finds natural application in the problem of approximating a point-cloud data set with a simplical complex.

Affiliated with

Also associated with

No associations

Rating

A weak definition of Delaunay triangulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A weak definition of Delaunay triangulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A weak definition of Delaunay triangulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21982