Abstract
A fully dynamic algorithm was developed to maintain the width of a set of n planar points. The points were subjected to insertions and deletions in amortized time per update. The decremental algorithm was used to obtain sublinear time bound for the dynamic width problems in the plane.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the Annual Symposium on Computational Geometry |
| Pages | 172-176 |
| Number of pages | 5 |
| State | Published - 2001 |
| Externally published | Yes |
| Event | 17th Annual Symposium on Computational Geometry (SCG'01) - Medford, MA, United States Duration: Jun 3 2001 → Jun 5 2001 |
Other
| Other | 17th Annual Symposium on Computational Geometry (SCG'01) |
|---|---|
| Country/Territory | United States |
| City | Medford, MA |
| Period | 6/3/01 → 6/5/01 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics