39 search results - page 4 / 8 » Efficient Computation of 3D Clipped Voronoi Diagram |
NETGAMES
2004
ACM
14 years 3 months ago
2004
ACM
We propose a fully-distributed peer-to-peer architecture to solve the scalability problem of Networked Virtual Environment in a simple and efficient manner. Our method exploits lo...
SMA
2008
ACM
13 years 10 months ago
2008
ACM
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
JGTOOLS
2006
13 years 10 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
CAIP
1997
Springer
14 years 2 months ago
1997
Springer
Abstract—This work presents a method for the registration of threedimensional (3-D) shapes. The method is based on the iterative closest point (ICP) algorithm and improves it thr...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...