Results 231 to 240 of about 525,446 (285)

Geometric Computation

2004
The book comprises three closely related parts: the first is devoted mainly to curve and surface modeling, and contains one general survey on theoretical and practical applications of algebraic methods and three specialized surveys on surface blending, parametrization, and implicitization, followed by four research papers.
Chen, Falai, Wang, Dongming
openaire   +3 more sources

EXACT GEOMETRIC COMPUTATION USING CASCADING

International Journal of Computational Geometry & Applications, 2001
In this paper we talk about a new efficient numerical approach to deal with inaccuracy when implementing geometric algorithms. Using various floating-point filters together with arbitrary precision packages, we develop an easy-to-use expression compiler called EXPCOMP. EXPCOMP supports all common operations [Formula: see text].
Burnikel, C., Funke, S., Seel, M.
openaire   +2 more sources

Geometric neural computing

IEEE Transactions on Neural Networks, 2001
This paper shows the analysis and design of feedforward neural networks using the coordinate-free system of Clifford or geometric algebra. It is shown that real-, complex-, and quaternion-valued neural networks are simply particular cases of the geometric algebra multidimensional neural networks and that some of them can also be generated using support
openaire   +2 more sources

Computing Parametric Geometric Resolutions

Applicable Algebra in Engineering, Communication and Computing, 2003
Given a zero-dimensional polynomial system of \(n\) equations in \(n\) indeterminates whose coefficients depend on some parameters, the author presents an algorithm that describes its solutions in a particular way: a parametric geometric resolution (i.e., a geometric resolution whose coefficients are rational functions of the parameters involved). In a
openaire   +1 more source

COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 4. COMPUTATIONAL EXPERIMENTS IN GEOMETRIC PROGRAMMING

Engineering Optimization, 1978
The purpose of this paper is to consolidate the recent independent work of the authors on computational comparisons of geometric programming codes. Results of the performance of 23 different codes on up to 37 test problems are presented, with a view to testing for robustness (fraction of successful solutions computed), speed with which solutions were ...
R. S. DEMBO, M. J. RIJCKAERT
openaire   +1 more source

Geometric Measurements and Geometric Computing

2014
In ancient times, the need for measuring land resulted in the development of geometry, much like the need for counting yielded arithmetic. The easiest example is to measure the distance between two points as we discussed in Chap. 3. In this chapter, we cover basic geometric measurements including curve length, surface area, and solid volumes in ...
openaire   +1 more source

Geometric computing with python

ACM SIGGRAPH 2019 Courses, 2019
This course is a group endeavor by Sebastian Koeh, Teseo Sehneider, Francis Williams, and Daniele Panozzo. Please contact us if you have questions or comments. For troubleshooting, please post an issue on github. We are grateful to the authors of all open souree C++ libraries we are using.
Sebastian Koch, Teseo Schneider, Francis Williams, Daniele Panozzo   +3 more
openaire   +1 more source

Geometric Algebra Computers

2012
How should a computer for Geometric Algebra be designed? This chapter investigates different computing architectures with the goal of implementing Geometric Algebra algorithms with as high a performance as possible.
openaire   +1 more source