Maintaining visibility of a polygon with a moving point of view

DOI10.1016/S0020-0190(97)00211-1zbMath1338.68259MaRDI QIDQ293260

Danny Z. Chen, Ovidiu Daescu

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097002111?np=y

zbMATH Keywords

computational complexityvisibilitymoving point of viewperspective view

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items

Vertex Guarding for Dynamic Orthogonal Art Galleries, Diffuse reflection radius in a simple polygon, Guarding a terrain by two watchtowers, Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane, Altitude terrain guarding and guarding uni-monotone polygons, Shortest zookeeper's routes in simple polygons

Cites Work

• Unnamed Item
• Visibility and intersection problems in plane geometry
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Triangulating a simple polygon in linear time
• Visibility with a moving point of view
• Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
• Computing the visibility polygon from an edge
• A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains