Triangulating a polygon in parallel

DOI10.1016/0196-6774(89)90032-1zbMath0682.68047OpenAlexW2115636961MaRDI QIDQ4732108

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

parallel algorithmpolygon triangulationCREW PRAM computational model

Mathematics Subject Classification ID

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

Related Items

Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons ⋮ 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 ⋮ Finding a closet visible vertex pair between two polygons ⋮ Optimal cooperative search in fractional cascaded data structures ⋮ Guarding a Polygon Without Losing Touch ⋮ Optimal parallel algorithms for point-set and polygon problems ⋮ Testing a simple polygon for monotonicity optimally in parallel ⋮ Parallel methods for visibility and shortest-path problems in simple polygons ⋮ Determining Weak Visibility of a Polygon from an Edge in Parallel

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