Skip to search formSkip to main contentSkip to account menu

Visibility polygon

In computational geometry, the visibility polygon or visibility region for a point p in the plane among obstacles is the possibly unbounded polygonal… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Art gallery problemAsymptotically optimal algorithmComputational geometryHeap (data structure)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Incremental Algorithms to Update Visibility Polygons
We consider the problem of updating the visibility polygon of a point located within the given simple polygon as that polygon is… 
2013
2013
An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon
LetP be a simple polygon with n vertices. We present a new O(n)-time algorithm to compute the visible part of one edge from… 
2013
2013
Triangulation-based path planning for patrolling by a mobile robot
This paper addresses a systematic coverage planning with a circular sensor mobile robot, having kinematic and dynamic constraints… 
2011
2011
Weak Visibility Queries in Simple Polygons
In this paper, we consider the problem of computing the weak visibility (WV ) of a query line segment inside a simple polygon… 
2010
2010
Visibility problems for sensor networks and unmanned air vehicles
Visibility Problems for Sensor Networks and Unmanned Air Vehicles 
1997
1997
Robot localization - theory and practice
We consider the first stage of the robot localization problem described as follows: a robot is at an unknown position in an… 
1995
1995
The visibility complex made visibly simple: an introduction to 2D structures of visibility
SpatiaJ coherence is a very important topic in image Synthesis, particularly in the popular ray-tracing algorithm and all its… 
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly… 
1993
1993
Computing stair-case visibility polygon
  • L. Gewali
  • Other Conferences
  • 1993
  • Corpus ID: 122313050
Given a point q in the presence of polygonal obstacles, the set of points visible from q is the visibility polygon from q. We… 
1991
1991
Visibility in Simple Polygons
We present a new method of decomposing a simple polygon which allows the preprocessing of the polygon to e ciently answer queries… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)