中文
相关论文

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

200 篇论文

An n-simplex is said to be n-well-centered if its circumcenter lies in its interior. We introduce several other geometric conditions and an algebraic condition that can be used to determine whether a simplex is n-well-centered. These…

计算几何 · 计算机科学 2009-12-17 Evan VanderZee , Anil N. Hirani , Damrong Guoy , Vadim Zharnitsky , Edgar Ramos

Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have…

计算几何 · 计算机科学 2010-01-25 Evan VanderZee , Anil N. Hirani , Damrong Guoy , Edgar Ramos

Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to a tetrahedral elements, the existing algorithm for…

计算几何 · 计算机科学 2023-01-23 Aman Timalsina , Matthew G. Knepley

We present a differentiable representation, DMesh, for general 3D triangular meshes. DMesh considers both the geometry and connectivity information of a mesh. In our design, we first get a set of convex tetrahedra that compactly tessellates…

计算机视觉与模式识别 · 计算机科学 2025-07-08 Sanghyun Son , Matheus Gadelha , Yang Zhou , Zexiang Xu , Ming C. Lin , Yi Zhou

We describe a simple geometric transformation of triangles which leads to an efficient and effective algorithm to smooth triangle and tetrahedral meshes. Our focus lies on the convergence properties of this algorithm: we prove the…

数值分析 · 数学 2014-11-18 Dimitris Vartziotis , Doris Bohnet

A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…

最优化与控制 · 数学 2019-04-08 Valentin R. Koch , Hung M. Phan

Three--dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the…

组合数学 · 数学 2018-11-27 Valentin Bonzom , Luca Lionni

This paper deals with a simple and straightforward procedure for automatic generation of finite-element or finite-volume meshes of spheroidal domains, consisting of tetrahedra. Besides the equation of the boundary, the generated meshes…

计算几何 · 计算机科学 2017-05-30 Vitoriano Ruas

Tetrahedral frame fields have applications to certain classes of nematic liquid crystals and frustrated media. We consider the problem of constructing a tetrahedral frame field in three dimensional domains in which the boundary normal…

偏微分方程分析 · 数学 2023-04-19 Dmitry Golovaty , Matthias Kurzke , Jose Alberto Montero , Daniel Spirn

Three-dimensional (3-D) meshes are commonly used to represent virtual surfaces and volumes. Over the past decade, 3-D meshes have emerged in industrial, medical, and entertainment applications, being of large practical significance for 3-D…

密码学与安全 · 计算机科学 2021-04-22 Hang Zhou , Weiming Zhang , Kejiang Chen , Weixiang Li , Nenghai Yu

We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which all dihedral angles are less than $77.08^\circ$, and another…

计算几何 · 计算机科学 2007-05-23 David Eppstein , John M. Sullivan , Alper Ungor

An ideal triangulation of a singular flat surface is a geodesic triangulation such that its vertex set is equal to the set of singular points of the surface. Using the fact that each pair of points in a surface has a finite number of…

度量几何 · 数学 2020-12-01 İsmail Sağlam

If the four triangular facets of a tetrahedron can be partitioned into pairs having the same area, then the triangles in each pair must be congruent to one another. A Heron-style formula is then derived for the volume of a tetrahedron…

度量几何 · 数学 2022-11-01 Daniel A. Klain

Triangles are everywhere in the virtual world. The surface of nearly every graphical object is saved as a triangular mesh on a computer. Light effects and movements of virtual objects are computed on the basis of triangulations. Besides…

历史与综述 · 数学 2023-07-27 Dimitris Vartziotis , Doris Bohnet

We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…

组合数学 · 数学 2025-07-01 Linda Green , Stellen Li

The stray- and demagnetization tensor field for a homogeneously magnetized tetrahedron is found analytically. The tetrahedron is a special case of four triangular faces with constant magnetization-charge surface density, for which we also…

计算工程、金融与科学 · 计算机科学 2020-04-27 Kaspar K. Nielsen , Andrea R. Insinga , Rasmus Bjørk

We describe a method for discretizing planar C2-regular domains immersed in non-conforming triangulations. The method consists in constructing mappings from triangles in a background mesh to curvilinear ones that conform exactly to the…

数值分析 · 数学 2012-01-25 Ramsharan Rangarajan , Adrian J. Lew

A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates…

几何拓扑 · 数学 2016-09-07 Feng Luo

Three-dimensional (3D) printing is a powerful development tool both in industry, as well as in biomedical research. Additive-lathe 3D printing is an emerging sub-class of 3D printing whereby material is layered outward from the surface of a…

图形学 · 计算机科学 2019-10-10 Kyle Reeser , Christopher Conlon , Amber L. Doiron

In this survey results on the behavior of simple closed geodesics on regular tetrahedra in three-dimensional spaces of constant curvature are presented.

度量几何 · 数学 2022-12-20 Darya Sukhorebska
‹ 上一页 1 2 3 10 下一页 ›