Return to global_dynamic_triangulation.ads CVS log

Up to [local] / OpenXM_contrib / PHC / Ada / Root_Counts / Dynlift

Annotation of OpenXM_contrib/PHC/Ada/Root_Counts/Dynlift/global_dynamic_triangulation.ads, Revision 1.1.1.1

1.1       maekawa     1: with Standard_Integer_Vectors;           use Standard_Integer_Vectors;
                      2: with Lists_of_Integer_Vectors;           use Lists_of_Integer_Vectors;
                      3: with Simplices,Triangulations;           use Simplices,Triangulations;
                      4:
                      5: package Global_Dynamic_Triangulation is
                      6:
                      7: -- DESCRIPTION :
                      8: --   This package contains some global aspects of the dynamic lifting
                      9: --   algorithm applied to the unmixed case.
                     10:
                     11:   procedure Initial_Simplex ( pts : in List; order : in boolean;
                     12:                               s : out Simplex; rest : in out List );
                     13:
                     14:   -- DESCRIPTION :
                     15:   --   Searches for an initial simplex of the triangulation of the
                     16:   --   list of points pts.
                     17:
                     18:   -- ON ENTRY :
                     19:   --   pts       a list of integer vectors;
                     20:   --   order     if true, then the first n+1 points of the list will be
                     21:   --             considered first for the construction of the initial cell.
                     22:
                     23:   -- ON RETURN :
                     24:   --   s         an initial simplex, if Volume(s) = 0, then Volume(pts) = 0,
                     25:   --             the lifting values of the initial cell are all zero;
                     26:   --   rest      the rest of the points: pts - s.
                     27:
                     28:   function Max_Extreme ( l : List; k : natural ) return Link_to_Vector;
                     29:
                     30:   -- DESCRIPTION :
                     31:   --   Returns the vector in the list l with the maximal kth component.
                     32:
                     33:   function Max_Extreme ( l : List; weights : vector ) return Link_to_Vector;
                     34:
                     35:   -- DESCRIPTION :
                     36:   --   Return the element in l for which the weighted sum is maximal.
                     37:
                     38:   function Max_Extreme ( l : List; n : natural; low,upp : integer )
                     39:                        return Link_to_Vector;
                     40:
                     41:   -- DESCRIPTION :
                     42:   --   Generates first a vector with n random weights, in between low and upp,
                     43:   --   and gives the maximal extreme w.r.t. this weighted sum.
                     44:
                     45: end Global_Dynamic_Triangulation;