330 search results - page 2 / 66 » Isosurfacing in higher dimensions |
EUROGRAPHICS
2010
Eurographics
14 years 1 months ago
2010
Eurographics
We provide a simple method that extracts an isosurface that is manifold and intersection-free from a function over an arbitrary octree. Our method samples the function dual to min...
JMLR
2012
11 years 7 months ago
2012
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
CIDU
2010
13 years 2 months ago
2010
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...