- Published 2012 in Numerical Algorithms

Let Z be a two dimensional irreducible complex component of the solution set of a system of polynomial equations with real coefficients in N complex variables. This work presents a new numerical algorithm, based on homotopy continuation methods, that begins with a numerical witness set for Z and produces a decomposition into 2-cells of any almost smooth real algebraic surface contained in Z. Each 2-cell (a face) has a generic interior point and a boundary consisting of 1-cells (edges). Similarly, the 1-cells have a generic interior point and a vertex at each end. Each 1-cell and each 2-cell has an associated homotopy for moving the generic interior point to any other point in the interior of the cell, defining an invertible map from the parameter space of the homotopy to the cell. This work draws on previous results for the curve case. Once the cell decomposition is in hand, one can sample the 2-cells and 1-cells to any resolution, limited only by the computational resources available.

@article{Besana2012CellDO,
title={Cell decomposition of almost smooth real algebraic surfaces},
author={Gian Mario Besana and Sandra Di Rocco and Jonathan D. Hauenstein and Andrew J. Sommese and Charles W. Wampler},
journal={Numerical Algorithms},
year={2012},
volume={63},
pages={645-678}
}