The Visibility Graph Among Polygonal Obstacles: a Comparison of Algorithms
نویسنده
چکیده
This paper examines differences of four approaches in finding the visibility graph of a polygonal region with obstacles defined by simple polygons. Each has been implemented and tuned. Experimental comparisons via time measurements have been carried out against a variety of testcases ranging in graph density from maximal, O(† n 2), to minimal, † W(n). In this manner, expected asymptotic time bounds have been verified with crossover points between the algorithms identified.
منابع مشابه
Geometric Spanners for Points Inside a Polygonal Domain
Let P be a set of n points inside a polygonal domain D. A polygonal domain with h holes (or obstacles) consists of h disjoint polygonal obstacles surrounded by a simple polygon which itself acts as an obstacle. We first study t-spanners for the set P with respect to the geodesic distance function π where for any two points p and q, π(p, q) is equal to the Euclidean length of the shortest path f...
متن کاملThe visibility graph contains a bounded-degree spanner
Given a collection of polygonal obstacles with n vertices on the place, and any t > 1, we present an O(n logn) time algorithm that constructs a bounded-degree t-spanner of the visibility graph, without rst having to construct the visibility graph.
متن کاملRobot Navigation in Unknown Terrains of Convex Polygonal Obstacles Using Learned Visibility Graphs
The problem of navigating an autonomous mobile robot through an unexplored terrain of obstacles is the focus of this paper. The case when the obstacles are ‘known’ has been extensively studied in literature. The process of robot navigation in completely unexplored terrains involves both learning the information about the obstacle terrain and path planning. We present an algorithm to navigate a ...
متن کاملAn E cient Algorithm for Euclidean Shortest Path with Polygonal Obstacles
In this paper we present an e cient solution to nding the Euclidean Shortest Path from one point to the other in the presence of polygonal obstacles. An O(m 2 logn+T ) algorithm is developed where m is the number of obstacles and n, the number of vertices and T is the time for triangulation. The algorithm works by nding a restricted visibility graph in the obstacle space and is simple. It achie...
متن کاملImproving the Construction of the Visibility–Voronoi Diagram
Ron Wein et al. [4] introduced the Visibility-Voronoi diagram for clearance c, denoted by V V , which is a hybrid between the visibility graph and the Voronoi diagram of polygons in the plane. It evolves from the visibility graph to the Voronoi diagram as the parameter c grows from 0 to ∞. This diagram can be used for planning natural-looking paths for a robot translating amidst polygonal obsta...
متن کامل