A space-optimal hidden surface removal algorithm for iso-oriented rectangles
From MaRDI portal
Publication:5859632
DOI10.1142/S0129054120500240zbMATH Open1458.68268arXiv1109.0389OpenAlexW3080282701MaRDI QIDQ5859632FDOQ5859632
Athanasios K. Tsakalidis, A. Kosmatopoulos, Kostas Tsichlas
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Abstract: We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of iso-oriented rectangles we report all visible surfaces in time and linear space, where is the number of surfaces reported. The previous best result by Bern, has the same time complexity but uses space.
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)