Triangulating a polygon in parallel

DOI10.1016/0196-6774(89)90032-1MaRDI QIDQ4732108zbMATH OpenOpenAlexFDO

Authors Michael T. Goodrich

Publication date 1989

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1589&context=cstech

zbMATH Keywords

CREW PRAM computational modelparallel algorithmpolygon triangulation

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4074480
• Rectangulating rectilinear polygons in parallel
• Rectangulating rectilinear polygons in parallel
• Parallel triangulation of a polygon in two calls to the trapezoidal map
• Parallel Delaunay triangulation in three dimensions
• Orthogonal triangulation of polygons
• On triangulating three-dimensional polygons
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
• Triangulating Simple Polygons and Equivalent Problems
• Triangulating a simple polygon in linear time

Cited in

(24)

• Parallel triangulation of a polygon in two calls to the trapezoidal map
• Optimal parallel algorithms for point-set and polygon problems
• Finding congruent regions in parallel
• Parallel methods for visibility and shortest-path problems in simple polygons
• Rectangulating rectilinear polygons in parallel
• Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons
• A parallel algorithm for computing polygon set operations
• Finding a closet visible vertex pair between two polygons
• Optimal cooperative search in fractional cascaded data structures
• Intelligent computing systems with actors -- parallel dynamic programming algorithm of the polygon triangulation problem
• scientific article; zbMATH DE number 4074480 (Why is no real title available?)
• A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
• scientific article; zbMATH DE number 1206101 (Why is no real title available?)
• scientific article; zbMATH DE number 512921 (Why is no real title available?)
• Quadrilaterizing an Orthogonal Polygon in Parallel
• Determining Weak Visibility of a Polygon from an Edge in Parallel
• scientific article; zbMATH DE number 219273 (Why is no real title available?)
• Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
• Parallel algorithms for all minimum link paths and link center problems
• Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
• Guarding a Polygon Without Losing Touch
• Rectangulating rectilinear polygons in parallel
• Testing a simple polygon for monotonicity optimally in parallel
• Planar separators and parallel polygon triangulation.

This page was built for publication: Triangulating a polygon in parallel

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