ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
On computing edges that are in all minimum-weight triangulations
Source Annual Symposium on Computational Geometry archive
Proceedings of the twelfth annual symposium on Computational geometry table of contents
Philadelphia, Pennsylvania, United States
Pages: 507 - 508  
Year of Publication: 1996
ISBN:0-89791-804-5
Authors
Patrice Belleville
Mark Keil
Michael McAllister
Jack Snoeyink
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 7
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/237218.237425
What is a DOI?

CITED BY  7
Christos Levcopoulos , Drago Krznaric, A near-optimal heuristic for minimum weight triangulation of convex polygons, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.518-527, January 05-07, 1997, New Orleans, Louisiana, United States
Ronald Beirouti , Jack Snoeyink, Implementations of the LMT heuristic for minimum weight triangulation, Proceedings of the fourteenth annual symposium on Computational geometry, p.96-105, June 07-10, 1998, Minneapolis, Minnesota, United States
Oswin Aichholzer, The path of a triangulation, Proceedings of the fifteenth annual symposium on Computational geometry, p.14-23, June 13-16, 1999, Miami Beach, Florida, United States
Michael Hoffmann , Yoshio Okamoto, The minimum weight triangulation problem with few inner points, Computational Geometry: Theory and Applications, v.34 n.3, p.149-158, July 2006
Wolfgang Mulzer , Günter Rote, Minimum-weight triangulation is NP-hard, Journal of the ACM (JACM), v.55 n.2, p.1-29, May 2008
Minimum weight triangulation is NP-hard, Proceedings of the twenty-second annual symposium on Computational geometry, June 05-07, 2006, Sedona, Arizona, USA
Jan Remy , Angelika Steger, A quasi-polynomial time approximation scheme for minimum weight triangulation, Journal of the ACM (JACM), v.56 n.3, p.1-47, May 2009

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Trees


General Terms:
Algorithms

Collaborative Colleagues:
Patrice Belleville: colleagues
Mark Keil: colleagues
Michael McAllister: colleagues
Jack Snoeyink: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player