A greedy heuristic for Axial Line Placement in collections of convex polygons.
Leonard HaggerIan D. SandersPublished in: South Afr. Comput. J. (2006)
Keyphrases
- greedy heuristic
- minkowski sum
- convex hull
- digital convexity
- np hard
- greedy algorithm
- minimum weight
- knapsack problem
- document collections
- optimal solution
- convex optimization
- information retrieval
- globally optimal
- line segments
- worst case analysis
- digital libraries
- data sets
- piecewise linear
- convex sets
- data collections
- set cover
- line drawings
- convex relaxation
- distributed information retrieval
- worst case
- geometric objects