A simple linear hidden-line algorithm for star-shaped polygons

  • Authors:

  • David Rappaport;Godfried T Toussaint

  • Affiliations:

  • School of Computer Science, McGill University, 805 Sherbrooke Street West, Montreal, Quebec, H3A 2K6, Canada;School of Computer Science, McGill University, 805 Sherbrooke Street West, Montreal, Quebec, H3A 2K6, Canada

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 1985

Quantified Score

Hi-index 0.10

Visualization

Abstract

A very simple, linear-running-time algorithm is presented for solving the hidden-line problem for star-shaped polygons. The algorithm first decomposes the visibility regions into edge-visible polygons and then solves the hidden-line problem for these simpler polygons. In addition to simplicity the algorithm possesses the virtue of affording a very easy proof of correctness. Some applications where this problem arises are mentioned.