Return to READ_ME CVS log

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

Annotation of OpenXM_contrib/PHC/Ada/Root_Counts/Dynlift/READ_ME, Revision 1.1.1.1

1.1       maekawa     1: Mixed-volume computation & polyhedral continuation by dynamic lifting in PHCv2.
                      2:
                      3: The aim of dynamic lifting is to control the heights of the lifting values,
                      4: to obtain a stable evaluation of the polyhedral homotopy.
                      5:
                      6: When all supports are equal, then the mixed volume is reduced to an
                      7: ordinary volume, which is computed by a regular triangulation.
                      8:
                      9: 1. Dynamic construction of regular triangulations :
                     10: 2. The Cayley trick
                     11: 3. Dynamic construction of mixed subdivision
                     12: 4. The drivers and black-box computation
                     13:
                     14: --------------------------------------------------------------------------------
                     15: file name                        : short description
                     16: --------------------------------------------------------------------------------
                     17: simplices                        : simplices of integer polytopes
                     18: simplices_io                     : input/output of simplices
                     19: triangulations                   : triangulations of integer polytopes
                     20: triangulations_io                : input/output of triangulations
                     21: global_dynamic_triangulation     : global aspects of dynamic lifting
                     22: dynamic_lifting_functions        : dynamic lifting functions
                     23: dynamic_triangulations           : construction of placing triangulation
                     24: ts_dyntri                        : test on the construction of a triangulation
                     25: --------------------------------------------------------------------------------
                     26: cayley_embedding                 : embeds tuple in one support
                     27: cayley_trick                     : computing mixed subdivisions
                     28: minkowski_polynomials            : volume polynomials
                     29: driver_for_minkowski_polynomials : driver to the volume polynomials
                     30: ts_drivmink                      : calls the driver for volume polynomials
                     31: --------------------------------------------------------------------------------
                     32: common_faces_of_polytope         : computation of neighboring faces
                     33: enumerate_faces_of_polytope      : extract faces of a triangulation
                     34: face_structures                  : management of faces of triangulations
                     35: frequency_graph                  : computes occurencies of points in supports
                     36: initial_mixed_cell               : finds an initial mixed cell
                     37: flatten_mixed_subdivisions       : flattening of mixed subdivisions
                     38: unfolding_subdivisions           : re-lifting flattened parts of subdivisions
                     39: triangulations_and_subdivisions  : convert triangulations <> subdivisions
                     40: dynamic_mixed_subdivisions       : dynamic lifting in the mixed case
                     41: dynamic_polyhedral_continuation  : incremental polyhedral continuation
                     42: --------------------------------------------------------------------------------
                     43: drivers_for_dynamic_lifting      : menu-driver for dynamic lifting
                     44: ts_drivdynl                      : calls the menu-driver
                     45: black_mixed_volume_computations  : black-box polyhedral methods
                     46: babldmvc                         : calls the black-box mixed-volume computation
                     47: --------------------------------------------------------------------------------
                     48:
                     49: The Cayley trick is an efficient way to construct all cells in a mixed
                     50: subdivision with the corresponding Minkowksi polynomial.
                     51:
                     52: wc *adb counts 7493 lines of Ada code