Join Our Newsletter

ICDT

2011

ACM

10 years 5 months ago
2011

ACM

Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...

COMGEO

2008

ACM

11 years 1 months ago
2008

ACM

Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...

SODA

1993

ACM

11 years 2 months ago
1993

ACM

Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...

SODA

1997

ACM

11 years 2 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...

SODA

2001

ACM

11 years 2 months ago
2001

ACM

Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...

DEXA

2006

Springer

11 years 5 months ago
2006

Springer

Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solu...

FAW

2009

Springer

11 years 5 months ago
2009

Springer

Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...

FOCS

2000

IEEE

11 years 5 months ago
2000

IEEE

We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...

SSD

2001

Springer

11 years 5 months ago
2001

Springer

Abstract. This paper addresses the problem of ﬁnding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...

SMA

2006

ACM

11 years 7 months ago
2006

ACM

We present an efﬁcient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...