A simple approach for the estimation of circular arc center and its radius
Computer Vision, Graphics, and Image Processing
Least-Squares Estimation of Transformation Parameters Between Two Point Patterns
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Texture mapping progressive meshes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Solving Problems in Scientific Computing Using Maple and MATLAB
Solving Problems in Scientific Computing Using Maple and MATLAB
Interactive geometry remeshing
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Deformation transfer for triangle meshes
ACM SIGGRAPH 2004 Papers
A remeshing approach to multiresolution modeling
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Meshless deformations based on shape matching
ACM SIGGRAPH 2005 Papers
As-rigid-as-possible shape manipulation
ACM SIGGRAPH 2005 Papers
Geometric modeling with conical meshes and developable surfaces
ACM SIGGRAPH 2006 Papers
A fast multigrid algorithm for mesh deformation
ACM SIGGRAPH 2006 Papers
Preserving form features in interactive mesh deformation
Computer-Aided Design
Mesh shape-quality optimization using the inverse mean-ratio metric
Mathematical Programming: Series A and B
Constrained planar remeshing for architecture
GI '07 Proceedings of Graphics Interface 2007
ACM SIGGRAPH 2007 papers
PriMo: coupled prisms for intuitive surface modeling
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Designing quadrangulations with discrete harmonic forms
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
As-rigid-as-possible surface modeling
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
iWIRES: an analyze-and-edit approach to shape manipulation
ACM SIGGRAPH 2009 papers
ACM SIGGRAPH 2009 papers
Robust single-view geometry and motion reconstruction
ACM SIGGRAPH Asia 2009 papers
Spectral conformal parameterization
SGP '08 Proceedings of the Symposium on Geometry Processing
A local/global approach to mesh parameterization
SGP '08 Proceedings of the Symposium on Geometry Processing
Discrete Laplacians on general polygonal meshes
ACM SIGGRAPH 2011 papers
Spin transformations of discrete surfaces
ACM SIGGRAPH 2011 papers
Shape space exploration of constrained meshes
Proceedings of the 2011 SIGGRAPH Asia Conference
General planar quadrilateral mesh design using conjugate direction field
Proceedings of the 2011 SIGGRAPH Asia Conference
Inconsistent signal feasibility problems: least-squares solutionsin a product space
IEEE Transactions on Signal Processing
Designing unreinforced masonry models
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Robust fairing via conformal curvature flow
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Integer-grid maps for reliable quad meshing
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Dynamic 2D/3D registration for the Kinect
ACM SIGGRAPH 2013 Courses
Urban pattern: layout design by hierarchical domain splitting
ACM Transactions on Graphics (TOG)
Realtime Performance-Based Facial Avatars for Immersive Gameplay
Proceedings of Motion on Games
Fitting polynomial volumes to surface meshes with Voronoï squared distance minimization
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
Hi-index | 0.00 |
We introduce a unified optimization framework for geometry processing based on shape constraints. These constraints preserve or prescribe the shape of subsets of the points of a geometric data set, such as polygons, one-ring cells, volume elements, or feature curves. Our method is based on two key concepts: a shape proximity function and shape projection operators. The proximity function encodes the distance of a desired least-squares fitted elementary target shape to the corresponding vertices of the 3D model. Projection operators are employed to minimize the proximity function by relocating vertices in a minimal way to match the imposed shape constraints. We demonstrate that this approach leads to a simple, robust, and efficient algorithm that allows implementing a variety of geometry processing applications, simply by combining suitable projection operators. We show examples for computing planar and circular meshes, shape space exploration, mesh quality improvement, shape-preserving deformation, and conformal parametrization. Our optimization framework provides a systematic way of building new solvers for geometry processing and produces similar or better results than state-of-the-art methods. © 2012 Wiley Periodicals, Inc.