AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗

DOI10.1080/10637199308915435zbMath1049.68877OpenAlexW1969578207MaRDI QIDQ4819959

Jung J. Choi, Myung-Soo Kim, Chang-Sung Jeong

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199308915435

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Parallel computational geometry
• Parallel geometric algorithms on a mesh-connected computer
• Finding the smallest triangles containing a given convex polygon
• An optimal algorithm for finding minimal enclosing triangles
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Sorting on a mesh-connected parallel computer
• The ILLIAC IV Computer

This page was built for publication: AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