Skip Navigation

The Computer Journal 1989 32(6):554-562; doi:10.1093/comjnl/32.6.554
© 1989 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kirby, G. H.
Right arrow Articles by Wade, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Computer Graphics: Recognition and Representation of a Hierarchy of Polygons with Holes

G. H. Kirby, M. Visvalingam and P. Wade

Department of Computer Science, University of Hull, Hull HU6 7RX

Received 1 September 1987; revised 1 November 1987

Polygons with holes must be handled in digital cartography, 2D and 3D modelling, image analysis and picture generation. The Dissassociative Area Model (DAM) described in this paper uses polygonal units of uncut space, termed primitive regions, in the representation of the geometric and topological properties of a set of areal entities. Algorithms and a data structure are presented which extract boundaries of these polygons from vector data and determine their topology. The algorithms recognise the containment hierarchy of polygons with holes without the need for information relating to the areal entities. The hierarchy is represented by a rooted tree of boundaries, rather than regions, and does not involve bridges between inner and outer boundaries.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.