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
The complexity of cutting paper (extended abstract)
Full text PdfPdf (434 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the first annual symposium on Computational geometry table of contents
Baltimore, Maryland, United States
Pages: 316 - 321  
Year of Publication: 1985
ISBN:0-89791-163-6
Authors
Mark H. Overmars  Department of Computer Science, University of Utrecht, P.O. Box 80.012, 3508 TA Utrecht, the Netherlands
Emo Welzl  Inst. of Appl. Math. and Canputer Science, University of Leiden, the Netherlands
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): 3,   Downloads (12 Months): 13,   Citation Count: 4
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/323233.323274
What is a DOI?

CITED BY  4
János Pach , Gábor Tardos, Cutting glass, Proceedings of the sixteenth annual symposium on Computational geometry, p.360-369, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
Adrian Dumitrescu, An approximation algorithm for cutting out convex polygons, Computational Geometry: Theory and Applications, v.29 n.3, p.223-231, November 2004
Adrian Dumitrescu, The cost of cutting out convex n-gons, Discrete Applied Mathematics, v.143 n.1-3, p.353-358, 30 September 2004
Adrian Dumitrescu, An approximation algorithm for cutting out convex polygons, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.3 COMPUTER GRAPHICS

Additional 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

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS


General Terms:
Algorithms, Design, Theory, Verification

Collaborative Colleagues:
Mark H. Overmars: colleagues
Emo Welzl: 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