Questions related to polyhedra and their properties.

learn more… | top users | synonyms

2
votes
1answer
33 views

maximal volume/diameter of polyhedron

I am trying to develop an integral in $R^n$ and I am faced with the following problem: Given a polyhedron $P$ in $R^n$ of diameter d, define the "compactness" of $P$ as the quotient of the volume of ...
1
vote
1answer
22 views

Dual of the Minkowski Sum

Suppose $X$ and $Y$ are convex sets in $\mathbb{R}^d$ such that the origin is in each of their interiors. Then the dual of $X$, $X'$ is defined as the set of linear functionals $\alpha$ such that ...
1
vote
0answers
14 views

Does it make sense to compare sets (polygons) with different dimensions?

In the context of integer programming, I am considering 3 different linear models for a given problem. The goal is to determine which formulation is the tightest, that is, the one that gives the least ...
0
votes
0answers
16 views

$\{x\in R^n | Ax \leq b\} \cap \{x \in R^n | Dx \leq d\}= \emptyset$ iff there is a vector $c \in R^n$ such that $c^Tx < c^T y$

Consider two non-empty polyhedra $P := \{x\in R^n | Ax \leq b\}$ and $Q := \{x \in R^n | Dx \leq d\}$. Show that $P \cap Q = \emptyset$ if and only if there is a vector $c \in R^n$ such that $c^Tx ...
1
vote
2answers
32 views

Construct a homemorphism $\phi : T^2/A \rightarrow X/B $

Construct a homemorphism $\phi : T^2/A \rightarrow X/B $ $T^2=S^1 \times S^1$ and $A \subset T^2$ is given by $A=S^1 \times\{1\}$. $X=S^1 \times [-1, 1]$ and $B = S^1 \times\{-1, 1\}$. ...
1
vote
2answers
28 views

Is a convex cone a convex polyhedron?

Say that I have a convex cone $C=\{t|Ax = t, x\geq 0\}$. where $x\in R^n$, and $t\in R^m$, $A\in R^m\times R^n$. Can I say that this is a convex polyhedron? and why? EDIT: Just in order to avoid ...
1
vote
0answers
13 views

Regular packing of an infinite number of infinitely long cylinders in 3d space

Is it possible to pack an infinite number of congruent infinitely long cylinders into 3 dimensional space in a regular pattern? Another condition is that an equal number of the cylinders must be ...
2
votes
2answers
39 views

Polygon with curved sides, and higher-dimensional generalizations

I am trying to find references about generalizations of polygons with non-straight sides. I am interested in both the convex and non-convex cases, and particularly in polynomial boundaries, and ...
0
votes
1answer
34 views

Find the edge angle of a dodecahedron using spherical trigonometry?

How can I find the edge angle (the angle at the center of a polyhedron subtended by an edge of the polyhedron) of a dodecahedron (a polyhedron with 3 pentagonal faces meeting at each vertex)? I know ...
-5
votes
1answer
70 views

Which Archimedean solid takes up the most volume in its circumscribed sphere? [closed]

I have a question that has really kept me wondering: Which Archimedean solid takes up the most volume in its circumscribed sphere?, meaning Which solid takes up the greatest percentage in its ...
1
vote
0answers
31 views

Simplest molecules with multiple local minima

Methane (C + 4 H) goes to a tetrahedral structure. Water (O + 2 H + 2 e-) goes to a slightly skewed tetrahedron. In a computer model, both of these have no local minimum problems. There is a ...
3
votes
0answers
33 views

Asymptotic bounds on the number of faces needed to construct a polyhedron of a certain genus

Let a polyhedron be a solid in three dimensions with flat polygonal faces, straight edges and sharp corners or vertices, where moreover we require that every edge touches exactly two faces, every ...
2
votes
0answers
20 views

How to construct a polyhedron from given planes

This seems to be a basic questions, but I really don't know a good computer algorithm to do this. I have a set of planes (parameterized by normal direction and distance from a given point), and I want ...
5
votes
0answers
31 views

Single loop polyhedra

The odd antiprisms are both Eulerian and polyhedral, with the first implying that the edge can be represented with a single closed path. The Cuboctahedron also has that property. With the rule to ...
0
votes
0answers
9 views

Estimate size of smallest solution to linear program

I have a linear program: a system of linear inequalities of the form $$Ax \le b, \qquad x \ge 0.$$ where $x \in \mathbb{R}^n$, $b \in \mathbb{R}^m$, and $A$ is a $m\times n$ matrix. I am looking ...
0
votes
0answers
21 views

Formal definition of a face of a polyhedron

