scholarly journals APPROACH FOR 2D POINT LOCATION PROBLEM ON A REGULAR GRID

2021 ◽  
Vol 21 ◽  
pp. 106-113
Author(s):  
A Dashkevych ◽  
◽  
2016 ◽  
Vol 46 (6) ◽  
pp. 1438-1451 ◽  
Author(s):  
Wen Jiang ◽  
De-Shuang Huang ◽  
Shenghong Li

2005 ◽  
Vol 38 (1) ◽  
pp. 117-122 ◽  
Author(s):  
C.N. Jones ◽  
P. Grieder ◽  
S.V. Raković

Author(s):  
Trevor S. Hale ◽  
Michael E. Hanna ◽  
Faizul Huq

2007 ◽  
Vol 179 (3) ◽  
pp. 978-989 ◽  
Author(s):  
Oded Berman ◽  
Zvi Drezner ◽  
George O. Wesolowsky

1994 ◽  
Vol 04 (04) ◽  
pp. 369-383
Author(s):  
PANKAJ K. AGARWAL ◽  
MARC VAN KREVELD

Let [Formula: see text] be a set of n (possibly intersecting) line segments in the plane. We show that the arrangement of [Formula: see text] can be stored implicitly in a data structure of size O(n log 2n) so that the following query can be answered in time O(n1/2 log 2 n): Given two query points, determine whether they lie in the same face of the arrangement of S and, if so, return a path between them that lies within the face. This version of the implicit point location problem is motivated by the following motion planning problem: Given a polygonal robot R with m vertices and a planar region bounded by polygonal obstacles with n vertices in total, preprocess them into a data structure so that, given initial and final positions of R, one can quickly determine whether there exists a continuous collision-free translational motion of R from the initial to the final position. We show that such a query can be answered in time O((mn)1/2 log 2 mn) using O(mn log 2 mn) storage.


Sensors ◽  
2019 ◽  
Vol 19 (5) ◽  
pp. 1020 ◽  
Author(s):  
Aleksandro Montanha ◽  
Airton M. Polidorio ◽  
F. J. Dominguez-Mayo ◽  
María J. Escalona

The 2D point location problem has applications in several areas, such as geographic information systems, navigation systems, motion planning, mapping, military strategy, location and tracking moves. We aim to present a new approach that expands upon current techniques and methods to locate the 2D position of a signal source sent by an emitter device. This new approach is based only on the geometric relationship between an emitter device and a system composed of m≥2 signal receiving devices. Current approaches applied to locate an emitter can be deterministic, statistical or machine-learning methods. We propose to perform this triangulation by geometric models that exploit elements of pole-polar geometry. For this purpose, we are presenting five geometric models to solve the point location problem: (1) based on centroid of points of pole-polar geometry, PPC; (2) based on convex hull region among pole-points, CHC; (3) based on centroid of points obtained by polar-lines intersections, PLI; (4) based on centroid of points obtained by tangent lines intersections, TLI; (5) based on centroid of points obtained by tangent lines intersections with minimal angles, MAI. The first one has computational cost On and whereas has the computational cost Onlognwhere n is the number of points of interest.


2020 ◽  
Vol 24 (21) ◽  
pp. 16021-16042 ◽  
Author(s):  
Saeed Dehnavi-Arani ◽  
Ahmad Sadegheih ◽  
Yahia Zare Mehrjerdi ◽  
Mahboobeh Honarvar

Author(s):  
José Poveda ◽  
Michael Gould

In this chapter we present some well-known algorithms for the solution of the point location problem and for the more particular problem of point-in-polygon determination. These previous approaches to the problem are presented in the first sections. In the remainder of the paper, we present a quick location algorithm based on a quaternary partition of the space, as well as its associated computational cost.


Sign in / Sign up

Export Citation Format

Share Document