36 search results - page 4 / 8 » Arrangement Computation for Planar Algebraic Curves |
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
WEA
2009
Springer
14 years 2 months ago
2009
Springer
We present a cgal-based univariate algebraic kernel, which provides certi ed real-root isolation of univariate polynomials with integer coe cients and standard functionalities such...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has b...
IMAMS
2007
13 years 9 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...