## Numerical Design Limited

- B. Tebbs, T. Whitted
- Personal Communication,
- 1993

- Published 2007

Computing the visible portions of curved surfaces from a given viewpoint is of great interest in many applications It is closely related to the hidden surface removal problem in computer graphics and machining applications in manufacturing Most of the earlier work has focused on discrete methods based on polygonization or ray tracing and hidden curve removal In this paper we present an algorithm for hidden surface computations on curved surfaces Given a viewpoint it decomposes the domain of each surface based on silhouettes and boundary curves To compute the exact visibility we introduce a notion of visibility curves obtained by projection of silhouette and boundary curves and decomposing the surface into non overlapping regions These curves are computed using marching methods and we present techniques to compute all the components The non overlapping and visible portions of the surface are represented as trimmed surfaces and we present a representation based on polygon trapezoidation algorithms The algorithms presented use some recently developed algorithms from computational geometry like triangulation of simple polygons and point location Given the non overlapping regions we use a simple randomized algorithm for visibility computations from a given viewpoint Supported in part by a Sloan Fellowship university research council grant NSF grant CCR ONR contract N ARPA contract DABT C NSF ARPA Science and Technology Center for Computer Graphics Scienti c Visualization and NSF Prime contract No

@inproceedings{Krishnan2007HiddenSR,
title={Hidden Surface Removal Algorithms for Curved Surfaces},
author={Shankar Krishnan and Dinesh Manocha and F. C. Hor},
year={2007}
}