11 search results - page 1 / 3 » Efficient polynomial time algorithms computing industrial-st... |
IPL
2006
13 years 4 months ago
2006
CAP
2010
12 years 11 months ago
2010
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
ISSAC
1998
Springer
13 years 9 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
ALENEX
2004
13 years 6 months ago
2004
We present a framework for implementing geometric algorithms involving motion. It is written in C++ and modeled after and makes extensive use of CGAL (Computational Geometry Algor...