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 regular k-gon and study the robustness of the algorithm. Following the algorithmic degree model [G. Liotta, F.P. Preparata, R. Tamassia, Robust proximity queries: an illustration of degree-driven algorithm design, SIAM J. Comput. 28 (3) (1998) 864

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu
• Keywords: Algorithm, IPL 2006, Plane Sweep Algorithm, Voronoi Diagram