Translator Disclaimer
Paper
1 February 1992 Contour lines of a C1 surface defined over a triangulation
Author Affiliations +
Abstract
We describe a method for finding contour lines of a C1 surface on which could exist edges with only C continuity. The grid, support of the marching step for every lines, is a triangular one. Each triangle of the initial triangulation is uniformly subdivided with an independant depth of recursivity controled by the lengths of its subtriangles edges and the altitude differences between the associated vertices. Subtriangles in each triangle are numbered. Countouring is based on a set of functions supplying the connections between subtriangles and triangles. Break line crossings are detected. As in every intersection problems, the processing of particular cases entails an important increase of complexity. Solutions are given. Optional Bsplines smoothing of contour lines is provided. It preserves existing ridges. Adaptable G1 continuity at junction points of closed curves is supplied.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Marc Daniel "Contour lines of a C1 surface defined over a triangulation", Proc. SPIE 1610, Curves and Surfaces in Computer Vision and Graphics II, (1 February 1992); https://doi.org/10.1117/12.135156
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Rendering of NURBS curves (Invited Paper)
Proceedings of SPIE (February 01 1992)
Symmetric algorithms for curves and surfaces
Proceedings of SPIE (August 01 1990)
Complexity of computing nice viewpoints of objects in space
Proceedings of SPIE (October 23 2000)
Image segmentation using Gaussian curvature
Proceedings of SPIE (October 03 1995)
Approximation of sweep surfaces by tensor product NURBS
Proceedings of SPIE (February 01 1992)
Knot removal for scattered data
Proceedings of SPIE (February 01 1992)

Back to Top