[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A method for solving mass point-in-covering problems for arbitrary coverings using GPU

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

Results of numerical experiments in solving mass problems of determining membership of a set of points in a set of arbitrary shapes covering a domain or intersecting with each other in a space of arbitrary dimension are discussed. The problems are solved using geometrical techniques on graphics processors. The proposed solution can outperform the fastest classical algorithms by a factor from 6 to 700 in terms of speed. As an example, the construction of grids for computations within a geophysical model of the Earth is used. Such problems are typical for all the numerical computations involving geometric modeling where coverings or triangulations are used or rendering problems are solved.

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
£29.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 includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. http://www.ixbt.com/video3/cuda-1.shtml. Accessed November 24, 2010.

  2. NVidea, Cuda Zone, http://www.nvidia.ru/object/cuda-home-new-ru.html. Accessed November 24, 2010.

  3. Il’in, V.P. and Tribis, D.Yu, Geometrical informatics of continuous media models, Vychisl. Metody Programmir., 2009, vol. 10, p. 120.

    Google Scholar 

  4. Il’in, V.P. and Tribis, D.Yu, Geometrical informatics of continuous media models, Trudy 18-oi mezhdunarodnoi konferetsii po komp’yuternoi grafike i zreniyu GraphiCon 2008 (Proc. of the 18th Int. Conf. on Computer Graphics and Vision), Moscow, 2008.

    Google Scholar 

  5. Franklin, W.R. “PNPOLY—point inclusion in polygon test,” http://www.ecse.rpi.edu/Homepages/wrf/Research/Short-Notes/pnpoly.html. Accessed February 10, 2013.

  6. Wolfram Research: Mathematica, http://www.wol-fram.com. Accessed November 24, 2010.

Download references

Author information

Authors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch, Russian Academy of Sciences, pr. Akademika Lavrent’eva 6, Novosibirsk, 630090, Russia

    I. N. Skopin & D. Yu. Tribis

Authors
  1. I. N. Skopin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Yu. Tribis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. N. Skopin.

Additional information

Original Russian Text © I.N. Skopin, D.Yu. Tribis, 2013, published in Programmirovanie, 2013, Vol. 39, No. 3.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skopin, I.N., Tribis, D.Y. A method for solving mass point-in-covering problems for arbitrary coverings using GPU. Program Comput Soft 39, 158–162 (2013). https://doi.org/10.1134/S0361768813030079

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768813030079

Keywords