An algorithm to determine the directional relationship between arbitrarily-shaped polygons in the plane

Donna Jean Peuquet, Zhan Ci-Xiang

Research output: Contribution to journalArticle

134 Citations (Scopus)

Abstract

The directional relationship between two polygons (e.g. left, above, beside, east, north) is an important spatial property and can also be used as a selection criterion for retrieving objects from a spatial database. If the database is large, this could help significantly in speeding search by reducing the size of the necessary search space. This paper builds upon past work to develop a model for determining the directional relationship in 2-D space between two simply-connected polygons of arbitrary shape, size and distance from each other. The model is based on visual interpretation and is data structure independent. The model is also stated in algorithmic terms, and is found to have a computational complexity of O(n), where n is the total number of vertices or cells used to represent the two polygons.

Original languageEnglish (US)
Pages (from-to)65-74
Number of pages10
JournalPattern Recognition
Volume20
Issue number1
DOIs
StatePublished - Jan 1 1987

Fingerprint

Data structures
Computational complexity

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{4d740121eb2e4137bf12d0c02b057a1d,
title = "An algorithm to determine the directional relationship between arbitrarily-shaped polygons in the plane",
abstract = "The directional relationship between two polygons (e.g. left, above, beside, east, north) is an important spatial property and can also be used as a selection criterion for retrieving objects from a spatial database. If the database is large, this could help significantly in speeding search by reducing the size of the necessary search space. This paper builds upon past work to develop a model for determining the directional relationship in 2-D space between two simply-connected polygons of arbitrary shape, size and distance from each other. The model is based on visual interpretation and is data structure independent. The model is also stated in algorithmic terms, and is found to have a computational complexity of O(n), where n is the total number of vertices or cells used to represent the two polygons.",
author = "Peuquet, {Donna Jean} and Zhan Ci-Xiang",
year = "1987",
month = "1",
day = "1",
doi = "10.1016/0031-3203(87)90018-5",
language = "English (US)",
volume = "20",
pages = "65--74",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",
number = "1",

}

An algorithm to determine the directional relationship between arbitrarily-shaped polygons in the plane. / Peuquet, Donna Jean; Ci-Xiang, Zhan.

In: Pattern Recognition, Vol. 20, No. 1, 01.01.1987, p. 65-74.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An algorithm to determine the directional relationship between arbitrarily-shaped polygons in the plane

AU - Peuquet, Donna Jean

AU - Ci-Xiang, Zhan

PY - 1987/1/1

Y1 - 1987/1/1

N2 - The directional relationship between two polygons (e.g. left, above, beside, east, north) is an important spatial property and can also be used as a selection criterion for retrieving objects from a spatial database. If the database is large, this could help significantly in speeding search by reducing the size of the necessary search space. This paper builds upon past work to develop a model for determining the directional relationship in 2-D space between two simply-connected polygons of arbitrary shape, size and distance from each other. The model is based on visual interpretation and is data structure independent. The model is also stated in algorithmic terms, and is found to have a computational complexity of O(n), where n is the total number of vertices or cells used to represent the two polygons.

AB - The directional relationship between two polygons (e.g. left, above, beside, east, north) is an important spatial property and can also be used as a selection criterion for retrieving objects from a spatial database. If the database is large, this could help significantly in speeding search by reducing the size of the necessary search space. This paper builds upon past work to develop a model for determining the directional relationship in 2-D space between two simply-connected polygons of arbitrary shape, size and distance from each other. The model is based on visual interpretation and is data structure independent. The model is also stated in algorithmic terms, and is found to have a computational complexity of O(n), where n is the total number of vertices or cells used to represent the two polygons.

UR - http://www.scopus.com/inward/record.url?scp=0023137785&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023137785&partnerID=8YFLogxK

U2 - 10.1016/0031-3203(87)90018-5

DO - 10.1016/0031-3203(87)90018-5

M3 - Article

AN - SCOPUS:0023137785

VL - 20

SP - 65

EP - 74

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

IS - 1

ER -