Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.
Prosenjit GuptaRavi JanardanMichiel H. M. SmidPublished in: Inf. Process. Lett. (1999)
Keyphrases
- pairwise
- minkowski sum
- convex hull
- digital convexity
- point sets
- multi class
- pairwise interactions
- semi supervised
- similarity measure
- business intelligence
- loss function
- convex polyhedra
- data analysis
- piecewise linear
- convex optimization
- convex programming
- markov random field
- spatial objects
- traffic flow
- similarity function
- pairwise classification
- objective function
- cell complexes
- neural network
- constrained minimization
- minimum length
- convex functions
- risk minimization
- convex relaxation
- pairwise constraints
- potential functions
- spectral clustering
- data points
- support vector machine
- high order
- higher order