1,171 research outputs found
A Metric for genus-zero surfaces
We present a new method to compare the shapes of genus-zero surfaces. We
introduce a measure of mutual stretching, the symmetric distortion energy, and
establish the existence of a conformal diffeomorphism between any two
genus-zero surfaces that minimizes this energy. We then prove that the energies
of the minimizing diffeomorphisms give a metric on the space of genus-zero
Riemannian surfaces. This metric and the corresponding optimal diffeomorphisms
are shown to have properties that are highly desirable for applications.Comment: 33 pages, 8 figure
Triunduloids: Embedded constant mean curvature surfaces with three ends and genus zero
In 1841, Delaunay constructed the embedded surfaces of revolution with
constant mean curvature (CMC); these unduloids have genus zero and are now
known to be the only embedded CMC surfaces with two ends and finite genus.
Here, we construct the complete family of embedded CMC surfaces with three ends
and genus zero; they are classified using their asymptotic necksizes. We work
in a class slightly more general than embedded surfaces, namely immersed
surfaces which bound an immersed three-manifold, as introduced by Alexandrov.Comment: LaTeX, 22 pages, 2 figures (8 ps files); full version of our
announcement math.DG/9903101; final version (minor revisions) to appear in
Crelle's J. reine angew. Mat
Discrete exterior calculus (DEC) for the surface Navier-Stokes equation
We consider a numerical approach for the incompressible surface Navier-Stokes
equation. The approach is based on the covariant form and uses discrete
exterior calculus (DEC) in space and a semi-implicit discretization in time.
The discretization is described in detail and related to finite difference
schemes on staggered grids in flat space for which we demonstrate second order
convergence. We compare computational results with a vorticity-stream function
approach for surfaces with genus 0 and demonstrate the interplay between
topology, geometry and flow properties. Our discretization also allows to
handle harmonic vector fields, which we demonstrate on a torus.Comment: 21 pages, 9 figure
Geometric modeling and optimization over regular domains for graphics and visual computing
The effective construction of parametric representation of complicated geometric objects can facilitate many design, analysis, and simulation tasks in Computer-Aided Design (CAD), Computer-Aided Manufacturing (CAM), and Computer-Aided Engineering (CAE). Given a 3D shape, the procedure of finding such a parametric representation upon a canonical domain is called geometric parameterization. Regular geometric regions, such as polycubes and spheres, are desirable domains for parameterization. Parametric representations defined upon regular geometric domains have many desirable mathematical properties and can facilitate or simplify various surface/solid modeling and processing computation. This dissertation studies the construction of parameterization on regular geometric domains and explores their applications in shape modeling and computer-aided design. Specifically, we studies (1) the surface parameterization on the spherical domain for closed genus-zero surfaces; (2) the surface parameterization on the polycube domain for general closed surfaces; and (3) the volumetric parameterization for 3D-manifolds embedded in 3D Euclidean space. We propose novel computational models to solve these geometric problems. Our computational models reduce to nonlinear optimizations with various geometric constraints. Hence, we also need to explore effective optimization algorithms. The main contributions of this dissertation are three-folded. (1) We developed an effective progressive spherical parameterization algorithm, with an efficient nonlinear optimization scheme subject to the spherical constraint. Compared with the state-of-the-art spherical mapping algorithms, our algorithm demonstrates the advantages of great efficiency, lower distortion, and guaranteed bijectiveness, and we show its applications in spherical harmonic decomposition and shape analysis. (2) We propose a first topology-preserving polycube domain optimization algorithm that simultaneously optimizes polycube domain together with the parameterization to balance the mapping distortion and domain simplicity. We develop effective nonlinear geometric optimization algorithms dealing with variables with and without derivatives. This polycube parameterization algorithm can benefit the regular quadrilateral mesh generation and cross-surface parameterization. (3) We develop a novel quaternion-based optimization framework for 3D frame field construction and volumetric parameterization computation. We demonstrate our constructed 3D frame field has better smoothness, compared with state-of-the-art algorithms, and is effective in guiding low-distortion volumetric parameterization and high-quality hexahedral mesh generation
How round is a protein? Exploring protein structures for globularity using conformal mapping.
We present a new algorithm that automatically computes a measure of the geometric difference between the surface of a protein and a round sphere. The algorithm takes as input two triangulated genus zero surfaces representing the protein and the round sphere, respectively, and constructs a discrete conformal map f between these surfaces. The conformal map is chosen to minimize a symmetric elastic energy E S (f) that measures the distance of f from an isometry. We illustrate our approach on a set of basic sample problems and then on a dataset of diverse protein structures. We show first that E S (f) is able to quantify the roundness of the Platonic solids and that for these surfaces it replicates well traditional measures of roundness such as the sphericity. We then demonstrate that the symmetric elastic energy E S (f) captures both global and local differences between two surfaces, showing that our method identifies the presence of protruding regions in protein structures and quantifies how these regions make the shape of a protein deviate from globularity. Based on these results, we show that E S (f) serves as a probe of the limits of the application of conformal mapping to parametrize protein shapes. We identify limitations of the method and discuss its extension to achieving automatic registration of protein structures based on their surface geometry
- …