Authors:
J. F. Sanjuan-Estrada
;
L. G. Casado
and
I. García
Affiliation:
University of Almeria, Spain
Keyword(s):
Computational geometry, Complex roots of real polynomials, Video sequences in complex space.
Related
Ontology
Subjects/Areas/Topics:
Computer Vision, Visualization and Computer Graphics
;
Geometric Computing
;
Geometry and Modeling
;
Rendering
;
Rendering Algorithms
Abstract:
Many geometric applications involve computation and manipulation of non-linear algebraic primitives. These basic primitives like points, curves and surfaces are represented using real numbers and polynomial equations. For example, ray tracing technique rendering three-dimensional realistic images, where each pixel need to find the minimum positive root of intersection point when a lineal ray hit a surface. However, the intersection between a ray and a polynomial equation has differents roots, where each root can be a real number (without imaginary part) or a complex number (with real and imaginary part), so that, the number of roots is equal to degree of polynomial. In this paper, we extend the traditional ray tracing technique to show roots in the complex space. We use an algorithm that analyse all verified roots of intersection point using interval arithmetic. This algorithm computes verified enclosures of the roots of a polynomial by enclosing the zeros in narrow bounds. The relia
bility of the algorithm depends on the accurate evaluation of these complex roots. Finally, we propose differents solutions to render a image in the complex space, where the arguments of complex roots are used to choose the roots of intersection point in complex space, while the color of each pixel is computed by minimum modulus of complex roots chosen.
(More)