We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of triangles in the terrain, we show the following two results. (i) If the triangles of the terrain have bounded slope and the projection of the set of triangles onto the xy-plane has low density, then the worst-case complexity of a bisector is Θ(n). (ii) If, in addition, the triangles have similar sizes and the domain of the terrain is a rectangle of bounded aspect ratio, then the worst-case complexity of the Voronoi diagram of m point sites is Θ(n +m√n). © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Aronov, B., De Berg, M., & Thite, S. (2008). The complexity of bisectors and Voronoi diagrams on realistic terrains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 100–111). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_9
Mendeley helps you to discover research relevant for your work.