50 search results - page 4 / 10 » The voronoi diagram of three lines |
ISVD
2007
IEEE
14 years 1 days ago
2007
IEEE
Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. T...
COMPGEOM
1994
ACM
13 years 10 months ago
1994
ACM
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...
SMA
2008
ACM
13 years 5 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...
CGVR
2006
13 years 7 months ago
2006
In this paper we introduce an algorithm for simplifying a 2D discrete region. This algorithm is based on a bipolar model of regions. Given a discrete region, we cut its Voronoi di...
ADHOCNETS
2009
Springer
14 years 12 days ago
2009
Springer
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...