Sciweavers

127 search results - page 4 / 26
» On the Construction of Abstract Voronoi Diagrams
Sort
View
NETGAMES
2004
ACM
14 years 25 days ago
Scalable peer-to-peer networked virtual environment
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...
Shun-Yun Hu, Guan-Ming Liao
IPL
2006
108views more  IPL 2006»
13 years 7 months ago
Robustness of k-gon Voronoi diagram construction
In this paper, we present a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2D space using a distance metric induced by a regu...
Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu
COMPGEOM
1993
ACM
13 years 11 months ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
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...
Rolf Klein, Andrzej Lingas
P2P
2010
IEEE
144views Communications» more  P2P 2010»
13 years 5 months ago
Hivory: Range Queries on Hierarchical Voronoi Overlays
Abstract—The problem of defining a support for multidimensional range queries on P2P overlays is currently an active field of research. Several approaches based on the extensio...
Matteo Mordacchini, Laura Ricci, Luca Ferrucci, Mi...
COMPGEOM
1994
ACM
13 years 11 months ago
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
Pankaj K. Agarwal, Mark de Berg, Jirí Matou...