TRIANGULATION OF BRANCHING CONTOURS USING AREA MINIMIZATION

Authors
HONG M SEDERBERG TW KLIMASZEWSKI KS KANEDA K
Citation
M. Hong et al., TRIANGULATION OF BRANCHING CONTOURS USING AREA MINIMIZATION, International journal of Computational geometry and applications, 8(4), 1998, pp. 389-406
Citations number
14
Categorie Soggetti
Mathematics,"Computer Science Theory & Methods",Mathematics,"Computer Science Theory & Methods
Journal title
International journal of Computational geometry and applications → ACNP
ISSN journal
02181959
Volume
8
Issue
4
Year of publication
1998
Pages
389 - 406
Database
ISI
SICI code
0218-1959(1998)8:4<389:TOBCUA>2.0.ZU;2-O
Abstract
This paper presents a new method for reconstructing piecewise linear s urfaces from planar polygonal contours that branch. For non-branching contours, experience has shown that the piecewise linear surface of mi nimum surface area which connects a pair of contours often provides a good solution. The current algorithm extends this idea by searching fo r the surface of minimal area which connects two contours comprised of more than one polygon. Several examples that justify this heuristic a re provided.