Hamiltonian tetrahedralizations with Steiner points
暂无分享,去创建一个
[1] Jorge Urrutia,et al. Graham triangulations and triangulations with a center are hamiltonean , 2005, Inf. Process. Lett..
[2] David Avis,et al. Triangulating point sets in space , 1987, Discret. Comput. Geom..
[3] Reuven Bar-Yehuda,et al. Time/space tradeoffs for polygon mesh rendering , 1996, TOGS.
[4] H. Whitney. Congruent Graphs and the Connectivity of Graphs , 1932 .
[5] H. Hahn. Encyklopädie der mathematischen Wissenschaften , 1928 .
[6] Steven Skiena,et al. Hamiltonian triangulations for fast rendering , 1996, The Visual Computer.
[7] Tait. 4. On the Colouring of Maps. , 1880 .
[8] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[9] J. Petersen. Die Theorie der regulären graphs , 1891 .
[10] Brendan D. McKay,et al. Nonhamiltonian 3-Connected Cubic Planar Graphs , 2000, SIAM J. Discret. Math..
[11] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[12] Francis Chin,et al. On Hamiltonian Tetrahedralizations Of Convex Polyhedra , 2005 .
[13] Erik D. Demaine,et al. The Open Problems Project , 2007 .
[14] W. T. Tutte. On Hamiltonian Circuits , 1946 .
[15] Brendan D. McKay,et al. The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices , 1988, J. Comb. Theory, Ser. B.