Dissection of the path-simplex in R-n into n path-subsimplices
暂无分享,去创建一个
[1] Miroslav Fiedler,et al. Über qualitative Winkeleigenschaften der Simplexe , 1957 .
[2] Miroslav Fiedler. Geometrie simplexu v $E_n$. I. , 1954 .
[3] H. Hadwiger. Vorlesungen über Inhalt, Oberfläche und Isoperimetrie , 1957 .
[4] David Eppstein,et al. Dihedral bounds for mesh generation in high dimensions , 1995, SODA '95.
[5] Sergey Korotov,et al. Global and local refinement techniques yielding nonobtuse tetrahedral partitions , 2005 .
[6] H. Coxeter,et al. Trisecting an orthoscheme , 1989 .
[7] K. Tschirpke. On the dissection of simplices into orthoschemes , 1993 .
[8] G. Leng. The minimum number of acute dihedral angles of a simplex , 2003 .
[9] Willem H. Haemers. Matrices and Graphs , 2005 .
[10] V. T. Rajan,et al. Optimality of the Delaunay triangulation in Rd , 1991, SCG '91.
[11] Miroslav Fiedler,et al. MATRICES AND GRAPHS IN EUCLIDEAN GEOMETRY , 2005 .
[12] V. T. Rajan. Optimality of the Delaunay triangulation in ℝd , 1994, Discret. Comput. Geom..