Space reduction and an extension for a hidden line elimination algorithm
From MaRDI portal
Recommendations
- Space-optimal hidden line elimination for rectangles
- A worst-case efficient algorithm for hidden-line elimination†
- On Reducing the Space Requirements of a Straight-Line Algorithm
- scientific article; zbMATH DE number 3974354
- New algorithms for special cases of the hidden line elimination problem
- On the hidden line removal problem
- A linear space algorithm for the LCS problem
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder
- Efficient and small representation of line arrangements with applications
- Lineability and spaceability: a new approach
Cites work
- Algorithms for Reporting and Counting Geometric Intersections
- Applications of a new space-partitioning technique
- Comments on “algorithms for reporting and counting geometric intersections”
- Efficient hidden surface removal for objects with small union size
- Efficient ray shooting and hidden surface removal
- Hidden surface removal for rectangles
- scientific article; zbMATH DE number 177849 (Why is no real title available?)
- Making data structures persistent
Cited in
(10)- A linear algorithm for eliminating hidden-lines from a polygonal cylinder
- Hidden-line algorithm based on range searching
- The space-optimal version of a known rectangle enclosure reporting algorithm
- Some Results for Elementary Operations
- scientific article; zbMATH DE number 3974354 (Why is no real title available?)
- On the hidden line removal problem
- 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 169433 (Why is no real title available?)
- Space-optimal hidden line elimination for rectangles
This page was built for publication: Space reduction and an extension for a hidden line elimination algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126253)
