44 search results - page 7 / 9 » Fibrations of Simplicial Sets |
WG
2009
Springer
14 years 2 months ago
2009
Springer
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
DCG
2008
13 years 7 months ago
2008
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that t...
COMPGEOM
2010
ACM
14 years 15 days ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
ISBI
2011
IEEE
12 years 11 months ago
2011
IEEE
For medical image analysis, the test statistic of the measurements is usually constructed at every voxels in space and thresholded to determine the regions of significant signals...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider the problem of computing a triangulation of the real projective plane P2 , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of...