Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm

Keyphrases

• Matching Algorithm 100%
• Log-log 100%
• Convex Polygon 100%
• Lower Bound Techniques 100%
• New Lower Bound 100%
• All Nearest Neighbors 100%
• Parallel Algorithm 33%
• Novel Technique 33%
• Parallel Computing 33%
• Nearest Neighbor 33%
• Euclidean Distance 33%
• Parallel Complexity 33%
• Ramsey 33%

Computer Science

• Matching Algorithm 100%
• Convex Polygon 100%
• Parallel Computation 50%
• Parallel Algorithms 50%
• Euclidean Distance 50%