A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons.
Michael GaletzkaPatrick O. GlaunerPublished in: VISIGRAPP (1: GRAPP) (2017)
Keyphrases
- preprocessing
- improved algorithm
- experimental evaluation
- cost function
- minimum length
- convex hull
- times faster
- learning algorithm
- worst case
- computational complexity
- significant improvement
- dynamic programming
- computational cost
- computationally efficient
- optimization algorithm
- matching algorithm
- objective function
- lower bound
- theoretical analysis
- reinforcement learning
- expectation maximization
- real world
- computationally intensive
- image segmentation
- bayesian networks
- path planning
- high accuracy
- least squares
- optimal solution
- k means