Shortest path solves edge-to-edge visibility in a polygon

Research output: Contribution to journalArticle

Abstract

Given a simple polygon P = (p1, p2, ..., pn) consisting of n edges ei = [pipi+1], i = 1,2, ..., n, two edges ei and ej are said to be visible if there exists a point χε{lunate}ei and a point yε{lunate}ej such that the line segment [χ y] lies in P. An edge-to-edge visibility query asks for whether a specified pair of edges of P is visible. It is shown that with O(n log n) preprocessing of P, an edge-to-edge visibility query can be answered in O(n) time. The algorithm also reports a line-of-sight if the answer is in the affirmative.

Original languageEnglish (US)
Pages (from-to)165-170
Number of pages6
JournalPattern Recognition Letters
Volume4
Issue number3
DOIs
StatePublished - Jan 1 1986

Fingerprint

Visibility

Keywords

  • computational geometry
  • edge-visibility graph
  • geodesic distance
  • graphics
  • image processing
  • polygon triangulation
  • shortest path
  • Weak-visibility

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this

Shortest path solves edge-to-edge visibility in a polygon. / Toussaint, Godfried.

In: Pattern Recognition Letters, Vol. 4, No. 3, 01.01.1986, p. 165-170.

Research output: Contribution to journalArticle

@article{d19eec9d437f4e5aa33575d80f60d6fe,
title = "Shortest path solves edge-to-edge visibility in a polygon",
abstract = "Given a simple polygon P = (p1, p2, ..., pn) consisting of n edges ei = [pipi+1], i = 1,2, ..., n, two edges ei and ej are said to be visible if there exists a point χε{lunate}ei and a point yε{lunate}ej such that the line segment [χ y] lies in P. An edge-to-edge visibility query asks for whether a specified pair of edges of P is visible. It is shown that with O(n log n) preprocessing of P, an edge-to-edge visibility query can be answered in O(n) time. The algorithm also reports a line-of-sight if the answer is in the affirmative.",
keywords = "computational geometry, edge-visibility graph, geodesic distance, graphics, image processing, polygon triangulation, shortest path, Weak-visibility",
author = "Godfried Toussaint",
year = "1986",
month = "1",
day = "1",
doi = "10.1016/0167-8655(86)90015-2",
language = "English (US)",
volume = "4",
pages = "165--170",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Shortest path solves edge-to-edge visibility in a polygon

AU - Toussaint, Godfried

PY - 1986/1/1

Y1 - 1986/1/1

N2 - Given a simple polygon P = (p1, p2, ..., pn) consisting of n edges ei = [pipi+1], i = 1,2, ..., n, two edges ei and ej are said to be visible if there exists a point χε{lunate}ei and a point yε{lunate}ej such that the line segment [χ y] lies in P. An edge-to-edge visibility query asks for whether a specified pair of edges of P is visible. It is shown that with O(n log n) preprocessing of P, an edge-to-edge visibility query can be answered in O(n) time. The algorithm also reports a line-of-sight if the answer is in the affirmative.

AB - Given a simple polygon P = (p1, p2, ..., pn) consisting of n edges ei = [pipi+1], i = 1,2, ..., n, two edges ei and ej are said to be visible if there exists a point χε{lunate}ei and a point yε{lunate}ej such that the line segment [χ y] lies in P. An edge-to-edge visibility query asks for whether a specified pair of edges of P is visible. It is shown that with O(n log n) preprocessing of P, an edge-to-edge visibility query can be answered in O(n) time. The algorithm also reports a line-of-sight if the answer is in the affirmative.

KW - computational geometry

KW - edge-visibility graph

KW - geodesic distance

KW - graphics

KW - image processing

KW - polygon triangulation

KW - shortest path

KW - Weak-visibility

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

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

U2 - 10.1016/0167-8655(86)90015-2

DO - 10.1016/0167-8655(86)90015-2

M3 - Article

AN - SCOPUS:0022858292

VL - 4

SP - 165

EP - 170

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

SN - 0167-8655

IS - 3

ER -