Title of article :
On Point-inclusion Test in Convex Polygons and Polyhedrons
Author/Authors :
Imanparast, Mahdi Department of Computer Science - University of Bojnord, Bojnord , Kazemi Torbaghan, Mehdi Department of Mathematics - University of Bojnord, Bojnord
Abstract :
A new algorithm for point-inclusion test in convex poly-
gons is introduced. The proposed algorithm answers the
point-inclusion test in convex polygons in O(log n) time
without any preprocessing and with O(n) space. The
proposed algorithm is extended to do the point-inclusion
test in convex polyhedrons in three dimensional space.
This algorithm can solve the point-inclusion test in con-
vex 3D polyhedrons in O(log n) time with O(n) prepro-
cessing time and O(n) space.
Keywords :
Point-in-polygon , Point-inclusion test , Convex polygons , Convex polyhedrons , Preprocessing time
Journal title :
Journal of Algorithms and Computation
