Computing the visibility map of fat objects

DOI10.1016/j.comgeo.2008.12.010zbMath1187.65022OpenAlexW2146869451MaRDI QIDQ2269142

Chris Gray, Mark T. 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

zbMATH Keywords

algorithmpolyhedracombinatorial complexityhidden-surface removalcurved objectsfat objectsvisibility maprealistic input

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Computational issues in computer and robotic vision (65D19)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hidden surface removal for rectangles
• Improved bounds on the union complexity of fat objects
• Hidden surface removal for \(c\)-oriented polyhedra
• Efficient hidden surface removal for objects with small union size
• Ray shooting, depth orders and hidden surface removal
• Realistic input models for geometric algorithms
• Approximate range searching using binary space partitions
• Algorithms for Reporting and Counting Geometric Intersections
• Ray Shooting and Parametric Search
• On the Boundary Complexity of the Union of Fat Triangles
• Computation of the axial view of a set of isothetic parallelepipeds
• Vertical Ray Shooting and Computing Depth Orders for Fat Objects
• New algorithms for special cases of the hidden line elimination problem
• Optimal Search in Planar Subdivisions
• A simple output-sensitive algorithm for hidden surface removal
• Vertical ray shooting for fat objects

This page was built for publication: Computing the visibility map of fat objects