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 - Dec 1986

    Fingerprint

Keywords

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

ASJC Scopus subject areas

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

Cite this