Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Parallel triangulation of a polygon in two calls to the trapezoidal map

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in timeO(logn) usingO(n) CREW PRAM processors.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Aggarwal, B. Chazelle, L. Guibas, C. Ó 'Dúnlaing, and C. Yap. Parallel computational geometry. InIEEE Foundations of Computer Science, pp. 468–477, 1985. To appear, special issueAlgorithmica.

  2. M. J. Atallah, R. Cole, and M. T. Goodrich. Cascading divide- and-conquer: a technique for designing parallel algorithms. Technical Report CSD-TR-665, Department of Computer Science, Purdue University, 1987.

  3. M. J. Atallah and M. T. Goodrich. Efficient plane sweeping in parallel. In2nd ACM Symp. on Computational Geometry, pp. 216–225, 1986.

  4. B. Chazelle and J. Incerpi. Triangulation and shape-complexity.ACM Trans. Graphics,3:135–152, 1984. Special Issue on Computational Geometry.

    Article  MATH  Google Scholar 

  5. A. Fournier and D. Y. Montuno. Triangulating simple polygons and equivalent problems.ACM Trans. Graphics,3:153–174, 1984. Special Issue on Computational Geometry.

    Article  MATH  Google Scholar 

  6. M. T. Goodrich. Efficient parallel techniques for computational geometry. Ph.D. thesis, Department of Computer Science, Purdue University, 1987.

  7. R. E. Tarjan and C. J. Van Wyk. AnO(n log logn)-time algorithm for triangulating simple polygons.SIAM J. Comput., 1987. To appear. Earlier version appeared in 18th STOC, 1986.

Download references

Author information

Authors and Affiliations

  1. Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012, New York, NY, USA

    Chee -Keng Yap

Authors
  1. Chee -Keng Yap
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by C. K. Wong.

This research was supported by NSF Grants No. DCR-84-01898 and No. DCR-84-01633, and ONR Contract N00014-85-K-0046.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yap, C.K. Parallel triangulation of a polygon in two calls to the trapezoidal map. Algorithmica 3, 279–288 (1988). https://doi.org/10.1007/BF01762118

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01762118

Key words

Search

Navigation