An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles.
Bruno BeckerPaolo Giulio FranciosaStephan GschwindThomas OhlerGerald ThiemtPeter WidmayerPublished in: Workshop on Computational Geometry (1991)
Keyphrases
- packing problem
- dynamic programming
- optimal solution
- worst case
- matching algorithm
- input data
- learning algorithm
- minimum length
- initial set
- exhaustive search
- convex hull
- detection algorithm
- np hard
- computational complexity
- computational cost
- cost function
- segmentation algorithm
- optimization algorithm
- preprocessing
- decomposition algorithm
- search space
- solution space
- globally optimal
- objective function
- finite set of points
- average distance
- neural network
- similarity measure
- binary images
- k means
- probability distribution