A linear-time algorithm for solving the strong hidden-line problem in a simple polygon

Research output: Contribution to journalArticle

Abstract

A linear-time algorithm is presented for solving the strong hidden-line problem in a simple polygon P, or alternately, determining the region in P weakly visible from a specified edge of P. The algorithm combines results from visibility and shortest paths with the linear-time polygon triangulation algorithm discovered recently by Tarjan and Van Wyk. Previous published algorithms for the strong hidden-line problem require O(n logn) steps even after triangulation, where n is the cardinality of P.

Original languageEnglish (US)
Pages (from-to)449-451
Number of pages3
JournalPattern Recognition Letters
Volume4
Issue number6
DOIs
StatePublished - Jan 1 1986

Fingerprint

Triangulation
Visibility

Keywords

  • computer geometry
  • computer graphics
  • shortest paths
  • strong hidden-line problem
  • triangulation
  • Weak visibility

ASJC Scopus subject areas

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

Cite this

A linear-time algorithm for solving the strong hidden-line problem in a simple polygon. / Toussaint, Godfried.

In: Pattern Recognition Letters, Vol. 4, No. 6, 01.01.1986, p. 449-451.

Research output: Contribution to journalArticle

@article{619f239dac604072967ca6a140572577,
title = "A linear-time algorithm for solving the strong hidden-line problem in a simple polygon",
abstract = "A linear-time algorithm is presented for solving the strong hidden-line problem in a simple polygon P, or alternately, determining the region in P weakly visible from a specified edge of P. The algorithm combines results from visibility and shortest paths with the linear-time polygon triangulation algorithm discovered recently by Tarjan and Van Wyk. Previous published algorithms for the strong hidden-line problem require O(n logn) steps even after triangulation, where n is the cardinality of P.",
keywords = "computer geometry, computer graphics, shortest paths, strong hidden-line problem, triangulation, Weak visibility",
author = "Godfried Toussaint",
year = "1986",
month = "1",
day = "1",
doi = "10.1016/0167-8655(86)90043-7",
language = "English (US)",
volume = "4",
pages = "449--451",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
publisher = "Elsevier",
number = "6",

}

TY - JOUR

T1 - A linear-time algorithm for solving the strong hidden-line problem in a simple polygon

AU - Toussaint, Godfried

PY - 1986/1/1

Y1 - 1986/1/1

N2 - A linear-time algorithm is presented for solving the strong hidden-line problem in a simple polygon P, or alternately, determining the region in P weakly visible from a specified edge of P. The algorithm combines results from visibility and shortest paths with the linear-time polygon triangulation algorithm discovered recently by Tarjan and Van Wyk. Previous published algorithms for the strong hidden-line problem require O(n logn) steps even after triangulation, where n is the cardinality of P.

AB - A linear-time algorithm is presented for solving the strong hidden-line problem in a simple polygon P, or alternately, determining the region in P weakly visible from a specified edge of P. The algorithm combines results from visibility and shortest paths with the linear-time polygon triangulation algorithm discovered recently by Tarjan and Van Wyk. Previous published algorithms for the strong hidden-line problem require O(n logn) steps even after triangulation, where n is the cardinality of P.

KW - computer geometry

KW - computer graphics

KW - shortest paths

KW - strong hidden-line problem

KW - triangulation

KW - Weak visibility

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

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

U2 - 10.1016/0167-8655(86)90043-7

DO - 10.1016/0167-8655(86)90043-7

M3 - Article

VL - 4

SP - 449

EP - 451

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

SN - 0167-8655

IS - 6

ER -