Share Email Print

Proceedings Paper

Contour lines of a C1 surface defined over a triangulation
Author(s): Marc Daniel
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 February 1992
PDF: 11 pages
Proc. SPIE 1610, Curves and Surfaces in Computer Vision and Graphics II, (1 February 1992); doi: 10.1117/12.135156
Show Author Affiliations
Marc Daniel, Ecole Centrale de Nantes (France)

Published in SPIE Proceedings Vol. 1610:
Curves and Surfaces in Computer Vision and Graphics II
Martine J. Silbermann; Hemant D. Tagare, Editor(s)

© SPIE. Terms of Use
Back to Top