An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains

DOI10.1016/0895-7177(95)00016-UzbMath0817.68084OpenAlexW2123364943WikidataQ126589630 ScholiaQ126589630MaRDI QIDQ1804963

Sandeep Sen, John H. Reif

Publication date: 15 August 1995

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(95)00016-u

zbMATH Keywords

optimal algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (2)

An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains ⋮ A frame for general divide-and-conquer recurrences

Cites Work

• Unnamed Item
• Unnamed Item
• Maintenance of configurations in the plane
• Efficient hidden surface removal for objects with small union size
• An improved technique for output-sensitive hidden surface removal
• Efficient ray shooting and hidden surface removal
• An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
• A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS
• Location of a Point in a Planar Subdivision and Its Applications

This page was built for publication: An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains