Abstract
Voronoi diagrams and (weighted) Delaunay triangulations are well known diagrams associated with a set of disks in the plane. Here we introduce a new diagram associated with a set of disks and an efficient algorithm to compute it. The new diagram is closely related to the (weighted) Delaunay diagram.
Partly supported by the IST Programme of the EU as a Shared-cost RTD (FET Open) Project under Contract No IST-2000-26473 (ECG - Effective Computational Geometry for Curves and Surfaces).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Aurenhammer and R. Klein. Voronoi Diagrams. In Handbook of Computational Geometry, J.-R. Sack and J. Urrutia (eds.), pp. 201–290, Elsevier (2000)
H. Edelsbrunner, M. A. Facello and J. Liang. On the definition and the construction of pockets in macromolecules. Discrete Apl. Math. 88, pp. 83–102, (1998)
H. Edelsbrunner. Triangulations and meshes in computational geometry. Acta Numerica 9, pp. 133–213, (2000)
H. Edelsbrunner, J. Harer and A. Zomorodian. Hierarchy of Morse complexes for piecewise linear 2-manifolds. In Proc. 17th Ann. Sympos. Comput. Geom., pp. 70–79, (2001)
J. Giesen and M. John. A Dynamical System from Disks in the Plane. Manuscript (2001)
J. Giesen and M. John. Duality in Disk Induced Flows. Manuscript (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giesen, J., John, M. (2002). A New Diagram from Disks in the Plane. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_19
Download citation
DOI: https://doi.org/10.1007/3-540-45841-7_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43283-8
Online ISBN: 978-3-540-45841-8
eBook Packages: Springer Book Archive