English
Related papers

Related papers: Regular Polygonal Complexes in Space, I

200 papers

The matching complex of a graph is the simplicial complex whose vertex set is the set of edges of the graph with a face for each independent set of edges. In this paper we completely characterize the pairs (graph, matching complex) for…

Combinatorics · Mathematics 2020-03-24 Margaret Bayer , Bennet Goeckner , Marija Jelić Milutinović

A regular map is a surface together with an embedded graph, having properties similar to those of the surface and graph of a platonic solid. We analyze regular maps with reflection symmetry and a graph of density strictly exceeding 1/2, and…

Combinatorics · Mathematics 2015-01-15 R. H. Eggermont , M. Hendriks

For a finite set $U$ of directions in the Euclidean plane, a convex non-degenerate polygon $P$ is called a $U$-polygon if every line parallel to a direction of $U$ that meets a vertex of $P$ also meets another vertex of $P$. We characterize…

Metric Geometry · Mathematics 2009-08-05 Christian Huck

A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…

Metric Geometry · Mathematics 2007-05-23 Chaim Goodman-Strauss , John M Sullivan

Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…

Computational Geometry · Computer Science 2021-07-02 David Eppstein

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

Combinatorics · Mathematics 2007-05-23 Jeff Erickson

The concepts of symmetry and symmetry groups are at the heart of several developments in modern theoretical and mathematical physics. The present paper is devoted to a number of selected topics within this framework: Euclidean and rotation…

Mathematical Physics · Physics 2007-05-23 Giampiero Esposito , Giuseppe Marmo

We build polyhedral complexes in Rn that coincide with dyadic grids with different orientations, while keeping uniform lower bounds (depending only on n) on the flatness of the added polyhedrons including their subfaces in all dimensions.…

Metric Geometry · Mathematics 2009-06-18 Vincent Feuvrier

For a family $\mathcal{C}$ of properly embedded curves in the 2-dimensional disk $\mathbb{D}^{2}$ satisfying certain uniqueness properties, we consider convex polygons $P\subset \mathbb{D}^{2}$ and define a metric $d$ on $P$ such that…

Metric Geometry · Mathematics 2023-11-13 Charalampos Charitos , Ioannis Papadoperakis , Georgios Tsapogas

This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis-aligned) voxels. We analyze the ways in which the skeleton…

Computational Geometry · Computer Science 2008-05-02 Gill Barequet , David Eppstein , Michael T. Goodrich , Amir Vaxman

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

Combinatorics · Mathematics 2026-02-20 Torben Donzelmann , Thiago Holleben , Martina Juhnke

For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…

Metric Geometry · Mathematics 2018-05-01 Yohji Akama , Bobo Hua , Yanhui Su

There are two main thrusts in the theory of regular and chiral polytopes: the abstract, purely combinatorial aspect, and the geometric one of realizations. This brief survey concentrates on the latter. The dimension of a faithful…

Metric Geometry · Mathematics 2007-05-23 Peter McMullen , Egon Schulte

A regular polyhedron of type {p, q} has at least 2pq flags, and it is called tight if it has exactly 2pq flags. The values of p and q for which there exist tight orientably regular polyhedra were previously known. We determine for which…

Combinatorics · Mathematics 2016-04-12 Gabe Cunningham , Daniel Pellicer

In two series of papers we construct quasi regular polyhedra and their duals which are similar to the Catalan solids. The group elements as well as the vertices of the polyhedra are represented in terms of quaternions. In the present paper…

Mathematical Physics · Physics 2015-05-19 Mehmet Koca , Nazife Ozdes Koca , Ramazan Koc

Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer , Aaron M. Bruening , Joshua Stewart

We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…

Rings and Algebras · Mathematics 2024-08-20 Gustavo Granja , Aleksandar Milivojevic

We study a class of mechanisms known as Kokotsakis polyhedra with a quadrangular base. These are $3\times3$ quadrilateral meshes whose faces are rigid bodies and joined by hinges at the common edges. In contrast to existing work, the…

Algebraic Geometry · Mathematics 2026-03-09 Yang Liu

We study the space of holomorphic discs with boundary on a surface in a real 2-dimensional vector bundle over a compact 2-manifold. We prove that, if the ambient 4-manifold admits a fibre-preserving transitive holomorphic action, then a…

Analysis of PDEs · Mathematics 2020-11-19 Brendan Guilfoyle , Wilhelm Klingenberg

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

Computational Geometry · Computer Science 2016-08-12 David Eppstein , Elena Mumford
‹ Prev 1 3 4 5 6 7 10 Next ›