Skip to main content
SpringerLink
Log in

Weighted parallel triangulation of simple polygons

  • Graphs And Computational Geometry
  • Conference paper
  • First Online:
Book cover Graph-Theoretic Concepts in Computer Science (WG 1989)

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

Included in the following conference series:

  • 137 Accesses

Abstract

This paper presents a sequential and a parallel algorithm for computing an inner triangulation of a simple polygon which is optimal with respect to some weight function. This weight function can be chosen rather arbitrarily. The sequential algorithm runs in O(n 3) time and the parallel algorithm runs in O(log 2 n) time with O(n 6) processors on a Concurrent-Read, Exclusive-Write Parallel RAM model (CREW PRAM).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer 1987, p. 302.

    Google Scholar 

  2. H. ElGindy, An Optimal Speed-Up Parallel Algorithm for Triangulating Simplicial Point Sets in Space, International Journal of Parallel Programming, Vol. 15, No. 5, 1986, 389–398.

    Article  MathSciNet  Google Scholar 

  3. A. Gibbons, W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, 1988.

    Google Scholar 

  4. K. Mehlhorn, Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, Springer1977.

    Google Scholar 

  5. E. Merks, An Optimal Parallel Algorithm for Triangulating a Set of Points in the Plane, International Journal of Parallel Programming, Vol. 15, No. 5, 1986, p. 399–410.

    Article  Google Scholar 

  6. W. Ruzzo, On the complexity of general context-free language parsing and recognition. Automata, languages and programming, Lecture Notes in Computer Science, (1979), p. 489–499.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Paderborn, Paderborn, West Germany

    K. Menzel & B. Monien

Authors
  1. K. Menzel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Nagl

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Menzel, K., Monien, B. (1990). Weighted parallel triangulation of simple polygons. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1989. Lecture Notes in Computer Science, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52292-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-52292-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52292-8

  • Online ISBN: 978-3-540-46950-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation