Computing the visibility polygon of an island in a polygonal domain

DOI10.1007/S00453-015-0058-YMaRDI QIDQ513290zbMATH OpenOpenAlexFDO

Authors Danny Z. Chen, Haitao Wang

Publication date 6 March 2017

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-015-0058-y

zbMATH Keywords

algorithmscomputational geometrypolygon with holesvisibility polygonspolygonal domains

Mathematics Subject Classification ID

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

Recommendations

• Computing the visibility polygon of an island in a polygonal domain
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Visibility and ray shooting queries in polygonal domains
• Visibility and Ray Shooting Queries in Polygonal Domains

Cites work

• A linear algorithm for computing the visibility polygon from a point
• A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane
• An Optimal Algorithm for Computing Visibility in the Plane
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• An optimal parallel algorithm for the visibility of a simple polygon from a point
• Computing the visibility polygon from a convex set and related problems
• Computing the visibility polygon from an edge
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Corrections to Lee's visibility polygon algorithm
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• On the correctness of a linear-time visibility polygon algorithm^∗
• Planar rectilinear shortest path computation using corridors
• Shortest paths in the plane with convex polygonal obstacles
• Triangulating a simple polygon in linear time
• Visibility and intersection problems in plane geometry
• Visibility and ray shooting queries in polygonal domains
• Visibility of a simple polygon
• Visibility of disjoint polygons
• Visibility-based planning of sensor control strategies

Cited in

(7)

• Computing the visibility polygon of an island in a polygonal domain
• Visibility and ray shooting queries in polygonal domains
• Quickest visibility queries in polygonal domains
• An Optimal Algorithm for Computing Visibility in the Plane
• Minimizing Distance-to-Sight in Polygonal Domains
• Reachable region query and its applications
• scientific article; zbMATH DE number 177568 (Why is no real title available?)

This page was built for publication: Computing the visibility polygon of an island in a polygonal domain

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