330 search results - page 22 / 66 » Isosurfacing in higher dimensions |
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of derandomizing random walks in the Euclidean space Rk . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Lo...
GMP
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. A new topological representation of surfaces in higher dimensions, “cell-chains” is developed. The representation is a generalization of Brisson’s cell-tuple data s...
COMPGEOM
2010
ACM
14 years 22 days ago
2010
ACM
We characterize the set of all pairs (a, b) such that for every set P of n points in general position in R2 there always exists a point p ∈ P and two opposite quadrants determin...
NAACL
2007
13 years 9 months ago
2007
This paper presents an alternative algorithm based on the singular value decomposition (SVD) that creates vector representation for linguistic units with reduced dimensionality. T...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...