Space-optimal hidden line elimination for rectangles
From MaRDI portal
Publication:673345
DOI10.1016/S0020-0190(96)00161-5zbMATH Open0900.68437OpenAlexW1980182991MaRDI QIDQ673345FDOQ673345
Athanasios K. Tsakalidis, Nectarios Kitsios
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00161-5
Recommendations
- Space reduction and an extension for a hidden line elimination algorithm
- Hidden line elimination for isooriented rectangles
- A space-optimal hidden surface removal algorithm for iso-oriented rectangles
- A worst-case efficient algorithm for hidden-line elimination†
- On the hidden line removal problem
- An optimal time and minimal space algorithm for rectangle intersection problems
- Time-and space-optimal contour computation for a set of rectangles
- scientific article; zbMATH DE number 3974354
- New algorithms for special cases of the hidden line elimination problem
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder
Cites Work
Cited In (8)
- Hidden line elimination for isooriented rectangles
- Hidden surface removal for rectangles
- Space reduction and an extension for a hidden line elimination algorithm
- Some Results for Elementary Operations
- Output-sensitive methods for rectilinear hidden surface removal
- New algorithms for special cases of the hidden line elimination problem
- An optimal algorithm for reporting visible rectangles
- A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles
This page was built for publication: Space-optimal hidden line elimination for rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673345)
