Results 151 to 160 of about 1,025,219 (193)
Some of the next articles are maybe not open access.
Geometric constraint solving with geometric transformation
Science in China Series F Information Sciences, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiao-Shan Gao, Lei-Dong Huang, Kun Jiang
openaire +3 more sources
Geometric Mappings on Geometric Lattices
Canadian Journal of Mathematics, 1971It is a classical result of mathematics that there is an intimate connection between linear algebra and projective or affine geometry. Thus, many algebraic results can be given a geometric interpretation, and geometric theorems can quite often be proved more easily by algebraic methods.
openaire +1 more source
ACM Transactions on Graphics, 1995
This article presents a functional programming approach to geometric design with embedded polyhedral complexes. Its main goals are to show the expressive power of the language as well as its usefulness for geometric design. The language, named PLASM (the Programming LAnguage for Solid Modeling), introduces a very high level approach to “constructive ...
Alberto Paoluzzi +2 more
openaire +2 more sources
This article presents a functional programming approach to geometric design with embedded polyhedral complexes. Its main goals are to show the expressive power of the language as well as its usefulness for geometric design. The language, named PLASM (the Programming LAnguage for Solid Modeling), introduces a very high level approach to “constructive ...
Alberto Paoluzzi +2 more
openaire +2 more sources
Geometric Linear Regression and Geometric Relation
2012When a linear regression model is constructed by statistical calculation, all the data are treated without order, even if they are order data. We propose the Geometric regression and geometric relation method (GR2) to utilize the relation information inside the order of data.
Kaijun Wang, Liying Yang 0001
openaire +2 more sources
Geometric Reasoning With Geometric Algebra
2001This chapter starts with an introduction to Clifford algebra for Euclidean geometry and shows how geometric theorems can be proved automatically in the Clifford algebra formalism. A short review of available approaches is given and examples are provided.
openaire +2 more sources
Geometric equivalence, geometric similarity, and geometric compatibility of algebras
Journal of Mathematical Sciences, 2007Most attention is focused on conditions laid on the algebras from a given variety, which provide the coincidence of their algebraic geometries. The notions mentioned in the title of the paper play a leading part. Bibliography: 26 titles.
openaire +1 more source
Proceedings Visualization '93, 2002
An algorithm is presented which describes an application independent method for reducing the number of polygonal primitives required to faithfully represent an object. Reducing polygon count without a corresponding reduction in object detail is important for: achieving interactive frame rates in scientific visualization, reducing mass storage ...
Hinker, P., Hansen, C.
openaire +2 more sources
An algorithm is presented which describes an application independent method for reducing the number of polygonal primitives required to faithfully represent an object. Reducing polygon count without a corresponding reduction in object detail is important for: achieving interactive frame rates in scientific visualization, reducing mass storage ...
Hinker, P., Hansen, C.
openaire +2 more sources
Computer Aided Geometric Design, 1991
One of the main problems of computer aided design is the smooth fitting of surface patches. The authors define geometric (i.e., not parameter dependent) fitting of order k and characterize it in the case of analytic patches. \{An alternative approach would be to say that two patches meet with fit of order k if at the join both generate the same tangent
Thomas Garrity, Joe D. Warren
openaire +1 more source
One of the main problems of computer aided design is the smooth fitting of surface patches. The authors define geometric (i.e., not parameter dependent) fitting of order k and characterize it in the case of analytic patches. \{An alternative approach would be to say that two patches meet with fit of order k if at the join both generate the same tangent
Thomas Garrity, Joe D. Warren
openaire +1 more source
Southeast Asian Bulletin of Mathematics, 2000
The author calls ``geometric dynamics'' the fact that on a semi-Riemannian manifold \((M,g)\) the orbits of a vector field \(X\) are the solutions of a second-order differential equation \(\ddot{x} = \text{grad } f + F(\dot{x})\), where \(f = \frac{1}{2} g(X,X)\) and \(g(F(v),w) = d(g(X))(p)(v,w)\) for tangent vectors \(v,w\) at \(p \in M\).
openaire +1 more source
The author calls ``geometric dynamics'' the fact that on a semi-Riemannian manifold \((M,g)\) the orbits of a vector field \(X\) are the solutions of a second-order differential equation \(\ddot{x} = \text{grad } f + F(\dot{x})\), where \(f = \frac{1}{2} g(X,X)\) and \(g(F(v),w) = d(g(X))(p)(v,w)\) for tangent vectors \(v,w\) at \(p \in M\).
openaire +1 more source
2020
In this short note we shall briefly describe a few flavours of contemporary geometric origami, from kusudama to tessellations and beyond. It will be an impressionistic and not technical presentation, just to give an idea of what can be done with geometric origami.
openaire +2 more sources
In this short note we shall briefly describe a few flavours of contemporary geometric origami, from kusudama to tessellations and beyond. It will be an impressionistic and not technical presentation, just to give an idea of what can be done with geometric origami.
openaire +2 more sources