Optimality and integer programming formulations of triangulations in general dimension

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1533 LNCS, Issue , 1998, Pages 377-387

  Tajima, Akira ^a,b  

^a IBM RESEARCH   (United States)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

TRIANGULATION;

COMPUTATIONAL RESULTS; INTEGER PROGRAMMING FORMULATIONS; OBJECTIVE FUNCTIONS; OPTIMALITY; SET PARTITIONING PROBLEM; STABLE SET PROBLEMS; THREE DIMENSIONS;

INTEGER PROGRAMMING;

EID: 84867469507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_40     Document Type: Conference Paper

References (16)

1. T. V. Alekseyevskaya. Combinatorial bases in systems of simplices and chambers. Discrete Mathematics, 157:15-37, 1996.
2. E. Balas and J. Xue. Minimum weighted coloring of triangulated graphs, with application to maximum weighted vertex packing and clique finding in arbitrary graphs. SIAM Journal of Computing, 20(2):209-221, 1991.
3. I. Bárány and Z. Füredi. Empty simplices in Euclidian spaces. Canad. Math. Bull., 30:436-445, 1987.
4. M. Bern, P. Chew, D. Eppstein, and J. Ruppert. Dihedral bounds for mesh generation in high dimensions. In 6th ACM-SIAM Symp. Discrete Algorithms, pages 189-196, 1995.
5. M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In Computing in Euclidean Geometry, volume 4 of Lecture Notes Series on Computing, pages 47-123. World Scientific, 2nd edition, 1995.
6. CGAL. http://www.cs.ruu.nl/CGAL/.
7. J. A. De Loera, S. Hosten, F. Santos, and B. Sturmfels. The polytope of all triangulations of a point configuration. Documenta Mathematica, 1:103-119, 1996.
8. DeWall. http://miles.cnuce.cnr.it/cg/swOnTheWeb.html.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
10. H. Imai and K. Imai. Triangulation and convex polytopes. In RIMS Kokyuroku, pages 149-166. Research Institute for Mathematical Sciences, Kyoto University, 1996. (in Japanese).
11. Y. Kyoda, K. Imai, F. Takeuchi, and A. Tajima. A branch-and-cut approach for minimum weight triangulation. In Proceedings of the 8th Annual International Symposium on Algorithms and Computation (ISAAC '97), volume 1350 of Lecture Notes in Computer Science, pages 384-393. Springer Verlag, 1997.
12. d. In Proc. 7th ACM Symp. Computational Geometry, pages 357-363, 1991.
13. J. Ruppert and R. Seidel. On the difficulty of triangulating three-dimensional nonconvex polyhedra. Discrete & Computational Geometry, 7:227-253, 1992.
14. K. Shimada. Physically-based automatic mesh generation. Simulation, 12(1):11-20, 1993. (in Japanese).
15. P. Shirley and A. Tuchman. A polygonal approximation to direct scalar volume rendering. Computer Graphics, 24(5):63-70, 1990.
16. Triangle. http://www.cs.cmu.edu/~quake/triangle.research.html.