New Serial and Parallel Algorithms for Finding Convex Hull Based on Clusters, Domains and Directions from Single to Multitude
An Isomorphic Fundamental Theorem of the Convex Hull Construction is given and proved. A representative serial algorithm convex hull with half-dividing and recurrence is commented as compared example. A more efficient new serial algorithm to find a convex hull based on a dynamical maximum base line...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2009-06-01
|
| Series: | Journal of Algorithms & Computational Technology |
| Online Access: | https://doi.org/10.1260/174830109787913985 |