Weighted parallel triangulation of simple polygons

  • K. Menzel
  • B. Monien
Graphs And Computational Geometry
Part of the Lecture Notes in Computer Science book series (LNCS, volume 411)


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(n3) time and the parallel algorithm runs in O(log2n) time with O(n6) processors on a Concurrent-Read, Exclusive-Write Parallel RAM model (CREW PRAM).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer 1987, p. 302.Google Scholar
  2. 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.CrossRefMathSciNetGoogle Scholar
  3. 3.
    A. Gibbons, W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, 1988.Google Scholar
  4. 4.
    K. Mehlhorn, Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, Springer1977.Google Scholar
  5. 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.CrossRefGoogle Scholar
  6. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • K. Menzel
    • 1
  • B. Monien
    • 1
  1. 1.University of PaderbornPaderbornWest Germany

Personalised recommendations