Publication:2349738

DOI10.1016/j.comgeo.2015.02.001zbMath1318.65012arXiv1212.6039OpenAlexW1994233523MaRDI QIDQ2349738

Haitao Wang, Danny Z. Chen

Publication date: 17 June 2015

Published in: Computational Geometry, Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.6039

zbMATH Keywords

zone theoremvisibility queriesvisibility polygonsweak visibility from line segments

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Data structures (68P05)

Related Items

Near optimal line segment queries in simple polygons ⋮ Incremental Algorithms to Update Visibility Polygons ⋮ Dynamic Algorithms for Visibility Polygons in Simple Polygons ⋮ Weak visibility queries of line segments in simple polygons and polygonal domains ⋮ Computing the visibility polygon of an island in a polygonal domain ⋮ Diffuse reflection radius in a simple polygon ⋮ Continuous visible query for three-dimensional objects in spatial databases ⋮ Quickest visibility queries in polygonal domains ⋮ Weak visibility counting in simple polygons

Cites Work

• Unnamed Item
• Visibility and intersection problems in plane geometry
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• An optimal visibility graph algorithm for triangulated simple polygons
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Ray shooting in polygons using geodesic triangulations
• Visibility queries and maintenance in simple polygons
• Optimal shortest path queries in a simple polygon
• Efficient visibility queries in simple polygons
• Algorithms for Reporting and Counting Geometric Intersections
• Euclidean shortest paths in the presence of rectilinear barriers
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• An optimal algorithm for intersecting line segments in the plane
• Weak visibility queries of line segments in simple polygons and polygonal domains
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk