| dc.contributor.author | Casciani, T. | en_US |
| dc.contributor.author | Falcidieno, B. | en_US |
| dc.contributor.author | Fasciolo, G. | en_US |
| dc.contributor.author | Pienovi, C. | en_US |
| dc.date.accessioned | 2014-07-31T09:06:24Z | |
| dc.date.available | 2014-07-31T09:06:24Z | |
| dc.date.issued | 1984 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1111/j.1467-8659.1984.tb00160.x | en_US |
| dc.description.abstract | Quadtrees are a class of hierarchical data structures particularly suitable for the representation of images in a compact form. In this paper a new algorithm is described which builds up the quadtree corresponding to polygonal multiply connected regions starting from their boundary representation. | en_US |
| dc.publisher | Blackwell Publishing Ltd and the Eurographics Association | en_US |
| dc.title | An Algorithm for Constructing a Quadtree from Polygonal Regions | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 3 | en_US |
| dc.description.number | 4 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.1984.tb00160.x | en_US |
| dc.identifier.pages | 269-274 | en_US |
