123 search results - page 5 / 25 » Enumerating Triangulation Paths |
DM
2008
13 years 7 months ago
2008
One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
3DIM
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents a simple and efficient method of forming a 3D text label on a 3D triangulated surface. The label is formed by projecting the 2D contours that define the text...
EJC
2011
13 years 2 months ago
2011
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
ISAAC
2000
Springer
13 years 11 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...