Boris Abramovic Rosenfeld. Mutli-dimensional Spaces (in russian), chapter 5, pages 169--173. Nauka, Moscow, 1966. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Estimating the Useful Work Distribution of Parallel Programs.. - Fahringer (1996) (4 citations) (Correct)
....by a vertex, etc. Nothing has to be done for inside objects. The volume of a n dimensional polytope is computed by a triangulation of the corresponding polytope into a set of disjoint n dimensional convex simplices. A n dimensional convex simplex contains exactly n 1 vertices. According to [24] the volume of a n dimensional convex simplex is given by 1 n Det( v 2 Gamma v 1 ; v n 1 Gamma v 1 ) where fv 1 ; vn 1g is the set of vertices of the corresponding simplex. The sum of the volumes across all simplices of PO p defines the volume of PO p . The intersection ....
Boris Abramovic Rosenfeld. Mutli-dimensional Spaces (in russian), chapter 5, pages 169--173. Nauka, Moscow, 1966.
On Using Volume Computation to Estimate the Work Distribution .. - Fahringer, Hong (1995) (Correct)
....by a vertex, etc. Nothing has to be done for inside objects. The volume of a n dimensional polytope is computed by a triangulation of the corresponding polytope into a set of disjoint n dimensional convex simplices. A n dimensional convex simplex contains exactly n 1 vertices. According to [24] the volume of a n dimensional convex simplex is given by 1 n Det( v 2 Gamma v 1 ; v n 1 Gamma v 1 ) where fv 1 ; vn 1g is the set of vertices of the corresponding simplex. The sum of the volumes across all simplices of PO p defines the volume of PO p . The intersection ....
....PO in R n , then PO is a n dimensional linear and convex simplex, iff jOB 0 j = n 1. Theorem 4. 1 (Volume of a n dimensional convex and linear simplex) Let PO be a n dimensional convex and linear simplex in R n and OB 0 = fv 1 ; vn 1g the set of vertices of PO, then according to [24] the volume of PO is defined by a function volume : PO R 0 with volume(PO) 1 n Det( v 2 Gamma v 1 ; v n 1 Gamma v 1 ) For the computation of the determinant of a matrix we use an algorithm with O(n 3 ) complexity. This algorithm incorporates LU decomposition and is ....
Boris Abramovic Rosenfeld. Mutli-dimensional Spaces (in russian), chapter 5, pages 169--173. Nauka, Moscow, 1966.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC