Computing the visibility map of fat objects
DOI10.1016/J.COMGEO.2008.12.010zbMATH Open1187.65022OpenAlexW2146869451MaRDI QIDQ2269142FDOQ2269142
Authors: Chris Gray, Mark de Berg 
Publication date: 16 March 2010
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/computing-the-visibility-map-of-fat-objects(2f317dad-fa35-4b99-ac46-c3d515cbcdd2).html
Recommendations
algorithmpolyhedracombinatorial complexitycurved objectsfat objectshidden-surface removalvisibility maprealistic input
Complexity and performance of numerical algorithms (65Y20) Computational issues in computer and robotic vision (65D19)
Cites Work
- Computational geometry. Algorithms and applications.
- Algorithms for Reporting and Counting Geometric Intersections
- Optimal Search in Planar Subdivisions
- Improved bounds on the union complexity of fat objects
- Ray shooting, depth orders and hidden surface removal
- Realistic input models for geometric algorithms
- Approximate range searching using binary space partitions
- Computation of the axial view of a set of isothetic parallelepipeds
- On the Boundary Complexity of the Union of Fat Triangles
- Vertical Ray Shooting and Computing Depth Orders for Fat Objects
- Ray Shooting and Parametric Search
- Efficient hidden surface removal for objects with small union size
- New algorithms for special cases of the hidden line elimination problem
- Title not available (Why is that?)
- Hidden surface removal for rectangles
- A simple output-sensitive algorithm for hidden surface removal
- Vertical ray shooting for fat objects
- Hidden surface removal for \(c\)-oriented polyhedra
- Title not available (Why is that?)
Cited In (1)
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)
