A weak definition of Delaunay triangulation

Simple item page
dc.creatorde Silva, Vin
dc.date2003-10-16
dc.date.accessioned2026-07-07T03:20:27Z
dc.date.available2026-07-07T03:20:27Z
dc.descriptionWe 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.
dc.description8 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/cs/0310031
dc.identifierhttp://arxiv.org/abs/cs/0310031
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31834
dc.subjectComputational Geometry
dc.subjectI.3.5
dc.titleA weak definition of Delaunay triangulation
dc.typetext

Files

Collections

arXiv