AbstractIn this note we prove some facts about the number of segments of a bisector of two sites that are used in a higher order Voronoi diagram.
Categories and Subject Descriptors: F.2.1 [Analysis of Algorithms and Problem Complexity]: Numerical Algorithms and Problems
Additional Key Words and Phrases: computational geometry, Voronoi diagrams
Selected references
- F. Aurenhammer. Power diagrams: Properties, algorithms and applications. SIAM Journal on Computing, 16(1):78-96, February 1987.
- Franz Aurenhammer. Voronoi diagrams -- a survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3):345-405, September 1991.
- Herbert Edelsbrunner. Edge-skeletons in arrangements with applications. Algorithmica, 1(1):93-109, 1986.