Point-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision (original) (raw)
Related papers
On the complexity of point-in-polygon algorithms
Computers & Geosciences, 1997
A linear time algorithm for obtaining the convex hull of a simple polygon
Pattern Recognition, 1983
Polygon Queries for Convex Hulls of Points
2019
Convex Partitioning of a Polygon into Smaller Number of Pieces with Lowest Memory Consumption
A new hierarchical triangle-based point-in-polygon data structure
Computers & Geosciences, 2009
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms
Algorithmica, 2019
A new O(n·log n) algorithm for computing the intersection of convex polygons
Pattern Recognition, 1987
A Preprocessing Technique for Fast Convex Hull Computation
Procedia Computer Science
2008
Space-efficient planar convex hull algorithms
Theoretical Computer Science, 2004
In-Place Planar Convex Hull Algorithms
A unifying approach for a class of problems in the computational geometry of polygons
The Visual Computer, 1985
A linear time algorithm for computing the convex hull of an ordered crossing polygon
Pattern Recognition, 1984
An O(log log n) algorithm to compute the kernel of a polygon
Lecture Notes in Computer Science, 1994
On finding the convex hull of a simple polygon
International Journal of Computer & Information Sciences, 1983
Minimum Bounding Containers of 2D Convex Polygon
EUROPEAN ACADEMIC RESEARCH, 2014
An O(log log n) Time Algorithm to Compute the Kernel of a Polygon
Optimal detection of intersections between convex polyhedra
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
A linear time algorithm for the computation of some distance functions between convex polygons
Computing Smallest Convex Intersecting Polygons
Antonios Antoniadis, Antonis Skarlatos
arXiv (Cornell University), 2022
Memory-constrained algorithms for simple polygons
Computational Geometry, 2013
An Approach for Line Clipping against a Convex Polyhedron
Space Subdivision to Speed-up Convex Hull Construction in E 3
Optimal placement of convex polygons to maximize point containment
1998
A linear-time algorithm for computing the voronoi diagram of a convex polygon
Discrete & Computational Geometry, 1989
An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components
Sridhar Radhakrishnan, Sukhamay Kundu
Pattern Recognition, 1990
Canonical polygon queries on the plane: A new approach
Arxiv preprint arXiv: …, 2008
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete and computational geometry, 1992
Approximation algorithms for the two-center problem of convex polygon
ArXiv, 2015
A novel point inclusion test for convex polygons based on Voronoi tessellations
Applied Mathematics and Computation
Convex decompositions of simple polyhedra
1988