A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects.
Md A. A. A. AmanApurba SarkarMousumi DuttArindam BiswasPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- convex hull
- simple polygon
- learning algorithm
- computational geometry
- optimal solution
- np hard
- feasible solution
- mixed integer
- recursive algorithm
- matching algorithm
- matching process
- digital objects
- dynamic programming
- semi supervised
- training samples
- active learning
- knapsack problem
- distance transform
- high resolution
- data model
- convex polyhedra