The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation
暂无分享,去创建一个
[1] Erik D. Demaine,et al. The Open Problems Project , 2007 .
[2] Joseph S. B. Mitchell,et al. Computing Geometric Structures of Low Stabbing Number in the Plane ∗ , 2007 .
[3] W. Marsden. I and J , 2012 .
[4] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[5] Mark de Berg,et al. Rectilinear Decompositions with Low Stabbing Number , 1994, Inf. Process. Lett..
[6] Aminadab Pereira Nunes,et al. Uma abordagem de programação inteira para o problema da triangulação de custo minimo , 1997 .
[7] Csaba D. Tóth. Orthogonal Subdivisions with Low Stabbing Numbers , 2005, WADS.
[8] Matthew Dickerson,et al. A (usually?) connected subgraph of the minimum weight triangulation , 1996, SCG '96.
[9] Jack Snoeyink,et al. Implementations of the LMT heuristic for minimum weight triangulation , 1998, SCG '98.
[10] G. Nemhauser,et al. Integer Programming , 2020 .
[11] Niklaus Wirth,et al. Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.
[12] Jonathan Richard Shewchuk. Stabbing Delaunay Tetrahedralizations , 2004, Discret. Comput. Geom..
[13] Subhash Suri,et al. Stabbing triangulations by lines in 3D , 1995, SCG '95.
[14] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[15] Sándor P. Fekete,et al. Minimizing the Stabbing Number of Matchings, Trees, and Triangulations , 2003, SODA '04.
[16] M. Guignard. Lagrangean relaxation , 2003 .