On a Linear Programming Approach to the Discrete Willmore Boundary Value Problem and Generalizations
暂无分享,去创建一个
[1] Raluca E. Rusu. An algorithm for the elastic flow of surfaces , 2005 .
[2] Kenneth A. Brakke,et al. The Surface Evolver , 1992, Exp. Math..
[3] K. Polthier. Polyhedral Surfaces of Constant Mean Curvature , 2002 .
[4] Robert B. Kusner,et al. Comparison surfaces for the Willmore problem , 1989 .
[5] J. Sullivan. Computing hypersurfaces which minimize surface energy plus bulk energy , 1994 .
[6] K. Polthier. Computational Aspects of Discrete Minimal Surfaces , 2002 .
[7] John Sullivan,et al. Minimizing the Squared Mean Curvature Integral for Surfaces in Space Forms , 1992, Exp. Math..
[8] Martin Rumpf,et al. Two Step Time Discretization of Willmore Flow , 2009, IMA Conference on the Mathematics of Surfaces.
[9] U. Pinkall. Hopf tori in S 3 , 2005 .
[10] Eric V. Denardo,et al. Flows in Networks , 2011 .
[11] Vladimir Kolmogorov,et al. An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[12] Guillermo Sapiro,et al. Inpainting surface holes , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).
[13] Tobias Achterberg,et al. Constraint integer programming , 2007 .
[14] Klaus Truemper,et al. Algebraic Characterizations of Unimodular Matrices , 1978 .
[15] P. Camion. Characterization of totally unimodular matrices , 1965 .
[16] H. P. Williams. THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .
[17] Jean-Marie Morvan,et al. Generalized Curvatures , 2008, Geometry and Computing.
[18] E. Felten,et al. A Crystalline Approximation Theorem for Hypersurfaces , 1990 .
[19] Gerhard Dziuk,et al. Computational parametric Willmore flow , 2008, Numerische Mathematik.
[20] Uwe F. Mayer,et al. A numerical scheme for axisymmetric solutions of curvature-driven free boundary problems, with applications to the Willmore flow , 2002 .
[21] Martin Rumpf,et al. A finite element method for surface restoration with smooth boundary conditions , 2004, Comput. Aided Geom. Des..
[22] Leon Simon,et al. Lectures on Geometric Measure Theory , 1984 .
[23] Leo Grady,et al. Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[24] S. Luckhaus,et al. Implicit time discretization for the mean curvature flow equation , 1995 .
[25] U. Pinkall,et al. Willmore Surfaces , 1987 .
[26] M. Droske,et al. A level set formulation for Willmore flow , 2004 .
[27] Peter Schröder,et al. Discrete Willmore flow , 2005, SIGGRAPH Courses.
[28] Eitan Grinspun,et al. Discrete quadratic curvature energies , 2006, Comput. Aided Geom. Des..
[29] F. Almgren,et al. Curvature-driven flows: a variational approach , 1993 .
[30] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[31] R. Schätzle. The Willmore boundary problem , 2010 .
[32] K. Polthier,et al. On the convergence of metric and geometric properties of polyhedral surfaces , 2007 .
[33] Steven J. Ruuth,et al. Threshold dynamics for high order geometric motions , 2006 .
[34] Ramesh C. Jain,et al. Using Dynamic Programming for Solving Variational Problems in Vision , 1990, IEEE Trans. Pattern Anal. Mach. Intell..
[35] Alexei Heintz,et al. A convolution thresholding scheme for the Willmore flow , 2008 .