A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS
From MaRDI portal
Publication:3136723
DOI10.1142/S0218195993000117zbMATH Open0776.68113OpenAlexW2156179944MaRDI QIDQ3136723FDOQ3136723
Authors: F. P. Preparata, Jeffrey Scott Vitter
Publication date: 24 October 1993
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195993000117
Recommendations
- A simplified technique for hidden-line elimination in terrains
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
- Efficient hidden surface removal for objects with small union size
- A worst-case efficient algorithm for hidden-line elimination†
- An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (4)
- An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
- Remarks on the computation of the horizon of a digital terrain
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
- 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 Q3136723)