Parallel triangulation of a polygon in two calls to the trapezoidal map

DOI10.1007/BF01762118zbMath0646.68057OpenAlexW2092472617MaRDI QIDQ1104087

Chee-Keng Yap

Publication date: 1988

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01762118

zbMATH Keywords

parallel algorithmcomputational geometrytrapezoidal map algorithmtriangulation of simple polygon

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (8)

Optimal cooperative search in fractional cascaded data structures ⋮ On the multisearching problem for hypercubes ⋮ Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems ⋮ 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 ⋮ AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS

Cites Work

• Triangulation and shape-complexity
• Triangulating Simple Polygons and Equivalent Problems
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms

This page was built for publication: Parallel triangulation of a polygon in two calls to the trapezoidal map