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

DOI10.1016/0167-8655(85)90040-6zbMath0555.68062OpenAlexW2050126720MaRDI QIDQ3219151

David Rappaport, Godfried T. Toussaint

Publication date: 1985

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(85)90040-6

zbMATH Keywords

discrete geometrycomputational geometryvisibility regionsstar-shaped polygonshidden-line problemlinear-running-time algorithm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Visibility between two edges of a simple polygon

This page was built for publication: A simple linear hidden-line algorithm for star-shaped polygons