Results 261 to 270 of about 2,055,605 (307)
On Bending in the As‐Rigid‐As‐Possible Deformation Energy
Abstract The well‐established As‐Rigid‐As‐Possible (ARAP) energy has various forms. For surface deformation, commonly used energies contain an implicit bending penalty. We present a natural, continuous generalization that incorporates multiple ARAP versions with an implicit, user‐controllable bending penalty.
Ugo Finnendahl, Marc Alexa
wiley +1 more source
Predicting students' performance on geometric problem-solving tasks: the roles of cognitive reflection, fluid intelligence, and mathematical beliefs. [PDF]
Rubio-Sánchez A +2 more
europepmc +1 more source
A new method for a priori practical identifiability. [PDF]
Thompson P +3 more
europepmc +1 more source
Integral Betti signatures of brain, climate and financial networks compared to hyperbolic, Euclidean and spherical models. [PDF]
Caputi L, Pidnebesna A, Hlinka J.
europepmc +1 more source
Developing a Gudermannian neural network for solving the Painlevé model-II in the context of nonlinear optics. [PDF]
Faisal S +4 more
europepmc +1 more source
Optimizing noise control in flexible shells with bridging membrane discs variations. [PDF]
Alahmadi H, Afzal M, Alkuhayli N.
europepmc +1 more source
Algebraic Topology via Differential Geometry
In this volume the authors seek to illustrate how methods of differential geometry find application in the study of the topology of differential manifolds. Prerequisites are few since the authors take pains to set out the theory of differential forms and the algebra required.
M. Karoubi, C. Leruste
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Differential forms in computational algebraic geometry
Proceedings of the 2007 international symposium on Symbolic and algebraic computation, 2007We give a uniform method for the two problems #CCC and #ICC of counting connected and irreducible components of complex algebraic varieties, respectively. Our algorithms are purely algebraic, i.e., they use only the field structure of C. They work efficiently in parallel and can be implemented by algebraic circuits of polynomial depth, i.e., in ...
Peter Bürgisser, Peter Scheiblechner
openaire +2 more sources

