Trading Time for Space: An O(1) Average Time Algorithm for Point-in-Polygon Location Problem Theoretical Fiction or Practical Usage (original) (raw)
Related papers
On the complexity of point-in-polygon algorithms
Computers & Geosciences, 1997
Time-Space Trade-offs for Triangulating a Simple Polygon
Andreas Van Ressen, Simon Pratt
2016
Point in polygon calculation using vector geometric methods with application to geospatial data
arXiv (Cornell University), 2023
The Point in Polygon Problem for Arbitrary Polygons
A unifying approach for a class of problems in the computational geometry of polygons
The Visual Computer, 1985
How Reliable Are Practical Point-in-Polygon Strategies?
Algorithms - ESA 2008
Spotting, Tracking algorithm and the remoteness: The-Point-in-Polygon-Problem (P.I.P
2024
An O(nloglogn)O(n\log \log n)O(nloglogn)-Time Algorithm for Triangulating a Simple Polygon
SIAM Journal on Computing, 1988
Polygon triangulation inO(n log logn) time with simple data structures
Discrete & Computational Geometry, 1992
An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem
2002
2008
Memory-constrained algorithms for simple polygons
Computational Geometry, 2013
A Point in Non-Convex Polygon Location Problem Using the Polar Space Subdivision in E 2
A new hierarchical triangle-based point-in-polygon data structure
Computers & Geosciences, 2009
An O(log log n) algorithm to compute the kernel of a polygon
Lecture Notes in Computer Science, 1994
An Algorithm to Find the Visible Region of a Polygon
An O(log log n) Time Algorithm to Compute the Kernel of a Polygon
Space–query-time tradeoff for computing the visibility polygon
2009
A linear time algorithm for the computation of some distance functions between convex polygons
A New Quick Point Location Algorithm
Lecture Notes in Computer Science, 2004
A new O(n·log n) algorithm for computing the intersection of convex polygons
Pattern Recognition, 1987
Optimal polygon placement by translation 1
International Journal of Computer Mathematics, 1994
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
Discrete & Computational Geometry, 2001
Efficient computation of query point visibility in polygons with holes
2005
An efficient strategy for rapidly finding an object in a polygonal world
2003
A linear time algorithm for obtaining the convex hull of a simple polygon
Pattern Recognition, 1983
AnO(n logn) algorithm for computing the link center of a simple polygon
Discrete & Computational Geometry, 1992
A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint
arXiv (Cornell University), 2018
Optimal polygon placement by translation
International Journal of Computer Mathematics, 1994
Point in Polygon Analysis for Moving Objects
2005
Optimal placement of convex polygons to maximize point containment
1998
A point-in-polygon method based on a quasi-closest point
Computers Geosciences, 2010
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms
Algorithmica, 2019