• # cdd

• Referenced in 115 articles [sw00114]
• extreme rays of a general convex polyhedron given by a system of linear inequalities ... linear inequality representation of a convex polyhedron given as the Minkowski sum of the convex ... input for hull computation: the polyhedron must be full-dimensional. Besides these basic functions, cdd/cdd ... maximize (or minimize) a linear function over polyhedron . It is useful mainly for solving dense...
• # Convex

• Referenced in 33 articles [sw07770]
• finitely many points and rays. A bounded polyhedron is also called a polytope ... package, polyhedra are represented by the type POLYHEDRON and polytopes by the subtype POLYTOPE ... POLYHEDRON may contain lines and may not be full-dimensional. The most important functions ... define a POLYHEDRON are convhull and intersection. The linear setting is based on cones, which...
• # Pcp2Nurb

• Referenced in 18 articles [sw00689]
• corners, the smoothing of an unrestricted control polyhedron can be reduced to the smoothing ... planar-cut polyhedron. A planar-cut polyhedron is a generalization of the well-known tensor ... nine-point subnet of a planar-cut polyhedron, the routine outputs a trimmed bicubic NURBS ... geometrically redundant edges in the planar-cut polyhedron. The resulting surface follows the outlines...
• # CHABIS

• Referenced in 19 articles [sw00119]
• system within an n-dimensional polyhedron. Then, it applies a new generalized method of bisection ... this n-polyhedron in order to obtain an approximate solution of the system according...
• # PipLib

• Referenced in 19 articles [sw23763]
• integer points belonging to a convex polyhedron. The very big difference with well known integer ... like lp_solve or CPLEX is the polyhedron may depend linearly on one or more...
• # cddplus

• Referenced in 13 articles [sw04443]
• extreme rays of a general convex polyhedron in R^d given by a system ... vertex and ray) representation of a polyhedron with cdd+. Also, cdd+ can solve a linear...
• # PPROJ

• Referenced in 9 articles [sw21258]
• Projection onto a polyhedron that exploits sparsity. An algorithm is developed for projecting a point ... onto a polyhedron. The algorithm solves a dual version of the projection problem and then ... approximately identify active constraints in the polyhedron, and the dual active set algorithm (DASA...
• # Kaleido

• Referenced in 8 articles [sw05940]
• Uniform solution for uniform polyhedra. A uniform polyhedron in 3-dimensional space has faces which ... without the need to consider each polyhedron on individually. The basic idea is to work ... which can usually be associated with the polyhedron, and obtain simultaneously the edge-length ... given circumradius) and dihedral angles. Only one polyhedron does not fit into this...
• # PolySCIP

• Referenced in 2 articles [sw15158]
• there is none) and a weight space polyhedron created. In every next iteration a vertex ... weight space polyhedron is selected whose entries yield a single-objective optimization problem ... point, the weight space polyhedron is updated. Otherwise another vertex of the weight space polyhedron ... vertices of the weight space polyhedron have been investigated and no update steps...
• # polyhedra

• Referenced in 2 articles [sw21168]
• module of Sage. In this module, a polyhedron is a convex (possibly unbounded ... equations. Note that the dimension of the polyhedron can be less than the dimension...
• # OldPolyhedra

• Referenced in 2 articles [sw27525]
• polyhedra, cones, and fans. A rational convex Polyhedron is the intersection of finitely many affine ... FourierMotzkin package by Gregory G. Smith. Each polyhedron or cone is saved in both descriptions...