2
$\begingroup$

I am willing to find the number of faces and facets in a convex polyhedron. Suppose, in the cube polyhedron there exists $8$ vertices, $12$ edges, and $6$ faces. It satisfies the Euler equation as follows: $$ V - E + F = 2 ; \quad \text{where}\{v:\text{vertices}, e:\text{edges}, f: \text{faces}\}$$

Now, I would calculate this for a simple polytope: $P=\{x_1-x_2\leq0,\ -x_1+x_2\leq1,\ 2x_2\geq5,\ 8x_1-x_2\leq16,\ x_1+x_2\geq4,\ x\in\text{R}^2 \}$.

enter image description here

In this case, there are $3$ vertices as $\{(3/2, 5/2), (17/7, 24/7), (37/16,5/2) \}$, $3$ edges, and based on the mentioned Euler formulation it would have $2$ faces. Also, there are $3$ facets. What I am looking for is, how the number of faces is $2$?

$\endgroup$

2 Answers 2

3
$\begingroup$

The Euler equation was originally for polyhedra in three dimensions. When applied in two dimensions, it is for planar graphs (graphs with no edge crossings). Your example qualifies as a planar graph. A planar graph partitions the plane into regions (including the exterior of the graph), with each region termed a "face". See, for instance, http://discrete.openmathbooks.org/dmoi3/sec_planar.html. In your example, there are indeed two faces: the interior of the triangle and the exterior of the triangle.

$\endgroup$
1
  • $\begingroup$ Dear prof. Rubin, many thanks for your answer. I will check it and back if I have any issues. $\endgroup$
    – A.Omidi
    Commented Aug 10, 2022 at 4:37
0
$\begingroup$

For software for characterizing facets and/or extreme points of a polytope you might look at: http://porta.zib.de/

$\endgroup$
1
  • 1
    $\begingroup$ Could you share more details about how to use the tool? This would improve the answer. $\endgroup$ Commented Aug 10, 2022 at 16:44

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.