An Implicit Method for Interpolating Two Digital Closed Curves on Parallel Planes

Authors:
Nikolaos Gabrielides;Laurent Cohen
Affiliations:
Centre de Recherche en Mathématique de la Décision, Université Paris IX, Dauphine, Paris Cedex 16, France 75775;Centre de Recherche en Mathématique de la Décision, Université Paris IX, Dauphine, Paris Cedex 16, France 75775
Venue:
SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
Year:
2009

Citing 15
Cited 0

On-line construction of the convex hull of a simple polyline

Information Processing Letters
A triangulation algorithm from arbitrary shaped multiple planar contours

ACM Transactions on Graphics (TOG)
A viscosity solutions approach to shape-from-shading

SIAM Journal on Numerical Analysis
Sub-pixel distance maps and weighted distance transforms

Journal of Mathematical Imaging and Vision - Special issue on topology and geometry in computer vision
Global Minimum for Active Contour Models: A Minimal Path Approach

International Journal of Computer Vision
Optimal surface reconstruction from planar contours

Communications of the ACM
Morphing between polylines

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finding Shortest Paths on Surfaces Using Level Sets Propagation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Surface Reconstruction Between Simple Polygons via Angle Criteria

ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Conversion of complex contour line definitions into polygonal element mosaics

SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Efficient algorithms for solving static hamilton-jacobi equations

Efficient algorithms for solving static hamilton-jacobi equations
Fast Constrained Surface Extraction by Minimal Paths

International Journal of Computer Vision
Fast Surface Segmentation Guided by User Input Using Implicit Extension of Minimal Paths

Journal of Mathematical Imaging and Vision
Multiresolution morphing for planar curves

Computing - Special issue on Geometric Modeling (Dagstuhl 2005)
Approximating complex surfaces by triangulation of contour lines

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ardon et al. [2] presented an implicit method for surface segmentation in 3D images. The boundary of the surface is assumed to be constrained by two given curves in the image. In this work we adopt the afore approach to interpolate two given digital curves lying on parallel planes, by introducing an artificial image potential, which is based on a triangular facet surface interpolation technique.