Skip to main content
SpringerLink
Log in

The Unified Algorithmic Platform for Solving Complex Problems of Computational Geometry

  • Conference paper
Parallel Computing Technologies (PaCT 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7979))

Included in the following conference series:

Abstract

The problem of complex tasks related to set of points on a plane with help of a generalized and optimized algorithm is considered. The algorithm is easily parallelized. Theoretical analysis has been carried out and practical results have been obtained.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, A., Chazelle, B., Guibas, L., O’Dunlaing, C., Yap, C.: Parallel computational geometry. Algorithmica 3, 293–327 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  2. Atallah, M.J., Cole, R., Goodrich, M.T.: Cascading divide-and-conquer: A technique for designing parallel algorithms. SIAM J. Comput. 18, 499–532 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cole, R., Goodrich, M.T.: Optimal parallel algorithms for polygon and point-set problems. Algorithmica 7, 3–23 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. Amato, N.M., Goodrich, M.T., Ramos, E.A.: Parallel algorithms for higher-dimensional convex hulls. In: Proc. 35th An. IEEE Sympos. Found. Comput. Sci., pp. 683–694 (1994)

    Google Scholar 

  5. Chen, D.: Efficient geometric algorithms on the EREW PRAM. IEEE Trans. Parallel Distrib. Syst. 6, 41–47 (1995)

    Article  Google Scholar 

  6. Berkman, O., Schieber, B., Vishkin, U.: A fast parallel algorithm for finding the convex hull of a sorted point set. Internat. J. Comput. Geom. Appl. 6, 231–242 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Goodman, J.E., O’Rourke, J.: Handbook of Discrete and Computational Geometry. Chapman and Hall/CRC Press, N.Y. (2004)

    MATH  Google Scholar 

  8. Akl, S.G., Lyons, K.A.: Parallel Computational Geometry. Prentice-Hall, Englewood Cliffs (1993)

    Google Scholar 

  9. Reif, J.H.: Synthesis of Parallel Algorithms. Morgan Kaufmann, San Mateo (1993)

    Google Scholar 

  10. Tereshchenko, V.N., Anisimov, A.V.: Recursion and parallel algorithms in geometric modeling problems. Cybern. and Syst. Analysis 46(2), 173–184 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Cole, R.: Parallel merge sort. In: Proc. 27th IEEE FOCS Symp., pp. 511–516 (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Taras Shevchenko National University of Kyiv, 64/13, Volodymyrska Street, City of Kyiv, Ukraine, 01601

    Vasyl Tereshchenko, Igor Budjak & Andrey Fisunenko

Authors
  1. Vasyl Tereshchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor Budjak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrey Fisunenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics, Supercomputer Department, Russian Academy of Science, 630090, Novosibirsk, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tereshchenko, V., Budjak, I., Fisunenko, A. (2013). The Unified Algorithmic Platform for Solving Complex Problems of Computational Geometry. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2013. Lecture Notes in Computer Science, vol 7979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39958-9_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39958-9_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39957-2

  • Online ISBN: 978-3-642-39958-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation