Sciweavers

24 search results - page 1 / 5
» Triangulation of Branching Contours Using Area Minimization
Sort
View
IJCGA
1998
97views more  IJCGA 1998»
13 years 4 months ago
Triangulation of Branching Contours Using Area Minimization
This paper presents a new method for reconstructing piecewise linear surfaces from planar polygonal contours that branch. For non-branching contours, experience has shown that the...
Mu Hong, Thomas W. Sederberg, Kris Klimaszewski, K...
VISUALIZATION
1995
IEEE
13 years 8 months ago
Tensor Product Surfaces Guided by Minimal Surface Area Triangulations
We present a method for constructing tensor product Bezier surfaces from contour (cross-section) data. Minimal area triangulations are used to guide the surface construction, and ...
John K. Johnstone, Kenneth R. Sloan
JAL
2006
114views more  JAL 2006»
13 years 5 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
EMMCVPR
2009
Springer
13 years 11 months ago
Boundaries as Contours of Optimal Appearance and Area of Support
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Bayesian boundary models often assume tha...
Christina Pavlopoulou, Stella X. Yu
CVPR
1997
IEEE
13 years 9 months ago
Area and Length Minimizing Flows for Shape Segmentation
— A number of active contour models have been proposed that unify the curve evolution framework with classical energy minimization techniques for segmentation, such as snakes. Th...
Kaleem Siddiqi, Steven W. Zucker, Yves Béru...