153 search results - page 30 / 31 » Near-linear approximation algorithms for geometric hitting s... |
ESA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
ALGORITHMICA
2011
13 years 24 days ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
ACIVS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present an algorithm for interpolating the visible portions of a point cloud that are sampled from opaque objects in the environment. Our algorithm projects point clou...
COMPGEOM
2007
ACM
13 years 9 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 ...
CGF
2006
13 years 5 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...