Polar, Spherical and Orthogonal Space Subdivisions for an Algorithm Acceleration: O(1) Point-in-Polygon/Polyhedron Test.
Václav SkalaPublished in: CoRR (2022)
Keyphrases
- detection algorithm
- convex hull
- search space
- k means
- learning algorithm
- dynamic programming
- cost function
- np hard
- experimental evaluation
- computational complexity
- high accuracy
- extreme points
- boundary points
- computational cost
- similarity measure
- simulated annealing
- particle swarm optimization
- segmentation algorithm
- optimization algorithm
- clustering method
- significant improvement
- neural network