Sciweavers

577 search results - page 30 / 116
» Computing Rational Bisectors
Sort
View
CAD
2006
Springer
13 years 8 months ago
A rational extension of Piegl's method for filling n-sided holes
N-sided hole filling plays an important role in vertex blending. To deal with the case that the corner is surrounded by rational surfaces (i.e. NURBS surfaces), an algorithm to fi...
Yi-Jun Yang, Jun-Hai Yong, Hui Zhang, Jean-Claude ...
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 8 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 8 months ago
On the decomposition of k-valued rational relations
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...
Jacques Sakarovitch, Rodrigo de Souza
FOCM
2008
77views more  FOCM 2008»
13 years 8 months ago
Modular Counting of Rational Points over Finite Fields
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
Daqing Wan
COMGEO
2006
ACM
13 years 8 months ago
An exact and efficient approach for computing a cell in an arrangement of quadrics
We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and ...
Elmar Schömer, Nicola Wolpert