Given an $n$-dimensional convex polyhedron, an $(n-1)$-dimensional face of it can be defined as an intersection of the polyhedron with a supporting hyperplane. What is the formal definition in the ...
0
votes
0answers
15 views

Number of Edges in Unimodular Triangulation of Simplex

Let $d\Delta$ be the simplex that's the convex hull of $(0, 0, 0, 0), (d, 0, 0, 0), (0, d, 0, 0), (0, 0, d, 0), (0, 0, 0, d)$. A unimodular triangulation of $d\Delta$ is a subdivision of it into ...
0
votes
0answers
62 views

Difference between invariant and contractive sets

I came across this particular notion of contractive sets. I know what an invariant set is, but can anyone explain what a contractive set is and the difference between invariant and contractive sets?
4
votes
1answer
92 views

Lower bound on the number of faces of a polyhedron of genus g

Is there a lower bound on the number of faces of a polyhedron of topological genus g? For example: it seems very reasonable that $g$ < $F$ i.e. the genus of a polehydron is less than the number ...
2
votes
0answers
15 views

Tracing the faces of a convex polyhedron from edges and vertices

I have a set of vertices and edges that by construction, form a convex polyhedron. I would like to know how to trace out the faces of such a polyhedron i.e. find a list comprised of set of edges that ...
3
votes
0answers
100 views

Polyhedra with identical faces

The isohedra have identical faces. They have symmetries acting transitively on their faces -- any face can be mapped to any other face to give the same figure. There are also polyhedra where all ...
2
votes
0answers
47 views

Polyhedra from number fields

A question on the disnub mentions golden ($x^2-x-1=0$) gives the dodecahedron + much more. tribonacci ($x^3-x^2-x-1=0$) gives the snub cube. plastic ($x^3-x-1=0$) gives the snub ...
1
vote
1answer
39 views

Polyhedra vs Polytope

I am having a hard time understanding what is the main difference between a polyhedron and a polytope. Could anyone explain me what is the difference between these two structures?
0
votes
0answers
15 views

The $d$-skeleton of a polytope is strongly connected

A polytope is the convex hull of a finite set of points in $\mathbb R^n$. The $d$-skeleton of a polytope is the set consisting of faces of dimension at most $d$. I would like to show that every ...
2
votes
0answers
54 views

Number of deltahedra as a function of the number of faces

How does the number of deltahedra (polyhedra with only equilateral triangles as faces) with no holes grow asymptotically as a function of the number of it's faces? If we have this as $N=g(F)$ for ...
16
votes
3answers
828 views

How many sewings are there on a soccer ball?

A soccer ball is obtained by sewing $20$ hexagonal pieces of leather and $12$ pieces of leather of pentagonal shape. A sewing joins together the sides of two adjacent pieces. How many sewings ...
5
votes
3answers
112 views

What is circumradius $R$ of the great disnub dirhombidodecahedron, or Skilling's figure?

The vertices of a uniform polyhedron all lie on a sphere. Out of curiosity, I looked at the circumradius $R$ of the $75$ polyhedra (non-prism) in the list (which assumed side $a=1$). For irrational ...
0
votes
0answers
13 views

Faces of a Bipyramid over a a Simplicial Polytope

Is there a simple way of expressing the number of faces of a bipyramid built over a polytope that is known to be simplicial, using the number of faces of the original polytope? This seems an easy ...
0
votes
0answers
7 views

Polyhedral Sets and $min$-function

I'm asked to verify if the following set is polyhedral, $$ X = \{[x_1;x_2]: min(x_1,x_2) \leq 0\}$$ Definition of a polyhedral set, A set $Y$ is polyhedral if $Y = \{y: Ay \leq b\}$, for finite ...
5
votes
0answers
69 views

Interesting cube subdivisions: what is going on here, and what are these polytopes?

I was messing around recently with a unit cube. If you draw vertices on the midpoint of each edge of the cube, then connect those points by new edges, you will form the wireframe of what I figured ...
0
votes
0answers
77 views

Intersecting rational polyhedral cones

Call A the cone generated by the rays (1,0,0) and (0,1,0) and B the cone generated by the rays (1,1,0),(1,0,1), and (0,1,1). I want to compute the intersection of these polyhedral cones, but I am ...
0
votes
1answer
29 views

Regular Triangulations of Cube

I want to figure out which triangulations of the cube (i.e., partitions into tetrahedra using only the $8$ given vertices) are regular, but I'm not sure how to easily tell whether a given ...
0
votes
0answers
12 views

Sphere inside cylinder vs polyhedra?

Comparing a cylinder with a polyhedra that has a symmetric coxeter $\ge 3$. Both have their centers hollowed out by $k\%$, in the shape of their outer, i.e.: relative to top face Which can better ...
0
votes
1answer
40 views

