Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.
Prosenjit GuptaRavi JanardanMichiel H. M. SmidPublished in: CCCG (1996)
Keyphrases
- pairwise
- minkowski sum
- convex hull
- digital convexity
- loss function
- higher order
- data analysis
- markov random field
- point sets
- similarity measure
- pairwise interactions
- cell complexes
- semi supervised
- multi class
- risk minimization
- high order
- convex polyhedra
- pairwise comparison
- piecewise linear
- convex optimization
- convex relaxation
- constrained minimization
- business intelligence
- simple polygon
- graph matching
- case study
- pairwise constraints
- traffic light
- convex programming
- globally optimal
- convex constraints
- pairwise classification
- belief propagation