Changeset 6b5e56 in git

Timestamp:

Sep 30, 2016, 3:17:04 PM (8 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')

Children:

5d51cc663dae53ce9fbf7b3e9c6d91552065e9ee

Parents:

a7cb003033a5f0d241c506361d12833f4c05be5d

Message:

doc: references

Location:

Singular/LIB

Files:

• normal.lib (modified) (1 diff)
• polymakeInterface.lib (modified) (1 diff)

Singular/LIB/normal.lib

@@ -7 +7 @@
 @*        S. Laplagne,   slaplagn@dm.uba.ar,
 @*        G. Pfister,    pfister@mathematik.uni-kl.de
+@*        Peter Chini,   chini@rhrk.uni-kl.de (normalConductor)
 
 

Singular/LIB/polymakeInterface.lib

@@ -959 +959 @@
 }
 
-proc polytopeViaPoints()
-"USAGE: polytopeViaPoints(V [, flags]);  intmat V, int flags
-RETURN: polytope which is the intersection of the cone generated by the row vectors
-of V with the hyperplane, in which the first coordinate equals 1;
-flags may be 0 or 1,@*
-if flags is 1, then program assumes that each row vector of M generates a ray in the cone,
-if flags is 0, then program computes that information itself
-EXAMPLE: example polytopeViaPoints; shows an example
-"
-{
-
-}
-example
-{
-  "EXAMPLE:"; echo = 2;
-  // This is a polytope in R^2 generated by (0,0), (1,0), (0,1), (0,0);
-  intmat V[4][3]=
-  1,0,0,
-  1,1,0,
-  1,0,1,
-  1,1,1;
-  polytope p1=polytopeViaPoints(V);
-  p1;
-  // This is a polytope in R^2 generated by (1/2,2/3), (3/4,4/5), (5/6,6/7):
-  intmat V[3][3]=
-  6,3,4,
-  20,15,16,
-  42,35,36;
-  polytope p2=polytopeViaPoints(V);
-  p2;
-  // This polytope is the positive orthant in R^2:
-  // (0,1,0) and (0,0,1) imply that the polytope is unbounded in that direction
-  intmat V[3][3]=
-  1,0,0,
-  0,1,0,
-  0,0,1;
-  polytope p3=polytopeViaPoints(V);
-  p3;
-}
-
-proc polytopeViaInequalities()
-"USAGE: polytopeViaInequalities(EV [, E [, flags]]);  intmat EV,E, int flags
-RETURN: polytope consisting of all points x, such that IE*x >= 0 in each component
-and (if stated) E*x = 0;
-flags may range between 0,..,3 defining an upper and lower bit
-(0=0*2+0, 1=0*2+1, 2=1*2+0, 3=1*2+1),
-if higher bit is 1, then program assumes each inequality yields a facet,
-if lower bit is 1, then program assumes the kernel of E is the span of the cone,
-if either bit is 0, then program computes the information itself.
-EXAMPLE: example polytopeViaPoints; shows an example
-"
-{
-
-}
-example
-{
-  "EXAMPLE:"; echo = 2;
-  intmat IE[2][3]=
-  1,0,0,
-  0,1,0;
-  intmat E[1][3]=
-  0,0,1;
-  polytope p=polytopeViaInequalities(IE,E);
-  p;
-}
-
 proc vertexAdjacencyGraph()
 "USAGE:   vertexAdjacencyGraph(p);  p polytope