Is closed convex set with finite number of extreme points convex polyhedron

I have this simple question related to convex set and convex polyhedron. As the content in the title, it's basically my question: Is closed convex set with finite number of extreme points convex ...
0
votes
0answers
25 views

$OABCD$ tetrahedron with $OA ⊥ OB ⊥ OC ⊥ OA$

I've got stuck at this problem: Let $OABCD$ be a tetrahedron with $OA ⊥ OB ⊥ OC ⊥ OA$. If $OH$ is the orthocentre of triangle $ABC$, show that $OH$ is perpendicular on plan $(ABC)$. Then ...
1
vote
1answer
41 views

The limit of infinite truncations?

When a regular polyhedron is made to undergo repeated truncations, is there a solid that acts as a kind of limit for this iterated process? That is, say a cube is truncated N times. As N gets larger ...
13
votes
4answers
1k views

Volume of 1/2 using hull of finite point set with diameter 1

It's easy to bound a volume of a half. For example, the points $(0,0,0),(0,0,1),(0,1,0),(3,0,0)$ can do it. The problem is harder if no two points can be further than 1 apart. Bound a volume of 1/2 ...
5
votes
1answer
100 views

Possible all-Pentagon Polyhedra

If a polyhedron is made only of pentagons and hexagons, how many pentagons can it contain? With the assumption of three polygons per vertex, one can prove there are 12 pentagons. Let's not make that ...
1
vote
1answer
68 views

Topological surface covered by hexagons and heptagons

I've found an interesting exercice that I don't know how to approach. It goes like this. We have a topological space which is Hausdorff, compact, connected and locally homeomorphic to ...
0
votes
1answer
35 views

How many octahedrons in icosahedron

How many different ways can octahedron be inscribed in icosahedron so that all vertices of octahedron are selected vertices of icosahedron? Can it even be done? There are 4 edges in the middle of ...
13
votes
1answer
658 views

Any other Caltrops?

This question has been edited. The regular tetrahedron is a caltrop. When it lands on a face, one vertex points straight up, ready to jab the foot of anyone stepping on it. Define a caltrop as a ...
7
votes
2answers
267 views

Definition of a polyhedral region

I believe the following two conditions on a subset $S$ of $\mathbb{R}^3$ may be equivalent. I would like to know if they are equivalent, and where I can find either a counterexample or a proof of ...
4
votes
1answer
48 views

Simplest algorithm for edge coloring of a dodecahedron?

I have an origami model of a dodecahedron I am assembling. There are 30 edges with 3 colors of 10 each. I could use a diagram that gives a possible 3 color edge coloring. However, is there some sort ...
0
votes
0answers
25 views

Proof equivalence of equal dihedral angles and vertices on a sphere for regular polyhedra.

I know that the following theorem is true: Theorem: Provided that all faces of a polyhedron are regular poygons, the statement ``all the dihedral angles are congruent'' is equivalent to saying ...
1
vote
2answers
94 views

The relation between face counts and edge counts in a polyhedron, $3f_3 + 4f_4 + 5f_5 +\dots = 2E$

Why does $3f_3 + 4f_4 + 5f_5 + \dots = 2E$ hold for every polyhedron? Notation: $f_k$ is the number of faces with $k$ edges; $E$ is the total number of edges. Is there a specific proof for this or ...
3
votes
1answer
36 views

Measure of overall misfit between two polyhedra

Imagine I have two arbitrary polyhedrons with the same volume. How could one reasonably measure the misfit between them. E.g. how could one determine the minimum possible volume that they could not ...
0
votes
1answer
36 views

Polyhedron = polytope + polyhedral cone, how does it look graphically?

We have learned that a polyhedron is the sum of a polytope and a polyhedral cone, but how do you know this graphically? For example if you're a given polyhedron on paper and you have to determine ...
1
vote
1answer
31 views

Answer check, where did I go wrong with this plane geometry question?

Consider a regular tetrahedron with edge length one (four equilateral triangles joined edge to edge) call it $T$. Set $T$ on the $x,y$-plane with a vertex at the origin and an edge aligned with the ...
0
votes
0answers
16 views

bounding the hausdorff distance between a convex set and a template polytope.

How can we find an upper bound on the hausdorff distance between a convex set and its enclosing template polytope whose facets directions are given in advance?? Note that the bound should tend to zero ...
2
votes
1answer
30 views

Why don't Archimedean solids give finite subgroups of $SO(3,\Bbb R)$?

I know that the Platonic solids correspond to finite subgroups of $SO(3,\Bbb R)$. For example, the tetrahedron corresponds to a subgroup isomorphic to $A_4$. The cube and octahedron to one isomorphic ...