A Novel Point Inclusion Test for Convex Polygons Based on Voronoi Tessellations

07/30/2020
by   Rahman Salim Zengin, et al.
0

The point inclusion tests for polygons, in other words the point-in-polygon (PIP) algorithms, are fundamental tools for many scientific fields related to computational geometry, and they have been studied for a long time. The PIP algorithms get direct or indirect geometric definition of a polygonal entity, and validate its containment of a given point. The PIP algorithms, which are working directly on the geometric entities, derive linear boundary definitions for the edges of the polygons. Moreover, almost all direct test methods rely on the two-point form of the line equation to partition the space into half-spaces. Voronoi tessellations use an alternate approach for half-space partitioning. Instead of line equation, distance comparison between generator points is used to accomplish the same task. Voronoi tessellations consist of convex polygons, which are defined between generator points. Therefore, Voronoi tessellations have become an inspiration for us to develop a new approach of the PIP testing, specialized for convex polygons. The equations, essential to the conversion of a convex polygon to a Voronoi polygon, are derived. As a reference, a very standard convex PIP testing algorithm, the sign of offset, is selected for comparison. For generalization of the comparisons, the ray crossing algorithm is used as another reference. All algorithms are implemented as vector and matrix operations without any branching. This enabled us to benefit from the CPU optimizations of the underlying linear algebra libraries. Experimentation showed that, our proposed algorithm can have comparable performance characteristics with the reference algorithms. Moreover, it has simplicity, both from a geometric representation and the mental model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2022

Point-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision

There are many space subdivision and space partitioning techniques used ...
research
01/01/2018

A Fast Algorithm for Line Clipping by Convex Polyhedron in E3

A new algorithm for line clipping against convex polyhedron is given. Th...
research
07/25/2019

A new approach (extra vertex) and generalization of Shoelace Algorithm usage in convex polygon (Point-in-Polygon)

In this paper we aim to bring new approach into usage of Shoelace Algori...
research
01/01/2018

O(lgN) Line Clipping Algorithm in E2

A new O(lg N) line clipping algorithm in E2 against a convex window is p...
research
01/03/2022

Two New Algorithms for Line Clipping in E2 and Their Comparison

Many algorithms for clipping a line by a rectangular area or a convex po...
research
07/03/2019

Towards improving Christofides algorithm for half-integer TSP

We study the traveling salesman problem (TSP) in the case when the objec...

Please sign up or login with your details

Forgot password? Click here to reset