Query point visibility computation in polygons with holes

DOI10.1016/J.COMGEO.2007.02.005MaRDI QIDQ2462733zbMATH OpenOpenAlexFDO

Authors Alireza Zarei, Mohammad Ghodsi

Publication date 3 December 2007

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2007.02.005

zbMATH Keywords

algorithmpolygon with holesvisibility decompositionvisibility polygon

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Efficient computation of query point visibility in polygons with holes
• Visibility queries in a polygonal region
• Efficient visibility queries in simple polygons
• 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 New Approach to Planar Point Location
• Algorithms for Reporting and Counting Geometric Intersections
• An Optimal Algorithm for Computing Visibility in the Plane
• Efficient visibility queries in simple polygons
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Location of a Point in a Planar Subdivision and Its Applications
• Optimal Search in Planar Subdivisions
• The Robot Localization Problem
• THE VISIBILITY COMPLEX
• Visibility and intersection problems in plane geometry
• Visibility of a simple polygon
• Visibility queries and maintenance in simple polygons

Cited in

(12)

• Polygon queries for convex hulls of points
• Visibility and ray shooting queries in polygonal domains
• An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
• Visibility and Ray Shooting Queries in Polygonal Domains
• Incremental algorithms to update visibility polygons
• Visibility testing and counting
• Weak visibility queries of line segments in simple polygons and polygonal domains
• Planar lower envelope of monotone polygonal chains
• Computing the visibility graph of points within a polygon
• Efficient computation of query point visibility in polygons with holes
• Simulation of pedestrian route choice with local view: a potential field approach
• Visibility queries in a polygonal region

This page was built for publication: Query point visibility computation in polygons with holes

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