A polygonal approximation to direct scalar volume rendering
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Optimality of the Delaunay triangulation in Rd
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
On the difficulty of triangulating three-dimensional nonconvex polyhedra.
Discrete & Computational Geometry
Combinatorial bases in systems of simplices and chambers
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Dihedral bounds for mesh generation in high dimensions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Branch-and-Cut Approach for Minimum Weight Triangulation
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
On a linear program for minimum-weight triangulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
The properties of triangulations in two and three dimensions are computationally investigated by using integer programming (IP). Three IP formulations of triangulations are introduced, two based on the stable set problem, and the other based on the set partitioning problem. Some properties that are interesting from a theoretical or practical point of view are considered as objective functions for IP. Finally, some computational results are given. This approach allows three-dimensional triangulations to be treated in a flexible and efficient way, and has led to the discovery of some interesting properties of three-dimensional triangulations.