Skip to main content
SpringerLink
Log in
Book cover

Workshop on Computational Geometry

CG 1988: Computational Geometry and its Applications pp 136–147Cite as

Triangulating a monotone polygon in parallel

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 333))

Abstract

Given a simple n-sided polygon, the triangulation problem is to partition the interior of the polygon into n — 2 triangles by adding n — 3 nonintersecting diagonals. We propose an O(log n)-time algorithm for triangulating monotone n-sided polygons using only n/log n processors in the CREW-PRAM model. This improves on the previously best bound of O(log n) time using n processors.

...!pyramid!tub!huwa

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. R. E. Tarjan and C. van Wyk. An O(n log log n)-time algorithm for triangulating simple polygons. 1986. Manuscript, submitted to SIAM Journal on Computing.

    Google Scholar 

  2. M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan. Triangulating a simple polygon. Information Processing Letters, 7(4):175–179, 1987.

    Google Scholar 

  3. A. Fournier and D. Y. Montuno. Triangulating simple polygons and equivalent problems. ACM Transactions on Graphics, 3(2):153–174, 1984.

    Article  Google Scholar 

  4. S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons. In Proceeding of the Conference on Foundations of Computing Theory, pages 207–218, Springer-Verlag, Berlin, 1983.

    Google Scholar 

  5. M. J. Atallah and M. T. Goodrich. Efficient plane sweeping in parallel. In Proceedings of the 2nd Symposion on Computational Geometry, pages 216–225, 1986.

    Google Scholar 

  6. C. P. Kruskal. Searching, merging, and sorting in parallel computation. IEEE Transactions on Computers, C32(10):942–946, 1983.

    Google Scholar 

  7. R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree and graph problems. Proceeding of the 27th FOCS, pages 478–491, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Berlin, Germany (FRG), Franklinstr. 28/29, FR 6-2, D-1000, Berlin 10

    Hubert Wagener

Authors
  1. Hubert Wagener
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Noltemeier

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wagener, H. (1988). Triangulating a monotone polygon in parallel. In: Noltemeier, H. (eds) Computational Geometry and its Applications. CG 1988. Lecture Notes in Computer Science, vol 333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50335-8_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-50335-8_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50335-4

  • Online ISBN: 978-3-540-45975-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation