27 search results - page 6 / 6 » Skeletons in N dimensions using shape primitives |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
TVCG
2010
13 years 6 days ago
2010
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...