49 search results - page 4 / 10 » Computability of Partial Delaunay Triangulation and Voronoi ... |
URBAN
2008
14 years 10 months ago
2008
127
click to vote
COMPGEOM
2010
ACM
15 years 3 months 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 ...
NOSSDAV
2009
Springer
15 years 5 months ago
2009
Springer
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...
PAMI
2011
14 years 1 months ago
2011
—In the research of computer vision and machine perception, three-dimensional objects are usually represented by 2-manifold triangular meshes M. In this paper, we present practic...
COMPGEOM
1993
ACM
15 years 2 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...