Sciweavers

6 search results - page 1 / 2
» An Elimination Method for Solving Bivariate Polynomial Syste...
Sort
View
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 5 months ago
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination metho...
Eric Berberich, Pavel Emeliyanenko, Michael Sagral...
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 11 days ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
CAD
2006
Springer
13 years 5 months ago
Trimming local and global self-intersections in offset curves/surfaces using distance maps
A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a ratio...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
JCP
2008
126views more  JCP 2008»
13 years 5 months ago
Extension Information-Knowledge-Strategy System for Semantic Interoperability
This paper discusses the issue of information interoperability. In view of the problems that it is difficult to solve the semantic conflicts in information interoperability, the pa...
Li Weihua, Yang Chunyan
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
13 years 9 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan