skip to main content
article
Free Access

Algorthmic pradigms: examples in computational geometry II

Authors Info & Claims
Published:01 February 1990Publication History
First page image

References

  1. An79 Andrew, A.M. "Another efficient algorithm for convex hulls in two dimensions," lnfo. Proc. Letters, 9, pp. 216- 219 (1979).Google ScholarGoogle ScholarCross RefCross Ref
  2. Br88 Brown, M.H. "Exploring algorithms usirlg Balsa-I/," Computer, May 1988, pp 14-36 (1988). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. DP87a DePano, N.A.A. Polygon approximation with optimized polygonal enclosures" applications and algorithms, Ph.D. thesis, Dept. of Computer Science, The Iohns Hopkins University, April 1987.Google ScholarGoogle Scholar
  4. DP87b DePano, N.A.A. "Rotating calipers revisited: optimal polygonal enclosures in optimal time," ACM South Central Regional Conf., Lafayette LA, November 1987.Google ScholarGoogle Scholar
  5. DP88 DePano, N.A.A. "Algorithmic Paradigms: Examples in Computational Geomtery," Proc. ACM SIGCSE Technical Symposium, Atlanta GA, February 1988, pp. 83 -87. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. LD89 LeSage, M. and N.A.A.DePano, "Minimum enclosing rectangles -- a comparative investigation of two optimizing criteria," Proc. 1EEE Southeastcon '89, Columbia SC, April 1989, pp. 233-237.Google ScholarGoogle Scholar
  7. Fr88 Frenkel, K. A. "The art and science of visualizing data," Communications of the ACM, February 1988, pp. 110- 121. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. FS75 Freeman, H. and R. Shapira. "Determining the minimum-area rectangle for an arbitrary closed curve," Communications of the ACM, 18, pp. 409-413 (1975). Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. OR87 O'Rourke, J. Art gallery theorems and algorithms. Oxford Univ. Press, New York, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Ra70 Raynaud, H. "Sur renveloppe convexe des nuages des points aleatoires dans Rn, I, J. Appl. Prob. 7, pp. 35-48 (1970).Google ScholarGoogle ScholarCross RefCross Ref
  11. PS85 Preparata, F.P and M.I. Shamos. Computational geometry -- an introduction. Springer-Verlag, New York, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Algorthmic pradigms: examples in computational geometry II

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM SIGCSE Bulletin
            ACM SIGCSE Bulletin  Volume 22, Issue 1
            Feb. 1990
            269 pages
            ISSN:0097-8418
            DOI:10.1145/319059
            Issue’s Table of Contents
            • cover image ACM Conferences
              SIGCSE '90: Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
              February 1990
              270 pages
              ISBN:0897913469
              DOI:10.1145/323410

            Copyright © 1990 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 February 1990

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!