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

DOI10.1016/0020-0190(91)90143-6zbMATH Open0713.68029OpenAlexW2000080814MaRDI QIDQ750155FDOQ750155

Authors: 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

Recommendations

• An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane
• A lower bound for approximating the geometric minimum weight matching
• Fast Matching Algorithms for Points on a Polygon
• A generalized hypergreedy algorithm for weighted perfect matching
• Computing Minimum-Weight Perfect Matchings

zbMATH Keywords

optimizationparallel algorithmconvex polygon

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
• Fast Matching Algorithms for Points on a Polygon
• Searching, Merging, and Sorting in Parallel Computation
• Title not available (Why is that?)

Cited In (6)

• A parallel algorithm for finding congruent regions
• A parallel algorithm for the conductor of a point set
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
• Faster bottleneck non-crossing matchings of points in convex position
• An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane
• Title not available (Why is that?)

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

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