Sciweavers

492 search results - page 3 / 99
» Simplifying Probabilistic Programs Using Computer Algebra
Sort
View
AFPAC
2000
Springer
267views Mathematics» more  AFPAC 2000»
13 years 9 months ago
The Lie Model for Euclidean Geometry
Abstract. In this paper we investigate the Lie model of Lie sphere geometry using Clifford algebra. We employ it to Euclidean geometric problems involving oriented contact to simpl...
Hongbo Li
VISUALIZATION
1997
IEEE
13 years 9 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano
ENTCS
2008
91views more  ENTCS 2008»
13 years 5 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
COMPUTING
2004
108views more  COMPUTING 2004»
13 years 5 months ago
Fairness Criteria for Algebraic Curves
We develop methods for the variational design of algebraic curves. Our approach is based on truly geometric fairness criteria, such as the elastic bending energy. In addition, we ...
Pavel Chalmovianský, Bert Jüttler
EUROCAST
2005
Springer
97views Hardware» more  EUROCAST 2005»
13 years 10 months ago
Extracting Computer Algebra Programs from Statements
In this paper, an approach to synthesize correct programs from specifications is presented. The idea is to extract code from definitions appearing in statements which have been me...
Jesús Aransay, Clemens Ballarin, Julio Rubi...