中文
相关论文

相关论文: Nonorthogonal Polyhedra Built from Rectangles

200 篇论文

Eberhard proved that for every sequence $(p_k), 3\le k\le r, k\ne 5,7$ of non-negative integers satisfying Euler's formula $\sum_{k\ge3} (6-k) p_k = 12$, there are infinitely many values $p_6$ such that there exists a simple convex…

组合数学 · 数学 2010-05-07 Matt DeVos , Agelos Georgakopoulos , Bojan Mohar , Robert Šámal

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

计算几何 · 计算机科学 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein

The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…

组合数学 · 数学 2019-09-19 Yehonatan Salman

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

Start with Gott (2019)'s envelope polyhedron (Squares-4 around a point): a unit cube missing its top and bottom faces. Stretch by a factor of 2 in the vertical direction so its sides become (2x1 unit) rectangles. This has 8 faces (4…

度量几何 · 数学 2020-06-23 J. Richard Gott , Robert J. Vanderbei

We give coordinate-minimal geometric realizations in general position of all 865 vertex-minimal triangulations of the orientable surface of genus 2 in the 4x4x4-cube.

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

Motivated by the search for reduced polytopes, we consider the following question: For which polytopes exists a vertex-facet assignment, that is, a matching between vertices and non-incident facets, so that the matching covers either all…

组合数学 · 数学 2021-03-02 Thomas Jahn , Martin Winter

In the article, a series of neigbourly polyhedra is constructed. They have $N=2d+4$ vertices and are embedded in $\mathbb R^{2d}$. Their (affine) Gale diagrams in $\mathbb R^2$ have $d+3$ black points that form a convex polygon. These Gale…

组合数学 · 数学 2015-10-12 Rostislav Devyatov

A convex polyhedron is Rupert if a hole can be cut into it (making its genus $1$) such that an identical copy of the polyhedron can pass through the hole. Resolving a conjecture of Jerrard-Wetzel-Yuan, Steininger and Yurkevich recently…

度量几何 · 数学 2026-04-30 Tony Zeng

In this paper, we establish that the non-zero dihedral angles of hyperbolic Coxeter polyhedra of large dimensions are not arbitrarily small. Namely, for dimensions $n\geq 32$, they are of the form $\frac{\pi}{m}$ with $m\leq 6$. Moreover,…

组合数学 · 数学 2025-07-08 Naomi Bredon

We are interested in the maximum possible number of facets that Dirichlet stereohedra for three-dimensional crystallographic groups can have. The problem for non-cubic groups was studied in previous papers by D. Bochis and the second author…

组合数学 · 数学 2009-07-07 Pilar Sabariego , Francisco Santos

Finding necessary conditions for the geometry of flexible polyhedra is a classical problem that has received attention also in recent times. For flexible polyhedra with triangular faces, we showed in a previous work the existence of cycles…

度量几何 · 数学 2022-05-24 Matteo Gallet , Georg Grasegger , Jan Legerský , Josef Schicho

Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their…

组合数学 · 数学 2026-05-18 Riccardo W. Maffucci

It is well-known that every polyhedral cone is finitely generated (i.e. polytopal), and vice versa. Surprisingly, the two notions differ almost always for non-commutative versions of such cones. This was obtained as a byproduct in an…

代数几何 · 数学 2019-03-01 Beatrix Huber , Tim Netzer

An orthogonal coloring of the two-dimensional unit sphere $\mathbb{S}^2$, is a partition of $\mathbb{S}^2$ into parts such that no part contains a pair of orthogonal points, that is, a pair of points at spherical distance $\pi/2$ apart. It…

组合数学 · 数学 2016-02-10 Andreas F. Holmsen , Seunghun Lee

We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…

度量几何 · 数学 2020-06-08 Victor Alexandrov

Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…

组合数学 · 数学 2010-07-23 Benjamin Braun , Richard Ehrenborg

The asymptotic behavior of open plane sections of triply periodic surfaces is dictated, for an open dense set of plane directions, by an integer second homology class of the three-torus. The dependence of this homology class on the…

几何拓扑 · 数学 2021-09-01 Roberto De Leo , Ivan A. Dynnikov

We demonstrate the existence of four types of flexible prismatic polyhedra that can be derived or inferred from a consideration of Bricard octahedra and generalizations of Bricard octahedra. These flexible polyhedra are of genus 0 and 1,…

度量几何 · 数学 2014-07-09 Gerald D. Nelson

We show existence of centrally symmetric maps on surfaces all of whose faces are quadrangles and pentagons for each orientable genus $g \geq 0$. We also show existence of centrally symmetric maps on surfaces all of whose faces are hexagons…

几何拓扑 · 数学 2014-02-19 Dipendu Maity , Ashish Kumar Upadhyay