Intersection of Nonconvex Polygons Using the Alternate Hierarchical Decomposition

Rizwan Bulbul*, Andrew U. Frank

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Intersection computation is one of the fundamental operations of computational geometry. This paper presents an algorithm for intersection computation between two polygons (convex/nonconvex, with nonintersecting edges, and with or without holes). The approach is based on the decomposed representation of polygons, alternate hierarchical decomposition (AHD), that decomposes the nonconvex polygon into its convex components (convex hulls) arranged hierarchically in a tree data structure called convex hull tree (CHT). The overall approach involves three operations (1) intersection between two convex objects (2) intersection between a convex and a CHT (nonconvex object) and, (3) intersection between two CHTs (two nonconvex objects). This gives for (1) the basic operation of intersection computation between two convex hulls, for (2) the CHT traversal with basic operation in (1) and, for (3) the CHT traversal with operation in (2). Only the basic operation of intersection of two convex hulls is geometric (for which well known algorithms exist) and the other operations are repeated application of this by traversing tree structures.
Original languageEnglish
Title of host publicationGeospatial Thinking
EditorsMarco Painho
Place of PublicationBerlin
PublisherSpringer Verlag
Chapter1
Pages1-23
ISBN (Electronic)978-3-642-12326-9
ISBN (Print)978-3-642-12325-2
DOIs
Publication statusPublished - 31 Mar 2010
Externally publishedYes
Event13th AGILE International Conference on Geographic Information Science - Guimarães, Portugal
Duration: 10 May 201014 May 2010

Publication series

NameLecture Notes in Geoinformation and Cartography

Conference

Conference13th AGILE International Conference on Geographic Information Science
Abbreviated titleAGILE 2010
CountryPortugal
CityGuimarães
Period10/05/1014/05/10

Fingerprint Dive into the research topics of 'Intersection of Nonconvex Polygons Using the Alternate Hierarchical Decomposition'. Together they form a unique fingerprint.

Cite this