On Polyhedral Realization with Isosceles Triangles

08/31/2020
by   David Eppstein, et al.
0

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 triangle. Our construction is based on Kleetopes, and shows that there exists an integer i such that all convex i-iterated Kleetopes have a scalene face. However, we also show that all Kleetopes of triangulated polyhedral graphs have non-convex non-self-crossing realizations in which all faces are isosceles. We answer another question of Malkevitch by observing that a spherical tiling of Dawson (2005) leads to a fourth infinite family of convex polyhedra in which all faces are congruent isosceles triangles, adding one to the three families previously known to Malkevitch. We prove that the graphs of convex polyhedra with congruent isosceles faces have bounded diameter and have dominating sets of bounded size.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/21/2021

Recolouring weakly chordal graphs and the complement of triangle-free graphs

For a graph G, the k-recolouring graph ℛ_k(G) is the graph whose vertice...
research
08/20/2020

Solving problems on generalized convex graphs via mim-width

A bipartite graph G=(A,B,E) is H-convex, for some family of graphs H, if...
research
10/21/2021

Convex Hull Escape Perturbation at Embedding Space and Spherical Bins Coloring for 3D Face De-identification

This paper proposes a Convex Hull Escape Perturbation (CHEP) method at E...
research
04/30/2021

Formalizing the Face Lattice of Polyhedra

Faces play a central role in the combinatorial and computational aspects...
research
12/03/2017

An algorithm to reconstruct convex polyhedra from their face normals and areas

A well-known result in the study of convex polyhedra, due to Minkowski, ...
research
12/02/2022

Disjoint faces in simple drawings of the complete graph and topological Heilbronn problems

Given a complete simple topological graph G, a k-face generated by G is ...
research
07/28/2020

Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra

We present new examples of topologically convex edge-ununfoldable polyhe...

Please sign up or login with your details

Forgot password? Click here to reset