1387 search results - page 186 / 278 » Convexity in Discrete Space |
VALUETOOLS
2006
ACM
14 years 2 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
JCDCG
2004
Springer
14 years 2 months ago
2004
Springer
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the ...
RSP
2003
IEEE
14 years 2 months ago
2003
IEEE
Model-based testing relies on the use of behavior models to automatically generate sequences of inputs and expected outputs. These sequences can be used as test cases to the end o...
SIGGRAPH
1998
ACM
14 years 1 months ago
1998
ACM
During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generaliz...
COMPGEOM
1994
ACM
14 years 1 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...