Computing the visibility map of fat objects
From MaRDI portal
Publication:2269142
Recommendations
Cites work
- scientific article; zbMATH DE number 177849 (Why is no real title available?)
- scientific article; zbMATH DE number 1305419 (Why is no real title available?)
- A simple output-sensitive algorithm for hidden surface removal
- Algorithms for Reporting and Counting Geometric Intersections
- Approximate range searching using binary space partitions
- Computation of the axial view of a set of isothetic parallelepipeds
- Computational geometry. Algorithms and applications.
- Efficient hidden surface removal for objects with small union size
- Hidden surface removal for \(c\)-oriented polyhedra
- Hidden surface removal for rectangles
- Improved bounds on the union complexity of fat objects
- New algorithms for special cases of the hidden line elimination problem
- On the Boundary Complexity of the Union of Fat Triangles
- Optimal Search in Planar Subdivisions
- Ray Shooting and Parametric Search
- Ray shooting, depth orders and hidden surface removal
- Realistic input models for geometric algorithms
- Vertical Ray Shooting and Computing Depth Orders for Fat Objects
- Vertical ray shooting for fat objects
This page was built for publication: Computing the visibility map of fat objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269142)