An Algorithm for Constructing a Quadtree from Polygonal Regions

Simple item page
dc.contributor.authorCasciani, T.en_US
dc.contributor.authorFalcidieno, B.en_US
dc.contributor.authorFasciolo, G.en_US
dc.contributor.authorPienovi, C.en_US
dc.date.accessioned2014-07-31T09:06:24Z
dc.date.available2014-07-31T09:06:24Z
dc.date.issued1984en_US
dc.description.abstractQuadtrees 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.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume3en_US
dc.identifier.doi10.1111/j.1467-8659.1984.tb00160.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages269-274en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1984.tb00160.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titleAn Algorithm for Constructing a Quadtree from Polygonal Regionsen_US
Files
Collections
Issue 4