Triangulations (tilings) and certain block triangular matrices
Technical Report
·
OSTI ID:5590921
The problem is to find a tiling (triangularization) of a convex n polytope (or combinatorially an n-gon) such that the partition uses the minimum number of tiles. We show that a certain linear program can be formulated whose optimal solution is always in integers and corresponds to a tiling. Moreover the system is in the form of a block-triangular Leontief-Substitution System that is readily solved by a O(n/sup 3/) algorithm consisting of a single forward and backward pass through data.
- Research Organization:
- Stanford Univ., CA (USA). Dept. of Operations Research
- DOE Contract Number:
- AT03-76ER72018
- OSTI ID:
- 5590921
- Report Number(s):
- SOL-83-17; ON: DE84003579
- Country of Publication:
- United States
- Language:
- English
Similar Records
On the Minimum Weight Steiner Triangular Tiling problem
Quasi-greedy triangulations approximating the minimum weight triangulation
Theorem about antiprisms
Conference
·
Fri Mar 31 23:00:00 EST 1995
·
OSTI ID:62614
Quasi-greedy triangulations approximating the minimum weight triangulation
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416823
Theorem about antiprisms
Technical Report
·
Mon Aug 01 00:00:00 EDT 1983
·
OSTI ID:5517308