Premium
An Algorithm for Constructing a Quadtree from Polygonal Regions
Author(s) -
Casciani T.,
Falcidieno B.,
Fasciolo G.,
Pienovi C.
Publication year - 1984
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.1984.tb00160.x
Subject(s) - quadtree , representation (politics) , computer science , boundary representation , boundary (topology) , class (philosophy) , computer graphics (images) , data structure , algorithm , theoretical computer science , artificial intelligence , mathematics , mathematical analysis , politics , political science , law , programming language
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.