WOLFRAM

Wolfram Language & System Documentation Center

ConvexPolyhedronQ[poly]

gives True if the polyhedron poly is convex, and False otherwise.

Details
Details and Options Details and Options
Examples  
Basic Examples  
Scope  
Properties & Relations  
Possible Issues  
See Also
Related Guides
History
Cite this Page

ConvexPolyhedronQ

ConvexPolyhedronQ[poly]

gives True if the polyhedron poly is convex, and False otherwise.

Details

  • A polyhedron is convex if no line segment between two points ever goes outside the polyhedron.

Examples

open all close all

Basic Examples  (2)

Test whether a polyhedron is convex:

Wolfram Language code: 𝒫 = Polyhedron[{{-Sqrt[1 + 2/Sqrt[5]], 0, Root[1 - 20*#1^2 + 80*#1^4 & , 3, 0]}, {Sqrt[1 + 2/Sqrt[5]], 0, Root[1 - 20*#1^2 + 80*#1^4 & , 2, 0]}, {Root[1 - 20*#1^2 + 80*#1^4 & , 1, 0], (-3 - Sqrt[5])/4, Root[1 - 20*#1^2 + 80*#1^4 & , 3, 0]}, {R ... {{15, 10, 9, 14, 1}, {2, 6, 12, 11, 5}, {5, 11, 7, 3, 19}, {11, 12, 8, 16, 7}, {12, 6, 20, 4, 8}, {6, 2, 13, 18, 20}, {2, 5, 19, 17, 13}, {4, 20, 18, 10, 15}, {18, 13, 17, 9, 10}, {17, 19, 3, 14, 9}, {3, 7, 16, 1, 14}, {16, 8, 4, 15, 1}}];
Wolfram Language code: ConvexPolyhedronQ[𝒫]
Wolfram Language code: Graphics3D[𝒫]

ConvexPolyhedronQ gives False for non-convex polyhedrons:

Wolfram Language code: 𝒫 = Polyhedron[{{-1.3763819204711736, 0., 0.2628655560595668}, {1.3763819204711736, 0., -0.2628655560595668}, {-0.42532540417601994, -1.3090169943749475, 0.2628655560595668}, {-0.42532540417601994, 1.3090169943749475, 0.2628655560595668}, {0. ... }, {11, 16, 7}, {6, 8, 12}, {4, 8, 6}, {4, 6, 20}, {13, 6, 2}, {6, 13, 18}, {18, 20, 6}, {2, 5, 19}, {19, 17, 13, 2}, {15, 10, 9, 14, 1}, {4, 20, 18, 10, 15}, {18, 13, 17, 9, 10}, {17, 19, 3, 14, 9}, {3, 7, 16, 1, 14}, {16, 8, 4, 15, 1}}];
Wolfram Language code: ConvexPolyhedronQ[𝒫]
Wolfram Language code: Graphics3D[𝒫]

Scope  (3)

ConvexPolyhedronQ works on polyhedrons:

Wolfram Language code: 𝒫 = Polyhedron[{{-Sqrt[1 + 2/Sqrt[5]], 0, Root[1 - 20*#1^2 + 80*#1^4 & , 3, 0]}, {Sqrt[1 + 2/Sqrt[5]], 0, Root[1 - 20*#1^2 + 80*#1^4 & , 2, 0]}, {Root[1 - 20*#1^2 + 80*#1^4 & , 1, 0], (-3 - Sqrt[5])/4, Root[1 - 20*#1^2 + 80*#1^4 & , 3, 0]}, {R ... {{15, 10, 9, 14, 1}, {2, 6, 12, 11, 5}, {5, 11, 7, 3, 19}, {11, 12, 8, 16, 7}, {12, 6, 20, 4, 8}, {6, 2, 13, 18, 20}, {2, 5, 19, 17, 13}, {4, 20, 18, 10, 15}, {18, 13, 17, 9, 10}, {17, 19, 3, 14, 9}, {3, 7, 16, 1, 14}, {16, 8, 4, 15, 1}}];
Wolfram Language code: ConvexPolyhedronQ[𝒫]
Wolfram Language code: Region[𝒫]

Cube:

Wolfram Language code: ConvexPolyhedronQ[Cube[]]

Dodecahedron:

Wolfram Language code: ConvexPolyhedronQ[Dodecahedron[]]

Tetrahedron:

Wolfram Language code: ConvexPolyhedronQ[Tetrahedron[]]

Polyhedron with holes:

Wolfram Language code: Polyhedron[{{0, 0, 0}, {0, 3, 0}, {3, 3, 0}, {3, 0, 0}, {0, 0, 3}, {0, 3, 3}, {3, 3, 3}, {3, 0, 3}, {1, 1, 1}, {1, 2, 1}, {2, 2, 1}, {2, 1, 1}, {1, 1, 2}, {1, 2, 2}, {2, 2, 2}, {2, 1, 2}}, {{2, 3, 4, 1}, {1, 4, 8, 5}, {4, 3, 7, 8}, {3, 2, 6, 7}, {2, 1, 5, 6}, {5, 8, 7, 6}} -> {{{10, 11, 12, 9}, {9, 12, 16, 13}, {12, 11, 15, 16}, {11, 10, 14, 15}, {10, 9, 13, 14}, {13, 16, 15, 14}}}];
Wolfram Language code: ConvexPolyhedronQ[%]

Polyhedron with disconnected components:

Wolfram Language code: 𝒫 = Polyhedron[{{0, 0, 0}, {1, 0, 0}, {0, 1, 0}, {0, 0, 1}, {1, 1, 1}, {2, 1, 1}, {1, 2, 1}, {1, 1, 2}}, {{{1, 2, 3}, {1, 2, 4}, {2, 3, 4}, {1, 3, 4}}, {{5, 6, 7}, {5, 6, 8}, {6, 7, 8}, {5, 7, 8}}}]
Wolfram Language code: ConvexPolyhedronQ[𝒫]

Properties & Relations  (3)

A convex polyhedron is simple:

Wolfram Language code: 𝒫 = Polyhedron[{{0, 0, 0}, {1, 0, 0}, {0, 1, 0}, {0, 0, 1}}, {{1, 2, 3}, {1, 2, 4}, {2, 3, 4}, {1, 3, 4}}];
Wolfram Language code: ConvexPolyhedronQ[𝒫]
Wolfram Language code: SimplePolyhedronQ[𝒫]

The OuterPolyhedron of a convex polyhedron is convex:

Wolfram Language code: 𝒫 = Polyhedron[{{0, 0, 0}, {1, 0, 0}, {0, 1, 0}, {0, 0, 1}}, {{1, 2, 3}, {1, 2, 4}, {2, 3, 4}, {1, 3, 4}}];
Wolfram Language code: ConvexPolyhedronQ[𝒫]
Wolfram Language code: ConvexPolyhedronQ[OuterPolyhedron[𝒫]]

Convex polyhedrons do not have holes:

Wolfram Language code: InnerPolyhedron[𝒫]

The UniformPolyhedron is convex:

Wolfram Language code: UniformPolyhedron[{3, 5}]
Wolfram Language code: ConvexPolyhedronQ[%]

Possible Issues  (1)

For nonconstant polyhedron, ConvexPolyhedronQ returns False:

Wolfram Language code: poly = Polyhedron[{{a, b, c}, {d, e, f}, {0, 1, 0}, {0, 0, 1}}, {{1, 2, 3}, {1, 2, 4}, {2, 3, 4}, {1, 3, 4}}];
Wolfram Language code: ConstantRegionQ[poly]
Wolfram Language code: ConvexPolyhedronQ[poly]
Wolfram Research (2019), ConvexPolyhedronQ, Wolfram Language function, https://reference.wolfram.com/language/ref/ConvexPolyhedronQ.html.

Text

Wolfram Research (2019), ConvexPolyhedronQ, Wolfram Language function, https://reference.wolfram.com/language/ref/ConvexPolyhedronQ.html.

CMS

Wolfram Language. 2019. "ConvexPolyhedronQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/ConvexPolyhedronQ.html.

APA

Wolfram Language. (2019). ConvexPolyhedronQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/ConvexPolyhedronQ.html

BibTeX

@misc{reference.wolfram_2026_convexpolyhedronq, author="Wolfram Research", title="{ConvexPolyhedronQ}", year="2019", howpublished="\url{https://reference.wolfram.com/language/ref/ConvexPolyhedronQ.html}", note=[Accessed: 13-June-2026]}

BibLaTeX

@online{reference.wolfram_2026_convexpolyhedronq, organization={Wolfram Research}, title={ConvexPolyhedronQ}, year={2019}, url={https://reference.wolfram.com/language/ref/ConvexPolyhedronQ.html}, note=[Accessed: 13-June-2026]}