205 search results - page 11 / 41 » On Deletion in Delaunay Triangulations |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
DGCI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Existing theories on shape digitization impose strong constraints on feasible shapes and require error-free measurements. We use Delaunay triangulation and -shapes to pro...
OPODIS
2004
13 years 9 months ago
2004
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
CCCG
2010
13 years 9 months ago
2010
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation of B R there is no edge connecting two blue points...