The cylindrical algebraic decomposition method decomposes Er into regions over which a given polynomial has constant sign by extension of one complicated decomposition of Er-1. We investigate a method which decomposes Er into sign-invariant region by combining several but simpler decompositions of Er-1. We can obtain a sign-invariaat decomposition of E2 defined by a bivariate polynomial of total degree n and coefficient size d in time O(n12 (d + log n)2 log n). Preliminary experiments suggest that the method is useful in practice
AbstractCylindrical algebraic decomposition requires many very time consuming operations, including ...
The improved projection operation for cylindrical algebraic decomposition (CAD) described in [10] re...
AbstractWe present a generalization of the Cylindrical Algebraic Decomposition (CAD) algorithm to sy...
The cylindrical algebraic decomposition method decomposes Er into regions over which a given polynom...
In this report we give an introduction to a constructive way of treating systems of polynomial equat...
Affine algebraic curves are a tool applied in different fields, for instance CAGD. They are defined ...
We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also wor...
International audienceLet P be a square free bivariate polynomial of degree at most d and with integ...
We present a certified and complete algorithm to compute arrangements of real planar algebraic curve...
AbstractIn this paper, we propose a fast semi-numerical algorithm for computing all irreducible bran...
Finding the solutions of a polynomial system is a fundamental problem with numerous applications in ...
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic...
We present an algorithm for isolating all roots of an arbitrary complex polynomial p that also works...
In this note we give two new algorithms for computing a cylindrical algebraic decomposition as well ...
MI: Global COE Program Education-and-Research Hub for Mathematics-for-IndustryグローバルCOEプログラム「マス・フォア・イ...
AbstractCylindrical algebraic decomposition requires many very time consuming operations, including ...
The improved projection operation for cylindrical algebraic decomposition (CAD) described in [10] re...
AbstractWe present a generalization of the Cylindrical Algebraic Decomposition (CAD) algorithm to sy...
The cylindrical algebraic decomposition method decomposes Er into regions over which a given polynom...
In this report we give an introduction to a constructive way of treating systems of polynomial equat...
Affine algebraic curves are a tool applied in different fields, for instance CAGD. They are defined ...
We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also wor...
International audienceLet P be a square free bivariate polynomial of degree at most d and with integ...
We present a certified and complete algorithm to compute arrangements of real planar algebraic curve...
AbstractIn this paper, we propose a fast semi-numerical algorithm for computing all irreducible bran...
Finding the solutions of a polynomial system is a fundamental problem with numerous applications in ...
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic...
We present an algorithm for isolating all roots of an arbitrary complex polynomial p that also works...
In this note we give two new algorithms for computing a cylindrical algebraic decomposition as well ...
MI: Global COE Program Education-and-Research Hub for Mathematics-for-IndustryグローバルCOEプログラム「マス・フォア・イ...
AbstractCylindrical algebraic decomposition requires many very time consuming operations, including ...
The improved projection operation for cylindrical algebraic decomposition (CAD) described in [10] re...
AbstractWe present a generalization of the Cylindrical Algebraic Decomposition (CAD) algorithm to sy...