Visibility of disjoint polygons
From MaRDI portal
Publication:1087340
DOI10.1007/BF01840436zbMATH Open0611.68062MaRDI QIDQ1087340FDOQ1087340
Authors: T. Asano, Tetsuo Asano, Hideki Imai, Leonidas Guibas, John Hershberger 
Publication date: 1986
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
- Visibility of a simple polygon
- scientific article; zbMATH DE number 4078149
- scientific article; zbMATH DE number 434872
- Visibility between two edges of a simple polygon
- Visibility queries in a polygonal region
- Visual distinguishability of polygons
- scientific article; zbMATH DE number 16594
- Visibility queries and maintenance in simple polygons
- Computing the visibility graph of points within a polygon
computational geometrydata structureshortest pathcomputer graphicsroboticsvisibility polygonvisibility graphhidden-line elimination
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Cites Work
- A linear-time algorithm for a special case of disjoint set union
- The power of geometric duality
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Euclidean shortest paths in the presence of rectilinear barriers
- Triangulating a simple polygon
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- A linear algorithm for computing the visibility polygon from a point
- Visibility of a simple polygon
Cited In (53)
- Routing among convex polygonal obstacles in the plane
- Shortest path between two simple polygons
- Efficient visibility queries in simple polygons
- Routing among convex polygonal obstacles in the plane
- Routing in polygonal domains
- Routing in polygonal domains
- Planning a time-minimal motion among moving obstacles
- A tight lower bound on the size of visibility graphs
- Upper envelope onion peeling
- The visibility diagram: A data structure for visibility problems and motion planning
- Visibility graphs and obstacle-avoiding shortest paths
- A fast algorithm for computing sparse visibility graphs
- An algorithmic approach to some problems in terrain navigation
- Shortest paths among transient obstacles
- Generalized Delaunay triangulation for planar graphs
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
- Approximation algorithms for art gallery problems in polygons
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon
- Visibility and ray shooting queries in polygonal domains
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Graph Drawing
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- A new algorithm for shortest paths among obstacles in the plane
- A Computational Geometric Approach to Visual Hulls
- On maximum flows in polyhedral domains
- Line segment visibility with sidedness constraints
- Topologically sweeping visibility complexes via pseudotriangulations
- A linear time algorithm to remove winding of a simple polygon
- Finding the upper envelope of n line segments in O(n log n) time
- Shortest paths in the plane with obstacle violations
- On graphs preserving rectilinear shortest paths in the presence of obstacles
- Upper envelope onion peeling
- Space–Query-Time Tradeoff for Computing the Visibility Polygon
- An exact geometry-based algorithm for path planning
- Rectilinear paths among rectilinear obstacles
- Minimal tangent visibility graphs
- On rainbow quadrilaterals in colored point sets
- Shortest path solves edge-to-edge visibility in a polygon
- Shortest paths in the plane with obstacle violations
- Hidden surface removal for \(c\)-oriented polyhedra
- Computing the full visibility graph of a set of line segments
- An optimal visibility graph algorithm for triangulated simple polygons
- Incremental algorithms to update visibility polygons
- Computing the visibility polygon of an island in a polygonal domain
- On multiple moving objects
- Using Gale transforms in computational geometry
- The complexity of planar compliant motion planning under uncertainty
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- Dynamic algorithms for visibility polygons in simple polygons
- An efficient algorithm for one-step planar compliant motion planning with uncertainty
- Rectilinear shortest paths in the presence of rectangular barriers
- Perfect binary space partitions
- Computing the visibility polygon of an island in a polygonal domain
This page was built for publication: Visibility of disjoint polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087340)
