Efficient computation of the convex hull on sets of points stored in a k-tree compact data structure.
Juan Felipe CastroMiguel RomeroGilberto GutiérrezMónica CaniupánCarlos Quijada-FuentesPublished in: Knowl. Inf. Syst. (2020)
Keyphrases
- convex hull
- efficient computation
- convex sets
- point sets
- finite set of points
- computational efficiency
- simple polygon
- totally unimodular
- compact data structure
- convex polyhedra
- extreme points
- computational geometry
- minimum distance
- mixed integer
- convex concave
- database
- tree structure
- training samples
- data points
- integer points
- point pairs
- index structure
- computationally efficient
- computational complexity
- feature selection