A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the plane.
Bruno AdamPierre KauffmannDominique SchmittJean-Claude SpehnerPublished in: CCCG (1998)
Keyphrases
- improved algorithm
- dynamic programming
- computational cost
- detection algorithm
- high accuracy
- cost function
- significant improvement
- computational complexity
- segmentation algorithm
- np hard
- search space
- optimization algorithm
- worst case
- probabilistic model
- neural network
- experimental evaluation
- preprocessing
- particle swarm optimization
- lower bound
- k means
- optimal solution
- tree structure
- classification algorithm
- convex hull
- recognition algorithm
- learning algorithm