Abstract
Research on dynamic algorithms for geometric problems has received increasing attention in recent years, and is motivated by many important applications in circuit layout, computer graphics, and computer-aided design. In this paper we survey dynamic algorithms and data structures in the area of computational geometry. Our work has a twofold purpose: It introduces the area to the nonspecialist and reviews the state of the art for the specialist.
Original language | English (US) |
---|---|
Pages (from-to) | 1412-1434 |
Number of pages | 23 |
Journal | Proceedings of the IEEE |
Volume | 80 |
Issue number | 9 |
DOIs | |
State | Published - 1992 |
ASJC Scopus subject areas
- General Computer Science
- Electrical and Electronic Engineering