Point location

Known as: Point location problem 
The point location problem is a fundamental topic of computational geometry. It finds applications in areas that deal with processing geometrical… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2018
0204019682018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Point location is the problem of preprocessing a planar polygonal subdivision S of size n into a data structure in order to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
We develop the first linear-space data structures for dynamic planar point location in general subdivisions that achieve… (More)
  • table 1
  • table 3
  • figure 1
  • figure 2
Is this relevant?
2003
2003
A new data structure is presented for planar point location that executes a point location query quickly if it is spatially near… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper presents a novel approach for detecting affine invariant interest points. Our method can deal with significant affine… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Given a fixed distribution of point location queries among the regions of a triangulation of the plane, a data structure is… (More)
Is this relevant?
1998
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1992
1992
The <italic>dynamic planar point location problem</italic> is the task of maintaining a dynamic set <italic>S</italic> of <italic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The paper considers two classes of point location problems found in visual navigation of a mobile robot. The problems we consider… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 8
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Given a subdivision of the plane induced by a planar graph with n vertices, in this paper we consider the problem of identifying… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?