DocumentCode
938950
Title
Dynamic algorithms in computational geometry
Author
Chiang, Yi-Jen ; Tamassia, Roberto
Author_Institution
Dept. of Comput. Sci., Brown Univ., Providence, RI, USA
Volume
80
Issue
9
fYear
1992
fDate
9/1/1992 12:00:00 AM
Firstpage
1412
Lastpage
1434
Abstract
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
Keywords
computational geometry; spatial data structures; balanced search trees; computational geometry; convex hull; data structures; dynamic algorithms; intersections; point location; proximity; Application software; Circuits; Computational geometry; Computer graphics; Data structures; Design automation; Distributed computing; Heuristic algorithms; Layout; Very large scale integration;
fLanguage
English
Journal_Title
Proceedings of the IEEE
Publisher
ieee
ISSN
0018-9219
Type
jour
DOI
10.1109/5.163409
Filename
163409
Link To Document