1973 search results - page 116 / 395 » The Construction of Ludic Space |
150
click to vote
JGTOOLS
2007
15 years 6 months ago
2007
This paper presents PB-FFD, a novel, interactive, point-based technique for performing free-form deformation of polygonal meshes. First, a volumetric deformation space is de ned a...
154
click to vote
PR
2007
15 years 5 months ago
2007
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
198
click to vote
WADS
2007
Springer
16 years 13 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
164
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
192
click to vote
ISSAC
2009
Springer
16 years 27 days ago
2009
Springer
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...