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

DOI10.1016/0167-8655(85)90040-6zbMATH Open0555.68062OpenAlexW2050126720MaRDI QIDQ3219151FDOQ3219151

Authors: David Rappaport, Godfried 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

Recommendations

• A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
• Visibility of a simple polygon
• A linear algorithm for eliminating hidden-lines from a polygonal cylinder
• A worst-case efficient algorithm for hidden-line elimination^†
• scientific article; zbMATH DE number 3876624

zbMATH Keywords

computational geometrydiscrete 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)

Cited In (7)

• A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
• A linear algorithm for eliminating hidden-lines from a polygonal cylinder
• Title not available (Why is that?)
• Visibility of a simple polygon
• Visibility between two edges of a simple polygon
• Line-star-shapedness -- a further generalization of star-shapedness
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219151)