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

We investigate discrete spin transformations, a geometric framework to manipulate surface meshes by controlling mean curvature. Applications include surface fairing -- flowing a mesh onto say, a reference sphere -- and mesh extrusion --…

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any triangulation of the 3-manifold. We compute the triangulation complexity of all elliptic 3-manifolds and all sol 3-manifolds, to within a…

A new class of random spatial tessellations is introduced -- the so-called column tessellations of three-dimensional space. The construction is based on a stationary planar tessellation. Each cell of the spatial tessellation is a prism…

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

For a tensor triangulated category and any regular cardinal $\alpha$ we study the frame of $\alpha$-localizing tensor ideals and its associated space of points. For a well-generated category and its frame of localizing tensor ideals we…

We present 2-D, 3-D, and spherical mesh generators for the Finite Element Method (FEM) using triangular and tetrahedral elements. The mesh nodes are treated as if they were linked by virtual springs that obey Hooke's law. Given the desired…

When obtaining interior 3D voxel data from triangular meshes, most existing methods fail to handle low quality meshes which happens to take up a big portion on the internet. In this work we present a robust voxelization method that is based…

A topologically minimal surface may be isotoped into a normal form with respect to a fixed triangulation. If the intersection with each tetrahedron is simply connected, then the pieces of this normal form are triangles, quadrilaterals, and…

The existence of essential closed surfaces surfaces is proven for finite coverings of 3-manifolds that are triangulated by finitely many topological ideal tetrahedra and admit a regular, negatively curved, ideal structure.

Volume approximation is an important problem found in many applications of computer graphics, vision, and image processing. The problem is about computing an accurate and compact approximate representation of 3D volumes using some simple…

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

Triangle meshes remain the most popular data representation for surface geometry. This ubiquitous representation is essentially a hybrid one that decouples continuous vertex locations from the discrete topological triangulation.…

The convex hull on three points in two dimensional euclidean space of three flat edges (trihedron) was studied. The Bohr-Sommerfeld quantization of the area of space is performed. It is shown that it reproduces exactly the equidistant…

A central problem of geometry is the tiling of space with simple structures. The classical solutions, such as triangles, squares, and hexagons in the plane and cubes and other polyhedra in three-dimensional space are built with sharp…

Cosmological polytopes of graphs are a geometric tool in physics to study wavefunctions for cosmological models whose Feynman diagram is given by the graph. After their recent introduction by Arkani-Hamed, Benincasa and Postnikov the focus…

A well-known result of Walsh states that if $\mathcal T^*$ is an ideal triangulation of an atoroidal, acylindrical, irreducible, compact 3-manifold with torus boundary components, then every properly embedded, two-sided, incompressible…

When a thin sheet is crushed into a small three-dimensional volume, it invariably forms a structure with a low volume fraction but high resistance to further compression. Being a far-from-equilibrium process, forced crumpling is not…

Surfaces are typically represented as meshes, which can be extracted from volumetric fields via meshing or optimized directly as surface parameterizations. Volumetric representations occupy 3D space and have a large effective receptive…

I define a model of three-dimensional simplicial gravity using an extended ensemble of triangulations where, in addition to the usual combinatorial triangulations, I allow degenerate triangulations, i.e. triangulations with distinct…