Advertisement

The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation

  • Breno Piva
  • Cid C. de Souza
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7422)

Abstract

The minimum stabbing triangulation of a set of points in the plane (mstr) was previously investigated in the literature. The complexity of the mstr remains open and, to our knowledge, no exact algorithm was proposed and no computational results were reported earlier in the literature of the problem. This paper presents integer programming (ip) formulations for the mstr, that allow us to solve it exactly through ip branch-and-bound (b&b) algorithms. Moreover, one of these models is the basis for the development of a sophisticated Lagrangian heuristic for the problem. Computational tests were conducted with two instance classes comparing the performance of the latter algorithm against that of a standard (exact) b&b. The results reveal that the Lagrangian algorithm yielded solutions with minute, and often null, duality gaps for instances with several hundreds of points in small computation times.

Keywords

Convex Hull Edge Model Subgradient Algorithm Planar Triangulation Lagrangian Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agarwal, P., Aronov, B., Suri, S.: Stabbing triangulations by lines in 3d. In: Proceedings of the Eleventh Annual Symposium on Computational Geometry, SCG 1995, pp. 267–276. ACM, New York (1995)CrossRefGoogle Scholar
  2. 2.
    Beasley, J.: Lagrangean relaxation. In: Modern Heuristic Techniques for Combinatorial Problems, pp. 243–303. McGraw-Hill (1993)Google Scholar
  3. 3.
    Beirouti, R., Snoeyink, J.: Implementations of the LMT heuristic for minimum weight triangulation. In: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, SCG 1998, pp. 96–105. ACM, New York (1998)CrossRefGoogle Scholar
  4. 4.
    Berg, M., Kreveld, M.: Rectilinear decompositions with low stabbing number. Information Processing Letters 52(4), 215–221 (1994)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Demaine, E., Mitchell, J., O’Rourke, J.: The open problems project, http://maven.smith.edu/~orourke/TOPP/ (acessed in January 2010)
  6. 6.
    Dickerson, M.T., Montague, M.H.: A (usually) connected subgraph of the minimum weight triangulation. In: Proc. of the 12th Annual ACM Symp. on Comp. Geom, pp. 204–213 (1996)Google Scholar
  7. 7.
    Fekete, S., Lübbecke, M., Meijer, H.: Minimizing the stabbing number of matchings, trees, and triangulations. In: Munro, J. (ed.) SODA, pp. 437–446. SIAM (2004)Google Scholar
  8. 8.
    Fekete, S., Lübbecke, M., Meijer, H.: Minimizing the stabbing number of matchings, trees, and triangulations. Disc. Comp. Geometry 40, 595–621 (2008)zbMATHCrossRefGoogle Scholar
  9. 9.
    Mitchell, J., O’Rourke, J.: Computational geometry. SIGACT News 32(3), 63–72 (2001)CrossRefGoogle Scholar
  10. 10.
    Mitchell, J., Packer, E.: Computing geometric structures of low stabbing number in the plane. In: Proc. 17th Annual Fall Work. on Comp. Geom. and Vis. IBM Watson (2007)Google Scholar
  11. 11.
    Mulzer, W.: LMT-skeleton program, http://page.mi.fu-berlin.de/mulzer/pubs/mwt_software/old/ipelets/LMTSk//eleton.tar.gz (accessed in March 2011)
  12. 12.
    Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. Journal of the ACM 55, 11:1–11:29 (2008)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Nunes, A.P.: Uma abordagem de programação inteira para o problema da triangulação de custo mínimo. Master’s thesis, Institute of Computing, University of Campinas, Campinas (1997) (in Portuguese)Google Scholar
  14. 14.
    Reinelt, G.: TSPLIB, http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/ (acessed in March 2011)
  15. 15.
    Shewchuk, J.R.: Stabbing Delaunay tetrahedralizations. Disc. Comp. Geometry 32, 343 (2002)MathSciNetGoogle Scholar
  16. 16.
    Tóth, C.D.: Orthogonal Subdivisions with Low Stabbing Numbers. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 256–268. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  17. 17.
    Wolsey, L.A.: Integer Programming. John Wiley and Sons (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Breno Piva
    • 1
  • Cid C. de Souza
    • 1
  1. 1.Institute of ComputingUniversity of CampinasCampinasBrasil

Personalised recommendations