An optimal speed-up parallel algorithm for triangulating simplicial point sets in space.
Hossam ElGindyPublished in: Int. J. Parallel Program. (1986)
Keyphrases
- parallel algorithm
- point sets
- binary search trees
- point correspondences
- point pattern matching
- parallel computation
- point set registration
- search space
- affine registration
- point cloud
- shared memory
- iterative closest point algorithm
- optimal solution
- parallel version
- pairwise
- data structure
- closed form
- convex hull
- medial axis transform
- viewpoint
- information theoretic
- feature points
- low dimensional
- dynamic programming
- distance function
- random walk
- icp algorithm
- d objects
- correspondence matching