138 search results - page 19 / 28 » Efficient Expected-Case Algorithms for Planar Point Location |
COMPGEOM
1994
ACM
14 years 9 hour ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, t...
IJCV
2008
13 years 8 months ago
2008
The recent development of Sequential Monte Carlo methods (also called particle filters) has enabled the definition of efficient algorithms for tracking applications in image sequen...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
The photorealistic modeling of large-scale objects, such as urban scenes, requires the combination of range sensing technology and digital photography. In this paper, we attack th...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
We identify and formalize a novel join operator for two spatial pointsets P and Q. The common influence join (CIJ) returns the pairs of points (p, q), p P, q Q, such that there e...