Abstract
We have defined a semi-dynamic data structure for constructing the Delaunay triangulation, based on the knowledge of the history of the incremental construction.
It is possible to generalize this structure, keeping the same idea of remembering the previous steps of the construction. This general structure, the Influence graph, is presented in Chapter 4.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1993). The Delaunay tree. In: Towards Dynamic Randomized Algorithms in Computational Geometry. Lecture Notes in Computer Science, vol 758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57503-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-57503-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57503-0
Online ISBN: 978-3-540-48202-4
eBook Packages: Springer Book Archive