No abstract uploaded!

This paper is motivated by the problem of subdividing a prismatic mesh to a tetrahedral mesh (without inserting Steiner points) so as to not only match arbitrarily prescribed boundary conditions but also allow arbitrary topologies in the base mesh. We explore all possible combinations of these two factors, and propose a complete solution to this 3D problem by converting it to an equivalent 2D graph problem, called cutting flow problem. For each case, we not only prove the sufficient and necessary condition for the existence of solutions, but also provide linear and provable algorithms to compute a solution whenever there is one.

Surface conformal parameterizations have been widely applied to various tasks in computer graphics. In this paper, we develop a convergent conformal energy minimization (CCEM) iterative algorithm via the line-search gradient descent method with a quadratic approximation for the computation of disk-shaped conformal parameterizations of simply connected open triangular meshes. In addition, we prove the global convergence of the proposed CCEM iterative algorithm. Moreover, under some mild assumptions, we prove the existence of the nontrivial solution, which is a local minimum of the conformal energy with a bijective boundary map. Numerical experiments indicate that the efficiency of the proposed CCEM algorithm is highly improved and the accuracy is competitive with that of state-of-the-art algorithms.

We present an alternate description of the Ozsv´ath-Szab´o contact class in Heegaard Floer homology. Using our contact class, we prove that if a contact structure (M, ) has an adapted open book decomposition whose page S is a once-punctured torus, then the monodromy is right-veering if and only if the contact structure is tight.

No abstract uploaded!