Point-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision.
Václav SkalaPublished in: CoRR (2022)
Keyphrases
- convex hull
- computational complexity
- computational cost
- extreme points
- learning algorithm
- strictly convex
- data structure
- high computational complexity
- multiresolution
- worst case
- space requirements
- lower complexity
- boundary points
- computational geometry
- complexity analysis
- convex optimization
- control points
- convex functions
- computationally efficient
- finite dimensional
- optimization problems
- space complexity
- infinite dimensional
- low dimensional
- vector space
- theoretical analysis