Sciweavers

CCCG
2008
13 years 5 months ago
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
Jérémy Barbay, Eric Y. Chen
ESA
2003
Springer
118views Algorithms» more  ESA 2003»
13 years 8 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