Parallel methods for visibility and shortest-path problems in simple polygons
From MaRDI portal
Publication:1201749
DOI10.1007/BF01758856zbMath0788.68143OpenAlexW2047596954MaRDI QIDQ1201749
Steven B. Shauck, Michael T. Goodrich, Sumantha Guha
Publication date: 17 January 1993
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01758856
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Related Items (4)
An addendum to parallel methods for visibility and shortest-path problems in simple polygons ⋮ Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers ⋮ Minimizing Distance-to-Sight in Polygonal Domains ⋮ Determining Weak Visibility of a Polygon from an Edge in Parallel
Cites Work
- Visibility and intersection problems in plane geometry
- Fractional cascading. I: A data structuring technique
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Parallel triangulation of a polygon in two calls to the trapezoidal map
- Parallel algorithms for shortest path problems in polygons
- An optimal visibility graph algorithm for triangulated simple polygons
- Parallel computational geometry
- Maintenance of configurations in the plane
- Stabbing line segments
- Computing external farthest neighbors for a simple polygon
- Triangulating a simple polygon in linear time
- Line-segment intersection reporting in parallel
- Triangulating a simple polygon
- Finding the intersection of two convex polyhedra
- Computing geodesic furthest neighbors in simple polygons
- Optimal shortest path queries in a simple polygon
- A data structure for dynamic trees
- Euclidean shortest paths in the presence of rectilinear barriers
- An Efficient Parallel Biconnectivity Algorithm
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Parallel Prefix Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- A linear algorithm for computing the visibility polygon from a point
- A simple parallel tree contraction algorithm
- Triangulating a polygon in parallel
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Parallel methods for visibility and shortest-path problems in simple polygons
