Determining Weak Visibility of a Polygon from an Edge in Parallel
From MaRDI portal
Publication:4513212
DOI10.1142/S021819599800014XzbMath1035.68524MaRDI QIDQ4513212
Publication date: 7 November 2000
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Cites Work
- Characterizing and recognizing weak visibility polygons
- Visibility and intersection problems in plane geometry
- Planar separators and parallel polygon triangulation.
- 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
- Parallel algorithms for some functions of two convex polygons
- Finding the convex hull of a sorted point set in parallel
- Maintenance of configurations in the plane
- Triangulating a simple polygon in linear time
- Parallel methods for visibility and shortest-path problems in simple polygons
- Finding a closet visible vertex pair between two polygons
- Computing the visibility polygon from an edge
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
- Parallel Prefix Computation
- PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
- An Optimal Algorithm for Finding the Kernel of a Polygon
- An optimal parallel algorithm for the visibility of a simple polygon from a point
- DETERMINING THE SEPARATION OF SIMPLE POLYGONS
- Triangulating a polygon in parallel
- Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
This page was built for publication: Determining Weak Visibility of a Polygon from an Edge in Parallel
