A linear algorithm for eliminating hidden-lines from a polygonal cylinder
From MaRDI portal
Recommendations
- A worst-case efficient algorithm for hidden-line elimination†
- New algorithms for special cases of the hidden line elimination problem
- scientific article; zbMATH DE number 3974354
- A simple linear hidden-line algorithm for star-shaped polygons
- Space reduction and an extension for a hidden line elimination algorithm
Cites work
- scientific article; zbMATH DE number 3780616 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra
- A linear algorithm for computing the visibility polygon from a point
- A linear algorithm for finding the convex hull of a simple polygon
- Finding the convex hull of a simple polygon
Cited in
(11)- A simple linear hidden-line algorithm for star-shaped polygons
- Perspective projection of non-convex polyhedra
- Space-optimal hidden line elimination for rectangles
- On the hidden line removal problem
- Space reduction and an extension for a hidden line elimination algorithm
- Visibility between two edges of a simple polygon
- Hidden-line algorithm for curved surfaces
- A worst-case efficient algorithm for hidden-line elimination†
- Hidden-surface removal in polyhedral cross-sections
- A simplified technique for hidden-line elimination in terrains
- scientific article; zbMATH DE number 3974354 (Why is no real title available?)
This page was built for publication: A linear algorithm for eliminating hidden-lines from a polygonal cylinder
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099952)
