496 search results - page 99 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
IPMI
2003
Springer
14 years 8 months ago
2003
Springer
Abstract. For medical image analysis issues where the domain mappings between images involve large geometrical shape changes, such as the cases of nonrigid motion recovery and inte...
WSCG
2004
13 years 9 months ago
2004
Several sophisticated methods are available for efficient rendering of out-of-core terrain data sets. For huge data sets the use of preprocessed tiles has proven to be more effici...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...
GIS
2003
ACM
14 years 24 days 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...