Shape registration has a wide range of applications in geometric modeling, medical imaging, and computer vision. This paper focuses on the registration of the genus-3 vestibular systems and studies the geometric differences between the normal and Adolescent Idiopathic Scoliosis (AIS) groups. The non-trivial topology of the VS poses great technical challenges to the geometric analysis. To tackle these challenges, we present an effective and practical solution to register the vestibular systems. We first extract six geodesic landmarks for the VS, which are stable, intrinsic, and insensitive to the VS’s resolution and tessellation. Moreover, they are highly consistent regardless of the AIS and normal groups. The detected geodesic landmarks partition the VS into three patches, a topological annulus and two topological disks. For each pair of patches of the AIS subject and the control, we compute a bijective map using the holomorphic 1-form and harmonic map techniques. With a carefully designed boundary condition, the three individual maps can be glued in a seamless manner so that the resulting registration is a homeomorphism with exact landmark matching. Our method is robust, automatic and efficient. It takes only a few seconds on a low-end PC, which significantly outperforms the non-rigid ICP algorithm. We conducted a student’s t-test on the test data. Computational results show that using the mean curvature measure E_H, our method can distinguish the AIS subjects and the normal subjects.

We propose a novel framework for reconstructing lightweight polygonal surfaces from point clouds. Unlike traditional methods that focus on either extracting good geometric primitives or obtaining proper arrangements of primitives, the emphasis of this work lies in intersecting the primitives (planes only) and seeking for an appropriate combination of them to obtain a manifold polygonal surface model without boundary. We show that reconstruction from point clouds can be cast as a binary labeling problem. Our method is based on a hypothesizing and selection strategy. We first generate a reasonably large set of face candidates by intersecting the extracted planar primitives. Then an optimal subset of the candidate faces is selected through optimization. Our optimization is based on a binary linear programming formulation under hard constraints that enforce the final polygonal surface model to be manifold and watertight. Experiments on point clouds from various sources demonstrate that our method can generate lightweight polygonal surface models of arbitrary piecewise planar objects. Besides, our method is capable of recovering sharp features and is robust to noise, outliers, and missing data.

Let $K/k$ be a finite Galois extension and $\pi = \fn{Gal}(K/k)$. An algebraic torus $T$ defined over $k$ is called a $\pi$-torus if $T\times_{\fn{Spec}(k)} \fn{Spec}(K)\simeq \bm{G}_{m,K}^n$ for some integer $n$. The set of all algebraic $\pi$-tori defined over $k$ under the stably birational equivalence forms a semigroup, denoted by $T(\pi)$. We will give a complete proof of the following theorem due to Endo and Miyata \cite{EM4}. Theorem. Let $\pi$ be a finite group. Then $T(\pi)\simeq C(\Omega_{\bm{Z}\pi})$ where $\Omega_{\bm{Z}\pi}$ is a maximal $\bm{Z}$-order in $\bm{Q}\pi$ containing $\bm{Z}\pi$ and $C(\Omega_{\bm{Z}\pi})$ is the locally free class group of $\Omega_{\bm{Z}\pi}$, provided that $\pi$ is isomorphic to one of the following four types of groups : $C_n$ ($n$ is any positive integer), $D_m$ ($m$ is any odd integer $\ge 3$), $C_{q^f}\times D_m$ ($m$ is any odd integer $\ge 3$, $q$ is an odd prime number not dividing $m$, $f\ge 1$, and $(\bm{Z}/q^f\bm{Z})^{\times}=\langle \bar{p}\rangle$ for any prime divisor $p$ of $m$), $Q_{4m}$ ($m$ is any odd integer $\ge 3$, $p\equiv 3 \pmod{4}$ for any prime divisor $p$ of $m$).

This paper studies the Voronoi diagrams on 2-manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point-source based GVDs, since a typical bisector contains line segments, hyperbolic segments and parabolic segments. To tackle this challenge, we introduce a new concept, called local Voronoi diagram (LVD), which is a combination of additively weighted Voronoi diagram and line-segment Voronoi diagram on a mesh triangle. We show that when restricting on a single mesh triangle, the GVD is a subset of the LVD and only two types of mesh triangles can contain GVD edges. Based on these results, we propose an efficient algorithm for constructing the GVD with polyline generators. Our algorithm runs in O(nNlogN) time and takes O(nN) space on an n-face mesh with m generators, where N = max{m,n}. Computational results on real-world models demonstrate the efficiency of our algorithm.

Surface parameterizations have been widely applied to digital geometry processing. In this paper, we propose an efficient conformal energy minimization (CEM) algorithm for computing conformal parameterizations of simply-connected open surfaces with a very small angular distortion and a highly improved computational efficiency. In addition, we generalize the proposed CEM algorithm to computing conformal parameterizations of multiply-connected surfaces. Furthermore, we prove the existence of a nontrivial accumulation point of the proposed CEM algorithm under some mild conditions. Several numerical results show the efficiency and robustness of the CEM algorithm comparing to the existing state-of-the-art algorithms. An application of the CEM on the surface morphing between simply-connected open surfaces is demonstrated thereafter. Thanks to the CEM algorithm, the whole computations for the surface morphing can be performed efficiently and robustly.