中文
相关论文

相关论文: Symbolic Constraints in Polyhedral Enclosure and T…

200 篇论文

Every surface that is intrinsically polyhedral can be represented by a portalgon: a collection of polygons in the Euclidean plane with some pairs of equally long edges abstractly identified. While this representation is arguably simpler…

计算几何 · 计算机科学 2026-03-26 Loïc Dubois

For a nonempty polyhedral set $P\subset \mathbb R^d$, let $\mathcal F(P)$ denote the set of faces of $P$, and let $N(P,F)$ be the normal cone of $P$ at the nonempty face $F\in\mathcal F(P)$. We prove that the function $\sum_{F\in\mathcal…

度量几何 · 数学 2018-02-14 Daniel Hug , Zakhar Kabluchko

The closure constraint is a central piece of the mathematics of loop quantum gravity. It encodes the gauge invariance of the spin network states of quantum geometry and provides them with a geometrical interpretation: each decorated vertex…

广义相对论与量子宇宙学 · 物理学 2017-06-28 Christoph Charles , Etera R. Livine

It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…

微分几何 · 数学 2024-04-29 Jilly Kevo

3D printing of surfaces has become an established method for prototyping and visualisation. However, surfaces often contain certain degenerations, such as self-intersecting faces or non-manifold parts, which pose problems in obtaining a 3D…

计算几何 · 计算机科学 2024-05-28 Christian Amend , Tom Goertzen

A mechanically-based structural optimization method is utilized to explore the phenomena of jamming for assemblies of frictionless Platonic solids. Systems of these regular convex polyhedra exhibit mechanically stable phases with density…

软凝聚态物质 · 物理学 2012-05-08 Kyle C. Smith , Meheboob Alam , Timothy S. Fisher

We prove that there is an algorithm which determines whether or not a given 2-polyhedron can be embedded into some integral homology 3-sphere. This is a corollary of the following main result. Let $M$ be a compact connected orientable…

几何拓扑 · 数学 2016-06-03 Dmitry Tonkonog

We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R^3. We also provide examples of minimal vertex triangulations of closed, connected, orientable…

度量几何 · 数学 2008-01-18 Lars Schewe

This research provides algorithms and numerical methods to geometrically control the magnitude of the internal and external forces in the reciprocal diagrams of 3D/Polyhedral Graphic statics (3DGS). In 3DGS, the form of the structure and…

计算几何 · 计算机科学 2020-07-31 Masoud Akbarzadeh , Marton Hablicsek

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

原子与分子团簇 · 物理学 2022-09-20 KLaus E. Hermann

In this paper we provide a tetrahedra-free algorithm to compute low-cardinality quadrature rules with a given degree of polynomial exactness, positive weights and interior nodes on a polyhedral element with arbitrary shape. The key tools…

数值分析 · 数学 2022-12-01 Alvise Sommariva , Marco Vianello

Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a…

度量几何 · 数学 2009-05-13 Stefan Hougardy , Frank H. Lutz , Mariano Zelke

Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…

几何拓扑 · 数学 2018-11-14 Joseph Gordon , Gaiane Panina

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

组合数学 · 数学 2026-05-27 Arnau Padrol , Germain Poullot

We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

几何拓扑 · 数学 2013-03-28 David Bachman

We study the Art Gallery Problem for face guards in polyhedral environments. The problem can be informally stated as: how many (not necessarily convex) windows should we place on the external walls of a dark building, in order to completely…

计算几何 · 计算机科学 2014-04-22 Giovanni Viglietta

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…

计算几何 · 计算机科学 2015-07-31 Muhibur Rasheed , Chandrajit Bajaj

Consider a cubic surface satisfying the mild condition that it may be described in Sylvester's pentahedral form. There is a well-known Enriques or Coble surface S with K3 cover birationally isomorphic to the Hessian surface of this cubic…

代数几何 · 数学 2018-09-24 Daniel Allcock , Igor Dolgachev

We construct new examples of immersed minimal surfaces with catenoid ends and finite total curvature, of both genus zero and higher genus. In the genus zero case, we classify all such surfaces with at most $2n+1$ ends, and with symmetry…

微分几何 · 数学 2008-04-29 Wayne Rossman

We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…

数值分析 · 数学 2022-05-11 Pablo Antolin , Xiaodong Wei , Annalisa Buffa
‹ 上一页 1 2 3 10 下一页 ›