Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,864,722 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Art gallery problem
Asymptotically optimal algorithm
Computational geometry
Heap (data structure)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Incremental Algorithms to Update Visibility Polygons
R. Inkulu
,
Nitish P. Thakur
International Conference on Algorithms and…
2017
Corpus ID: 6921394
We consider the problem of updating the visibility polygon of a point located within the given simple polygon as that polygon is…
Expand
2013
2013
An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon
Mikkel Abrahamsen
Canadian Conference on Computational Geometry
2013
Corpus ID: 18597626
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…
Expand
2011
2011
Weak Visibility Queries in Simple Polygons
Mojtaba Nouri Bygi
,
M. Ghodsi
Canadian Conference on Computational Geometry
2011
Corpus ID: 14958760
In this paper, we consider the problem of computing the weak visibility (WV ) of a query line segment inside a simple polygon…
Expand
2010
2010
Visibility problems for sensor networks and unmanned air vehicles
K. Obermeyer
2010
Corpus ID: 108276418
Visibility Problems for Sensor Networks and Unmanned Air Vehicles
1998
1998
Visibility Queries in Simple Polygons and Applications
B. Aronov
,
L. Guibas
,
M. Teichmann
,
Li Zhang
International Symposium on Algorithms and…
1998
Corpus ID: 9035359
In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P. We provide…
Expand
1998
1998
Robot Localization Using Polygon Distances
O. Karch
,
H. Noltemeier
,
T. Wahl
Sensor Based Intelligent Robots
1998
Corpus ID: 527793
We present an approach to the localization problem, for which polygon distances play an important role. In our setting of this…
Expand
1995
1995
The visibility complex made visibly simple: an introduction to 2D structures of visibility
F. Durand
,
C. Puech
SCG '95
1995
Corpus ID: 6776181
SpatiaJ coherence is a very important topic in image Synthesis, particularly in the popular ray-tracing algorithm and all its…
Expand
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Robert H. B. Netzer
International Workshop on Languages and Compilers…
1993
Corpus ID: 10717466
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly…
Expand
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…
Expand
1991
1991
Visibility in Simple Polygons
P. Bose
1991
Corpus ID: 119033487
We present a new method of decomposing a simple polygon which allows the preprocessing of the polygon to e ciently answer queries…
Expand
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)
ACCEPT & CONTINUE