44 search results - page 5 / 9 » Fibrations of Simplicial Sets |
EUROGRAPHICS
2010
Eurographics
14 years 6 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...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
KDD
2001
ACM
14 years 10 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
SMA
2003
ACM
14 years 3 months ago
2003
ACM
We present a method to estimate the in/out function of a closed surface represented by an unorganized set of data points. From the in/out function, we compute an approximation of ...
FSTTCS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Given two simplicial complexes C1 and C2 embedded in Euclidean space IRd , C1 subdivides C2 if (i) C1 and C2 have the same underlying space, and (ii) every simplex in C1 ...