DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Visibility polygon
Visibility polygon
A Visibility-Based Approach to Computing Non-Deterministic
On Visibility Problems in the Plane – Solving Minimum Vertex Guard Problems by Successive Approximations ?
Efficient Computation of Visibility Polygons
Parallel Geometric Algorithms. Fenglien Lee Louisiana State University and Agricultural & Mechanical College
A Time-Space Trade-Off for Computing the K-Visibility Region of a Point In
Optimizing Terrestrial Laser Scanning Measurement Set-Up
Visibility Polygon Traversal Algorithm
30 POLYGONS Joseph O’Rourke, Subhash Suri, and Csaba D
Robot Online Algorithms in Computational Geometry: Searching and Exploration in the Plane
Online Algorithms with Discrete Visibility
Generating Kernel Aware Polygons
Computational Problems in Strong Visibility
Faculty of Science Solving the Art Gallery Problem in Iterations
Uncertainty Models in Computational Geometry
The Visibility Graph Among Polygonal Obstacles: a Comparison of Algorithms ABSTRACT
Isovist Analyst--An Arcview Extension for Planning Visual Surveillance
Applications of Visibility Space in Polygon Search Problems
The Quest for Optimal Solutions for the Art Gallery Problem: a Practical Iterative Algorithm?
Top View
A New Optimal Algorithm for Computing the Visibility Area of a Simple Polygon from a Viewpoint
Computation and Complexity of Visibility in Geometric Environments
A Software of Visiblitlity Graph with Multiple Reflection and Its Application of Wireless Communication Design
Searching for the Kernel of a Polygon: a Competitive Strategy Using Self-Approaching Curves∗
Approximation Algorithm for Art Gallery Problems
Arxiv:2107.05540V2 [Cs.CG] 19 Aug 2021
Visibility-Based Robot Path Planning
Art Gallery Theorems and Algorithms the International Series of Monographs on Computer Science
PLANAR STRONG VISIBILITY 1. Introduction the Study Of
Computing the K-Crossing Visibility Region of a Point in a Polygon
Visibility-Based Persistent Monitoring with Robot Teams
Optimizing Range Finder Sensor Network Coverage in Indoor Environment
Triangulating and Guarding Realistic Polygons
Characterizing and Recognizing Weak Visibility Polygons
Triangulating and Guarding Realistic Polygons
Simple Robots with Minimal Sensing: from Local Visibility to Global Geometry Subhash Suri∗ Elias Vicari† and Peter Widmayer†
Guarding a Polygon Without Losing Touch
On the Chromatic Art Gallery Problem
Special Guards in Chromatic Art Gallery ∗
Computing a Visibility Polygon Using Few Variables∗
Visibility Domains and Complexity
33 VISIBILITY Joseph O’Rourke
Smoothing the Gap Between NP and R ∃ Jeff Erickson, University of Illinois,
[email protected]