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
Folding a simple polygon: a paradigm for computational geometry
Full text PdfPdf (536 KB)
Source ACM Annual Computer Science Conference archive
Proceedings of the 1995 ACM 23rd annual conference on Computer science table of contents
Nashville, Tennessee, United States
Pages: 114 - 118  
Year of Publication: 1995
ISBN:0-89791-737-5
Authors
Ali A. Kooshesh  Department of Computer Science, Western Kentucky University, Bowling Green, KY
Bernard M. E. Moret  Department of Computer Science, University of New Mexico, Albuquerque, NM
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

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/259526.259545
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
S. Mitchell , T. Beyer , W. Jones, Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs, Journal of the ACM (JACM), v.26 n.4, p.603-610, Oct. 1979  [doi>10.1145/322154.322155]
 
2
Bernard Chazelle, Triangulating a simple polygon in linear time, Discrete & Computational Geometry, v.6 n.5, p.485-524, 1991  [doi>10.1007/BF02574703]
 
3
V. Chv~tal, "A combinatorial theorem in plane geometry," J. Combin. Theory Series B 18 (1975), 39-41.
 
4
J. Fisk, "A short proof of Chv~ai's watchman theorem," 3. CombirL Theory Series A 24 (1978), 374.
 
5
J. Kahn, M. Klawe, and D. Kleitman, "Traditional galleries require fewer watchmen," SIAM 3. Algebraic Discrete Methods 4 (1980), 194-206.
 
6
Ali A. Kooshesh , Bernard M. E. Moret, Folding a Triangulated Simple Polygon: Structural and Algorithmic Results, Proceedings of the International Conference on Computing and Information: Advances in Computing and Information, p.102-110, May 27-29, 1991
 
7
A. A. Kooshesh and B.M.E. Motet, '.Three-coloring the verrices of a triangulated simple polygon", Pattern Recognition 25 (1992), 443.
 
8
Kooshesh, A.A., Motet, B.M.E., and SzAkely, L.L., "Improved bounds for the prison yard problem," Congressus Numerantium 76 (1990), 145-149.
 
9
D.J. Rose, "On simple characterizations of k-trees," Discrete Mathematics 7 (I 974), 317-322.

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.1 COMPUTATION BY ABSTRACT DEVICES

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


General Terms:
Algorithms, Theory, Verification

Collaborative Colleagues:
Ali A. Kooshesh: colleagues
Bernard M. E. Moret: colleagues

Peer to Peer - Readers of this Article have also read:

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