Learn More
Solving univariate polynomials and multivariate polynomial systems is critical in geometric computing with curved objects. Moreover, the real roots need to be computed in a certified way in order to avoid possible inconsistency in geometric algorithms. We present a Cgal-based univariate algebraic kernel, which follows the Cgal specifications for univariate(More)
Wide-angle images gained a huge popularity in the last years due to the development of computational photography and imaging technological advances. They present the information of a scene in a way which is more natural for the human eye but, on the other hand, they introduce artifacts such as bent lines. These artifacts become more and more unnatural as(More)
The contents of this report are the sole responsibility of the authors. O conté udo do presente relatórió e dé unica responsabilidade dos autores. Abstract Wide-angle images gained a huge popularity in the last years due to the development of computational photography and technological advances. They present the information of a scene in a much more natural(More)
Orientation is the core predicate in many important geometric algorithms, such as convex hull and tri-angulation computations. This operation reduces to compute the sign of a determinant. We propose a method that improves the amortized complexity of the determinants involved in a convex hull computation. Moreover, we study how can we use the computation(More)
The Orientation predicate is the bottleneck of some important geometric algorithms, such as convex hull and triangulation computations, since it is computed repeatedly. In these and other applications, the matrices whose determinants are computed along the execution of an algorithm have many columns in common. Besides Orientation, this concerns all(More)
  • 1