Sciweavers

8 search results - page 1 / 2
» The Voronoi Diagram of Planar Convex Objects
Sort
View
ESA
2003
Springer
118views Algorithms» more  ESA 2003»
13 years 9 months ago
The Voronoi Diagram of Planar Convex Objects
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
Menelaos I. Karavelas, Mariette Yvinec
CCCG
2006
13 years 6 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
Asish Mukhopadhyay, Robert L. Scot Drysdale
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
13 years 4 months ago
Voronoi diagram computations for planar NURBS curves
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...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber
CGF
2008
113views more  CGF 2008»
13 years 4 months ago
Surface sampling and the intrinsic Voronoi diagram
We develop adaptive sampling criteria which guarantee a topologically faithful mesh and demonstrate an improvement and simplification over earlier results, albeit restricted to 2D...
Ramsay Dyer, Hao Zhang 0002, Torsten Möller
ASPDAC
2008
ACM
74views Hardware» more  ASPDAC 2008»
13 years 6 months ago
Large-scale fixed-outline floorplanning design using convex optimization techniques
A two-stage optimization methodology is proposed to solve the fixed-outline floorplanning problem that is a global optimization problem for wirelength minimization. In the first st...
Chaomin Luo, Miguel F. Anjos, Anthony Vannelli