Hidden-surface removal in polyhedral cross-sections
From MaRDI portal
Publication:1104083
Recommendations
Cites work
- scientific article; zbMATH DE number 3825165 (Why is no real title available?)
- scientific article; zbMATH DE number 3780618 (Why is no real title available?)
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder
- A worst-case efficient algorithm for hidden-line elimination†
- Finding the intersection of two convex polyhedra
- Triangulating a simple polygon
Cited in
(15)- Visible surface calculation for complex unstructured polygonal scenes
- Algorithms – ESA 2005
- A systolic algorithm for hidden surface removal
- Hidden surface removal for rectangles
- Visibility-ordering meshed polyhedra
- Ray shooting, depth orders and hidden surface removal
- Generalized hidden surface removal
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra
- scientific article; zbMATH DE number 1911009 (Why is no real title available?)
- Employment of portals for creating aggregate scenes
- The computation of visible-surface representations
- Translating polygons with applications to hidden surface removal
- scientific article; zbMATH DE number 1445393 (Why is no real title available?)
- Hierarchical \(s\)-buffer method
- On circularly-hidden surface removal.
This page was built for publication: Hidden-surface removal in polyhedral cross-sections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104083)