The visibility diagram: A data structure for visibility problems and motion planning

DOI10.1007/3-540-52846-6_81zbMath1502.68350OpenAlexW2136775990MaRDI QIDQ5056095

Gert Vegter

Publication date: 9 December 2022

Published in: SWAT 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-52846-6_81

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (6)

On a class of \(O(n^ 2)\) problems in computational geometry ⋮ Randomized approximation algorithms for planar visibility counting problem ⋮ Visibility testing and counting for uncertain segments ⋮ On a class of \(O(n^2)\) problems in computational geometry ⋮ Dynamic Algorithms for Visibility Polygons in Simple Polygons ⋮ Visibility testing and counting

Cites Work

• Visibility and intersection problems in plane geometry
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Visibility of disjoint polygons
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The visibility diagram: A data structure for visibility problems and motion planning