Incremental construction con BRIO using a space-filling curve order for insertion is a popular algorithm for constructing Delaunay triangulations. So far, it has only been analyzed for the case that a worst-case optimal point location data structure is used which is often avoided in implementations. In this paper, we analyze its running time for the more typical case that points are located by walking. We show that in the worst-case the algorithm needs quadratic time, but that this can only happen in degenerate cases. We show that the algorithm runs in O(n logn) time under realistic assumptions. Furthermore, we show that it runs in expected linear time for many random point distributions. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Buchin, K. (2009). Constructing delaunay triangulations along space-filling curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5757 LNCS, pp. 119–130). https://doi.org/10.1007/978-3-642-04128-0_11
Mendeley helps you to discover research relevant for your work.