相关论文: Triangulation of Simple 3D Shapes with Well-Center…
Since antiquity, the packing of convex shapes has been of great interest to many scientists and mathematicians. Recently, particular interest has been given to packings of three-dimensional tetrahedra. Dense packings of both crystalline and…
We study questions of existence and uniqueness of quadrature domains using computational tools from real algebraic geometry. These problems are transformed into questions about the number of solutions to an associated real semi-algebraic…
The Cartesian coordinate system is the most commonly used system in computer visualization. This is due to its ease of use and processing speed. However, it is not always suitable for a given problem. Angular measures often allow us to…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
A three-dimensional orthoscheme is defined as a tetrahedron whose base is a right-angled triangle and an edge joining the apex and a non-right-angled vertex is perpendicular to the base. A generalization, called complete orthoschemes, of…
A new numerical approach is proposed for the simulation of coupled three-dimensional and one-dimensional elliptic equations (3D-1D coupling) arising from dimensionality reduction of 3D-3D problems with thin inclusions. The method is based…
A triangular plate-bending element with a new multi-resolution analysis (MRA) is proposed and a novel multiresolution element method is hence presented. The MRA framework is formulated out of a displacement subspace sequence whose basis…
Computational mathematics plays an increasingly important role in computational fluid dynamics (CFD). The aeronautics and aerospace re- search community is working on next generation of CFD capacity that is accurate, automatic, and fast. A…
A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…
The As-Rigid-As-Possible (ARAP) shape deformation framework is a versatile technique for morphing, surface modelling, and mesh editing. We discuss an improvement of the ARAP framework in a few aspects: 1. Given a triangular mesh in 3D…
In 3 dimensions, the Ising model is in the same universality class as $\phi^4$-theory, whose massive 3-loop tetrahedral diagram, $C^{Tet}$, was of an unknown analytical nature. In contrast, all single-scale 4-dimensional tetrahedra were…
Meshes are ubiquitous in visual computing and simulation, yet most existing machine learning techniques represent meshes only indirectly, e.g. as the level set of a scalar field or deformation of a template, or as a disordered triangle soup…
The Circle Pattern Theorem characterizes the existence and rigidity of circle patterns with prescribed intersection angles on simplicial triangulations of closed surfaces. In this paper we extend the theorem to quasi-simplicial…
We found a class of triangulated surfaces in Euclidean space which have similar properties as isothermic surfaces in Differential Geometry. We call a surface isothermic if it admits an infinitesimal isometric deformation preserving the mean…
Halbach spheres provide a theoretically elegant means of generating highly homogeneous magnetic fields, but practical implementation is hindered by challenging fabrication and restricted interior access. This study examines discrete…
We propose a new tetrahedral meshing method, fTetWild, to convert triangle soups into high-quality tetrahedral meshes. Our method builds on the TetWild algorithm, replacing the rational triangle insertion with a new incremental approach to…
The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…
The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector space, without placing any restrictions on the dimension of the space or on the base field. We define a…
In the paper, we consider the rigidity problem of the infinite hexagonal triangulation of the plane under the piecewise linear conformal changes introduced by Luo in [5]. Our result shows that if a geometric hexagonal triangulation of the…
Geometric rounding of a mesh is the task of approximating its vertex coordinates by floating point numbers while preserving mesh structure. Geometric rounding allows algorithms of computational geometry to interface with numerical…