Abstract
We focus on making compressed quadtrees, particularly those used in the implementation of well-separated pair decomposition, into effective dynamic data structures. We use random shifting to achieve logarithmic insertion and deletion time per pair with high probability.
| Original language | English (US) |
|---|---|
| Pages | 235-238 |
| Number of pages | 4 |
| State | Published - 2005 |
| Externally published | Yes |
| Event | 17th Canadian Conference on Computational Geometry, CCCG 2005 - Windsor, Canada Duration: Aug 10 2005 → Aug 12 2005 |
Conference
| Conference | 17th Canadian Conference on Computational Geometry, CCCG 2005 |
|---|---|
| Country/Territory | Canada |
| City | Windsor |
| Period | 8/10/05 → 8/12/05 |
ASJC Scopus subject areas
- Geometry and Topology
- Computational Mathematics