13603 search results - page 77 / 2721 » On the Computational Complexity of Cut-Reduction |
153
click to vote
CCCG
2009
15 years 3 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
136
click to vote
SIGGRAPH
1997
ACM
15 years 10 months ago
1997
ACM
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
171
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model rep...
157
click to vote
CGI
2004
IEEE
15 years 9 months ago
2004
IEEE
In this paper, we present a versatile and robust model for geometrically complex deformable solids. Our approach can be applied to deformable tetrahedral meshes and to deformable ...
166
click to vote
CSR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...