An improved technique for output-sensitive hidden surface removal
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4062593 (Why is no real title available?)
- scientific article; zbMATH DE number 3451445 (Why is no real title available?)
- A simple output-sensitive algorithm for hidden surface removal
- Computation of the axial view of a set of isothetic parallelepipeds
- Dynamic partition trees
- Efficient ray shooting and hidden surface removal
- Hidden surface removal for rectangles
- New algorithms for special cases of the hidden line elimination problem
- Output-sensitive methods for rectilinear hidden surface removal
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
- Space searching for intersecting objects
- The complexity and construction of many faces in arrangements of lines and of segments
- Visibility and intersection problems in plane geometry
Cited in
(12)- Hidden surface removal for \(c\)-oriented polyhedra
- Generalized hidden surface removal
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
- Dynamic partition trees
- THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
- Merging visibility maps
- Dynamic partition trees
- Applications of a new space-partitioning technique
- scientific article; zbMATH DE number 1445393 (Why is no real title available?)
- Hierarchical \(s\)-buffer method
- A simple output-sensitive algorithm for hidden surface removal
This page was built for publication: An improved technique for output-sensitive hidden surface removal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322562)