Surface parameterizations have been widely applied in the computer-aided design for the geometric processing tasks of surface registration, remeshing, texture mapping, and so on. In this paper, we present an efficient balanced energy minimization (BEM) algorithm for the computation of simply connected open surface parameterizations with balanced angle and area distortions. The existence of a nontrivial accumulation function of the BEM algorithm is guaranteed under some mild conditions and the limiting function is shown to be one-to-one. Comparisons of the BEM algorithm with the angle- and the area-preserving parameterizations show that the angular distortion is close to that of the angle-preserving parameterization while the area distortion is significantly improved. An application of the BEM on the Chinese virtual broadcasting technique is demonstrated thereafter, which is consisted of surface remeshing, registration, and morphing.

Adolescent Idiopathic Scoliosis (AIS) characterized by the 3D spine deformity affects about 4% schoolchildren worldwide. Several studies have demonstrated the malfunctioning of postural balance, proprioception, and equilibrium control in patients with AIS. Since these functions are closely related to structures in and around the brainstem, the morphometry of the brainstem surface is of utmost importance. In this paper, we propose an effective method to accurately compute the registration between brainstem surfaces. Four consistent features, which describe the global geometry of the brainstem, are automatically extracted to guide the surface registration. Using the discrete Ricci flow method, brainstem surfaces are parameterized conformally onto the quadrilaterally-faced hexahedron, through which the brainstem registration can be obtained. Our registration algorithm can guarantee the exact landmark correspondence between brainstem surfaces. With the obtained registration, a shape energy can be defined to measure the local shape difference between different brainstem surfaces. We have tested our algorithms on 30 real brainstem surfaces extracted from MRIs of 15 normal subjects and 15 AIS patients. Experimental results show the efficacy of the proposed algorithm to register brainstem surfaces, which matches landmark features consistently. The computed registration can be used for the morphometry of brainstems.

This paper describes a high-resolution, real-time, three-dimensional shape measurement system using the modified two-plus-one phase-shifting algorithm. The data acquisition speed is as high as 60 frames/s with an image resolution of 640480 pixels per frame. Experiments demonstrated that the system was able to acquire the dynamic changing objects such as facial geometric shape changes when the subject is speaking, and the modified two-plus-one phase-shifting algorithm can further alleviate the error due to motion. Applications of this system include manufacturing, online inspection, medical imaging, compute vision, and computer graphics.

This paper describes a Graphics Processing Unit (GPU)-assisted real-time three-dimensional shape measurement system. Our experiments demonstrated that the absolute coordinates calculation and rendering speed of a GPU is more than four times faster than that of a dual CPU workstation with the same graphics card. By implementing the GPU into our system, we realized simultaneous absolute coordinate acquisition, reconstruction and display at 30 frames per second with a resolution of approximately 266K points per frame. Moreover, a 2+1 phase-shifting algorithm was employed to alleviate the measurement error caused by motion. Applications of the system include medical imaging, manufacturing, entertainment, and security.

We study the combinatorial complexity of Voronoi diagram of point sites on a general triangulated 2-manifold surface, based on the geodesic metric. Given a triangulated 2- manifold T of n faces and a set of m point sites S = {s1, s2, . . . , sm} ∈ T, we prove that the complexity of Voronoi diagram VT (S) of S on T is O(mn) if the genus of T is zero. For a genus-g manifold T in which the samples in S are dense enough and the resulting Voronoi diagram satisfies the closed ball property, we prove that the complexity of Voronoi diagram VT (S) is O((m + g)n).