208 search results - page 11 / 42 » Blocking delaunay triangulations |
COMPGEOM
2010
ACM
14 years 15 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...
COMPGEOM
2003
ACM
14 years 20 days ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
OPODIS
2004
13 years 8 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...
COMPUTING
2007
13 years 7 months ago
2007
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...