相关论文: Triangulation of Simple 3D Shapes with Well-Center…

We present a novel algorithm to compute multi-scale curvature fields on triangle meshes. Our algorithm is based on finding robust mean curvatures using the ball neighborhood, where the radius of a ball corresponds to the scale of the…

Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the…

3D representation is essential to the significant advance of 3D generation with 2D diffusion priors. As a flexible representation, NeRF has been first adopted for 3D representation. With density-based volumetric rendering, it however…

We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…

We construct finite element subspaces of the space of symmetric tensors with square-integrable divergence on a three-dimensional domain. These spaces can be used to approximate the stress field in the classical Hellinger--Reissner mixed…

We present novel fully-symmetric quadrature rules with positive weights and strictly interior nodes of degrees up to 84 on triangles and 40 on tetrahedra. Initial guesses for solving the nonlinear systems of equations needed to derive…

In this paper, we classify all of the five-sided three-dimensional hyperbolic polyhedra with one ideal vertex, which have the shape of a triangular prism. We show how to find each such polyhedron in the upper half-space model by considering…

A hex sphere is a singular Euclidean sphere with four cone points whose cone angles are (integer) multiples of $\frac{2\pi}{3}$ but less than $2\pi$. We prove that the Moduli space of hex spheres of unit area is homeomorphic to the the…

Given a triangulated surface, a polyhedral metric could be constructed by gluing Euclidean triangles edge-to-edge. We carefully describe the construction and prove that such a polyhedral metric is the only intrinsic metric on the glued…

Triangular meshes are a widely used representation in the field of 3D modeling. In this paper, we present a novel approach for edge length-based linear subdivision on triangular meshes, along with two auxiliary techniques. We conduct a…

A tetrahedral curve is an unmixed, usually non-reduced, one-dimensional subscheme of projective 3-space whose homogeneous ideal is the intersection of powers of the ideals of the six coordinate lines. The second and third authors have shown…

We explicitly construct small triangulations for a number of well-known 3-dimensional manifolds and give a brief outline of some aspects of the underlying theory of 3-manifolds and its historical development.

We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing…

This paper describes a method for fast simplification of surface meshes. Whereas past methods focus on visual appearance, our goal is to solve equations on the surface. Hence, rather than approximate the extrinsic geometry, we construct a…

We use a probabilistic interpretation of solid angles to generalize the well-known fact that the inner angles of a triangle sum to 180 degrees. For the 3-dimensional case, we show that the sum of the solid inner vertex angles of a…

We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using…

A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…

In this paper we describe a methodology for the identification of symmetric quadrature rules inside of quadrilaterals, triangles, tetrahedra, prisms, pyramids, and hexahedra. The methodology is free from manual intervention and is capable…

We study spherical tetrahedra with rational dihedral angles and rational volumes. Such tetrahedra occur in the Rational Simplex Conjecture by Cheeger and Simons, and we supply vast families, discovered by computational efforts, of positive…

We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a…