An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon

DOI10.1016/0020-0190(91)90143-6zbMath0713.68029OpenAlexW2000080814MaRDI QIDQ750155

Xin He

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90143-6

zbMATH Keywords

optimizationconvex polygonparallel algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Cites Work

• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
• Searching, Merging, and Sorting in Parallel Computation
• Fast Matching Algorithms for Points on a Polygon
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon