123 search results - page 12 / 25 » Enumerating Triangulation Paths |
CATA
2004
13 years 8 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
DAGSTUHL
2006
13 years 8 months ago
2006
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
DM
2008
13 years 7 months ago
2008
Catalan numbers C(n) = 1 n+1 2n n enumerate binary trees and Dyck paths. The distribution of paths with respect to their number k of factors is given by ballot numbers B(n, k) = n-...