102291 search results - page 259 / 20459 » Computability in Computational Geometry |
158
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
158
click to vote
GRAPHITE
2004
ACM
16 years 1 days ago
2004
ACM
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
248
click to vote
GIAE
2004
Springer
15 years 12 months ago
2004
Springer
This paper surveys the new, algorithmic theory of moving frames developed by the author and M. Fels. Applications in geometry, computer vision, classical invariant theory, the cal...
187
click to vote
DGCI
2003
Springer
15 years 11 months ago
2003
Springer
We use a mathematical morphology approach to compute the surface and curve skeletons of a 3D object. We focus on the behaviour of the surface skeleton, in particular the reversibil...
180
click to vote
AISC
2004
Springer
15 years 10 months ago
2004
Springer
We present a new method for generic quantifier elimination that uses an extension of Hermitian quantifier elimination. By means of sample computations we show that this generic Her...