Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision
- Department of Computer Science and Engineering, Faculty of Applied Sciences, University of West Bohemia, Univerzitni 8, CZ 306 14 Plzen (Czech Republic)
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In the case of convex polygon in E{sup 2} a simple Point-in-Polygon test is of the O(N) complexity and the optimal algorithm is of O(log N) computational complexity. In the E{sup 3} case, the complexity is O(N) even for the convex polyhedron as no ordering is defined. New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to O(1) run-time complexity. The presented approach is simple to implement. Due to the principle of duality, dual problems, e.g. line-convex polygon, line clipping, can be solved in a similarly.
- OSTI ID:
- 22609019
- Journal Information:
- AIP Conference Proceedings, Vol. 1738, Issue 1; Conference: ICNAAM 2015: International conference of numerical analysis and applied mathematics 2015, Rhodes (Greece), 22-28 Sep 2015; Other Information: (c) 2016 Author(s); Country of input: International Atomic Energy Agency (IAEA); ISSN 0094-243X
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
Deformations of polyhedra and polygons by the unitary group