123 search results - page 11 / 25 » Enumerating Triangulation Paths |
VISUALIZATION
2005
IEEE
14 years 29 days ago
2005
IEEE
The Multi Triangulation framework (MT) is a very general approach for managing adaptive resolution in triangle meshes. The key idea is arranging mesh fragments at different resolu...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
COMBINATORICS
2004
13 years 7 months ago
2004
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all th...
CDC
2009
IEEE
14 years 3 days ago
2009
IEEE
— In this paper we use bilevel programming to find the maximum difference between a reference controller and a low-complexity controller in terms of the infinitynorm difference...
EOR
2006
13 years 7 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...