Determining Weak Visibility of a Polygon from an Edge in Parallel

DOI10.1142/S021819599800014XMaRDI QIDQ4513212zbMATH OpenFDO

Authors Danny Z. Chen

Publication date 7 November 2000

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S021819599800014X

zbMATH Keywords

computational geometryCREW PRAM

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Parallel algorithms in computer science (68W10)

Recommendations

• AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
• An optimal parallel algorithm for the visibility of a simple polygon from a point
• Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
• scientific article; zbMATH DE number 4043246
• scientific article; zbMATH DE number 4050998

Cites work

• A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
• An Optimal Algorithm for Finding the Kernel of a Polygon
• An optimal parallel algorithm for the visibility of a simple polygon from a point
• Characterizing and recognizing weak visibility polygons
• Computing the visibility polygon from an edge
• DETERMINING THE SEPARATION OF SIMPLE POLYGONS
• Finding a closet visible vertex pair between two polygons
• Finding the convex hull of a sorted point set in parallel
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Maintenance of configurations in the plane
• Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
• PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
• Parallel Prefix Computation
• Parallel algorithms for shortest path problems in polygons
• Parallel algorithms for some functions of two convex polygons
• Parallel methods for visibility and shortest-path problems in simple polygons
• Parallel triangulation of a polygon in two calls to the trapezoidal map
• Planar separators and parallel polygon triangulation.
• Triangulating a polygon in parallel
• Triangulating a simple polygon in linear time
• Visibility and intersection problems in plane geometry

Cited in

(9)

• Parallel algorithm for segment visibility reporting
• scientific article; zbMATH DE number 4043246 (Why is no real title available?)
• Parallel methods for visibility and shortest-path problems in simple polygons
• PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
• AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
• Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
• An optimal parallel algorithm for the visibility of a simple polygon from a point
• Computing the visibility polygon from an edge
• scientific article; zbMATH DE number 4050998 (Why is no real title available?)

This page was built for publication: Determining Weak Visibility of a Polygon from an Edge in Parallel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513212)