676 search results - page 129 / 136 » A Search-Free Intersection Algorithm |
109
Voted
GIS
2003
ACM
15 years 5 months ago
2003
ACM
Accurate postal code maps have many applications within GIS as the postal code has the potential to link the address description of buildings to their location in a specified glob...
102
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
102
click to vote
SODA
2007
ACM
15 years 1 months ago
2007
ACM
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
107
click to vote
SODA
1997
ACM
15 years 1 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
111
click to vote
SODA
1992
ACM
15 years 27 days ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...