Geometric Illumination of Implicit Surfaces
Michal Zamboj, Jakub Řada
TL;DR
This paper introduces a geometry-based framework for illuminating implicit surfaces by replacing polygonal meshes with algebraic representations. It constructs shadows from a point light using a terminator derived from the first polar $\mathcal{S}_L$ and a tangent cone $\mathcal{T}$, then partitions the scene via cylindrical algebraic decomposition into semi-algebraic subregions that are classified as illuminated or self-shaded. A nearest-subregion criterion based on light-ray intersections determines the visible components, and the method generalizes to multiple objects at the cost of higher CAD complexity. While offering precise, non-mesh-based visualizations and connections to occluding contours, the approach is computationally intensive due to the doubly exponential complexity of Gröbner basis calculations and CAD, particularly for high-degree surfaces.
Abstract
Illumination of scenes is usually generated in computer graphics using polygonal meshes. In this paper, we present a geometric method using projections. Starting from an implicit polynomial equation of a surface in 3-D or a curve in 2-D, we provide a semi-algebraic representation of each part of the construction. To solve polynomial condition systems and find constrained regions, we apply algebraic computational algorithms for computing the Gr{\" o}bner basis and cylindrical algebraic decomposition. The final selection of illuminated and self-shaded components for polynomial surfaces of a degree higher than three is discussed. The text is accompanied by visualizations of illumination of surfaces up to degree eight.
