8 search results - page 1 / 2 » Robustness of k-gon Voronoi diagram construction |
IPL
2006
13 years 4 months ago
2006
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...
TVCG
2008
13 years 4 months ago
2008
In this paper, we propose a generic framework for 3D surface remeshing. Based on a metric-driven Discrete Voronoi Diagram construction, our output is an optimized 3D triangular mes...
SODA
2003
ACM
13 years 5 months ago
2003
ACM
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
SMA
2008
ACM
13 years 4 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...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...