|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
On Encoding Boundaries with Quadtrees
March 1984 (vol. 6 no. 3)
pp. 365-369
| ASCII Text | x | ||
| Hanan Samet, Robert E. Webber, "On Encoding Boundaries with Quadtrees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 3, pp. 365-369, March, 1984. | |||
| BibTex | x | ||
| @article{ 10.1109/TPAMI.1984.4767529, author = {Hanan Samet and Robert E. Webber}, title = {On Encoding Boundaries with Quadtrees}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {6}, number = {3}, issn = {0162-8828}, year = {1984}, pages = {365-369}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.1984.4767529}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - On Encoding Boundaries with Quadtrees IS - 3 SN - 0162-8828 SP365 EP369 EPD - 365-369 A1 - Hanan Samet, A1 - Robert E. Webber, PY - 1984 VL - 6 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
The ``line quadtree'' data structure hierarchically represents a region and its boundary. Based on the standard quadtree, each node in this structure stores adjacency information as well. While line quadtrees use the same amount of space as standard qaudtrees, they facilitate several region processing algorithms. In particular, we describe efficient algorithms for boundary and superimposing two maps encoded as line quadtrees.
Citation:
Hanan Samet, Robert E. Webber, "On Encoding Boundaries with Quadtrees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 3, pp. 365-369, March 1984, doi:10.1109/TPAMI.1984.4767529
Usage of this product signifies your acceptance of the Terms of Use.