Dynamic algorithms in computational geometry

Dynamic algorithms in computational geometry

Dynamic algorithms and data structures in the area of computational geometry are surveyed. The work has a twofold purpose: it introduces the area to the nonspecialist and reviews the state of the art for the specialist. Fundamental data structures, such as balanced search trees and general technique...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the IEEE 1992-09, Vol.80 (9), p.1412-1434
Hauptverfasser: Chiang, Y.-J., Tamassia, R.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Application software
Applied sciences
Circuits
Computational geometry
Computer graphics
Computer science
control theory
systems
Data structures
Design automation
Distributed computing
Exact sciences and technology
Heuristic algorithms
Layout
Theoretical computing
Very large scale integration
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Dynamic algorithms and data structures in the area of computational geometry are surveyed. The work has a twofold purpose: it introduces the area to the nonspecialist and reviews the state of the art for the specialist. Fundamental data structures, such as balanced search trees and general techniques for dynamization, are reviewed. Range searching, intersections, point location, convex hull, and proximity are discussed. Problems that do not fall into these categories are also discussed. Open problems are given.< >
ISSN:0018-9219
1558-2256
DOI:10.1109/5.163409