An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane.
Bruno AdamPierre KauffmannDominique SchmittJean-Claude SpehnerPublished in: CCCG (1997)
Keyphrases
- high accuracy
- detection algorithm
- learning algorithm
- objective function
- improved algorithm
- times faster
- experimental evaluation
- dynamic programming
- worst case
- theoretical analysis
- np hard
- optimal solution
- search space
- computational complexity
- computational cost
- recognition algorithm
- optimization algorithm
- segmentation algorithm
- preprocessing
- delaunay triangulation
- video sequences
- classification algorithm
- hough transform
- clustering method
- significant improvement
- particle swarm optimization
- multi view
- input data
- simulated annealing
- data sets
- probabilistic model
- evolutionary algorithm
- k means