A simplified technique for hidden-line elimination in terrains
From MaRDI portal
Publication:5096777
DOI10.1007/3-540-55210-3_179zbMATH Open1493.68375OpenAlexW1494374831MaRDI QIDQ5096777FDOQ5096777
Authors: F. P. Preparata, Jeffrey Scott Vitter
Publication date: 18 August 2022
Published in: STACS 92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55210-3_179
Recommendations
- A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS
- Efficient hidden surface removal for objects with small union size
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder
- A worst-case efficient algorithm for hidden-line elimination†
Analysis of algorithms (68W40) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
Cited In (5)
- Dynamic convex hulls under window-sliding updates
- An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
- Remarks on the computation of the horizon of a digital terrain
- Three-dimensional weak visibility: Complexity and applications
- A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS
This page was built for publication: A simplified technique for hidden-line elimination in terrains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096777)