138 search results - page 9 / 28 » Efficient Expected-Case Algorithms for Planar Point Location |
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
ICCV
2003
IEEE
15 years 2 months ago
2003
IEEE
A new calibration algorithm for multi-camera systems using a planar reference pattern is proposed. The algorithm is an extension of Sturm-Maybank-Zhang style plane-based calibrati...
GD
1997
Springer
15 years 1 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
191
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
158
Voted
VLDB
2008
ACM
15 years 9 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...