Compute the incidence map of this polyhedron.
iMap = P.incidenceMap
iMap = incidenceMap(P)
P |
Polyhedron in any format Class: Polyhedron |
iMap |
Incidence map or [] is ![]() Class: struct |
iMap.V |
Vertices of ![]() |
iMap.R |
Rays of ![]() |
iMap.H |
Inequalities of ![]() |
iMap.He |
Equalities of ![]() |
iMap.incVH |
Incidence of ![]() Class: sparse logical |
iMap.incRH |
Incidence of ![]() Class: sparse logical |
P = ExamplePoly.poly3d_sin
Polyhedron in R^2 with representations: H-rep (redundant) : Inequalities 13 | Equalities 0 V-rep : Unknown (call computeVRep() to compute) Functions : noneCompute the incidence map
iMap = P.incidenceMap; full(iMap.incVH)
ans = 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0
◀ | project | isbounded | ▶ |
© 2010-2013 Colin Neil Jones: EPF Lausanne, colin.jones@epfl.ch