Abstract
The authors describe an efficient edge-oriented, error-tolerance and mixed-constraint graph compactor based on a simple and fast region-query data structure--the multiple storage (MS) quadtree. The MS quadtree data structure supports a dexterous region search and inherently can be used to handle extended objects such as rhomboids and polygons.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - IEEE International Symposium on Circuits and Systems |
| Publisher | Publ by IEEE |
| Pages | 2435-2438 |
| Number of pages | 4 |
| ISBN (Print) | 9517212410 |
| State | Published - 1988 |
| Externally published | Yes |
Publication series
| Name | Proceedings - IEEE International Symposium on Circuits and Systems |
|---|---|
| Volume | 3 |
| ISSN (Print) | 0271-4310 |