A space-optimal hidden surface removal algorithm for iso-oriented rectangles
DOI10.1142/S0129054120500240zbMATH Open1458.68268arXiv1109.0389OpenAlexW3080282701MaRDI QIDQ5859632FDOQ5859632
Authors: A. Kosmatopoulos, Kostas Tsichlas, Athanasios K. Tsakalidis
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.0389
Recommendations
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
Cited In (7)
- Hidden line elimination for isooriented rectangles
- Hidden surface removal for rectangles
- Estimating the efficiency of a uniform-grid two-dimensional hashing algorithm for hidden line and surface removal in computer graphics
- Output-sensitive methods for rectilinear hidden surface removal
- Title not available (Why is that?)
- Space-optimal hidden line elimination for rectangles
- An optimal algorithm for reporting visible rectangles
This page was built for publication: A space-optimal hidden surface removal algorithm for iso-oriented rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859632)