skip to main content
article
Free Access

Convex Decomposition of Simple Polygons

Authors Info & Claims
Published:01 October 1984Publication History
First page image

References

  1. 1 AKL, S. G., AND TOUSSAINT, G.T. A fast convex hull algorithm. Inf. Prec. Left. 7 (1978), 219- 222.Google ScholarGoogle Scholar
  2. 2 ANDREW, A.M. Another efficient algorithm for convex hull in 2-dimensions. Inf. Prec. Lett. 9 (1979), 216-219.Google ScholarGoogle Scholar
  3. 3 BVKAT, A. Convex hull of a finite set of points in two dimensions, lnf Proc. Lett. 7(1978),296- 298.Google ScholarGoogle Scholar
  4. 4 CItAZELLE, B.M. Computational geometry and convexity. Tech. CMU-CS-80-150, Carnegie- Mellon Univ., Pittsburgh, Pa., 1980.Google ScholarGoogle Scholar
  5. 5 EDDY, W.F. A new convex hull algorithm for planar set. ACM Trans. Math. So{tw. 3 (1977), 398-403. Google ScholarGoogle Scholar
  6. 6 GRAHAM, R.L. An efficient algorithm for determining the convex hull of a planar set. Inf. Proc. Letl. I (1972), 132-133.Google ScholarGoogle Scholar
  7. 7 GRAr~AM, R. L., AND YAO, F.F. Finding the convex hull of a simple polygon. J. Algorithms. To be published.Google ScholarGoogle Scholar
  8. 8 GREEN, P. J., AND SILVERMAN, B. W. Constructing the convex hull of a set of points in the plane. Comput. J. 22, 3 (1979}, 262-266.Google ScholarGoogle Scholar
  9. 9 JARVIS, R.A. On the identification of the convex hull of a finite set of points in the plane. Inf. Proc. Lett. 2 (1973), 18-21.Google ScholarGoogle Scholar
  10. 10 LEE, D.T. On finding the convex hull of a simple polygon. Int. J. Comput. In{. Set 12, 2 (1983), 87-98.Google ScholarGoogle Scholar
  11. 11 MCCALLUM, D., AND AVIS, D. A linear time algorithm for finding the convex hull of a simple polygon. In{. Proc. Lett. 9 (1979), 201-205.Google ScholarGoogle Scholar
  12. 12 PREPARATA, F.P. An optimal real time algorithm for planar convex hulls. Commun. ACM 22 (1979), 402-405. Google ScholarGoogle Scholar
  13. 13 PREPARATA, F. P., AND HON6, S.J. Convex hulls of finite sets of points in two and three dimensions. Commun. ACM 20 (1977), 87-93. Google ScholarGoogle Scholar
  14. 14 SHAMOS, M. Problems in computational geometry. Ph.D. dissertation, Computer Science Dept., Yale Univ., New Haven, Conn., 1978. Google ScholarGoogle Scholar
  15. 15 SKLANSK~, J. Measuring concavity on a rectangular mosaic. IEEE Trans. Comput. C-21. (1972), 1355-1364.Google ScholarGoogle Scholar
  16. 16 {WOOnWAP, K, J.R., AND WALLIS, A.F. Graphical input to a Boolean solid modeller. In CAD 82, Brighton, U.K., 1982, p. 681-688.Google ScholarGoogle Scholar
  17. 17 YAo, A. C.C. A lower bound for finding convex hulls. J.ACM 28, 4 (Oct. 198I), 780-787. Google ScholarGoogle Scholar

Index Terms

  1. Convex Decomposition of Simple Polygons

        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 Transactions on Graphics
          ACM Transactions on Graphics  Volume 3, Issue 4
          Oct. 1984
          75 pages
          ISSN:0730-0301
          EISSN:1557-7368
          DOI:10.1145/357346
          Issue’s Table of Contents

          Copyright © 1984 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 October 1984
          Published in tog Volume 3, Issue 4

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader