On the complexity of visibility problems with moving viewpoints

MaRDI QIDQ5290267zbMATH OpenFDO

Authors Peter Gritzmann, Thorsten Theobald

Publication date 28 April 2006

Full work available at URL http://www.msri.org/communications/books/Book52/

zbMATH Keywords

computer graphicsvisualization

Mathematics Subject Classification ID

Simultaneous homogeneous approximation, linear forms (11J13) Other problems of combinatorial convexity (52A37) Combinatorial complexity of geometric structures (52C45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1984330
• scientific article; zbMATH DE number 1182918
• Variants of Visibility and their Complexity
• Maintaining visibility of a polygon with a moving point of view
• Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity

Cited in

(3)

• Variants of Visibility and their Complexity
• scientific article; zbMATH DE number 1984330 (Why is no real title available?)
• Non-Euclidean visibility problems

This page was built for publication: On the complexity of visibility problems with moving viewpoints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5290267)