A divide and conquer algorithm for medial surface calculation of planar polyhedra.
Ian StroudGábor RennerPaul C. XirouchakisPublished in: Comput. Aided Des. (2007)
Keyphrases
- learning algorithm
- k means
- np hard
- computational cost
- search space
- dynamic programming
- detection algorithm
- computational complexity
- simulated annealing
- matching algorithm
- optimization algorithm
- segmentation algorithm
- shape model
- cost function
- special case
- preprocessing
- optimal solution
- objective function
- surface reconstruction
- expectation maximization
- multiscale