Released: August 11, 2012
|
Added: August 11, 2012 | Visits: 374
For any convex polyhedral metric on the sphere there exists a unique convex polytope that has this metric on its boundary. Alexandrov Polyhedron Editor is a small application written in Java that can build a convex polytope from a given development.
Usage: In the left half of the window draw a...
Platforms: Windows
Released: December 11, 2012
|
Added: December 11, 2012 | Visits: 262
A renderer for regular polytopes of arbitrary dimension.
Platforms: Windows, Mac, Linux
Added: June 04, 2013 | Visits: 473
Matlab Toolbox for Submodular Function Optimization (v 2.0)By Andreas Krause (krausea@gmail.com).Slides, videos and detailed references available at http://www.submodularity.orgTested in MATLAB 7.0.1 (R14), 7.2.0 (R2006a), 7.4.0 (R2007a, MAC), 7.9.0 (MAC)This toolbox provides functions for...
Platforms: Matlab
Added: September 04, 2013 | Visits: 295
CPRND draws samples from the uniform distribution over the interior of a polytope defined by a system of linear inequalities Ax < b using the hit-and-run sampler.
Platforms: Matlab
| License: Shareware |
Cost: $0.00 USD |
Size: 10 KB | Download (50): cprnd Download |
Added: July 15, 2013 | Visits: 439
CON2VERT - convert a convex set of constraint inequalities into the set of vertices at the intersections of those inequalities;i.e., solve the "vertex enumeration" problem.V = con2vert(A,b)Converts the polytope (convex polygon, polyhedron, etc.) defined by the system of inequalities A*x = n (m...
Platforms: Matlab
Windows Software
Albina Merfyn - I find this to be really easy to use. I can...
