A Method for Solving Mass PointinCovering Problemsfor Arbitrary Coverings Using GPUстатьяИсследовательская статья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 13 сентября 2017 г.
Аннотация: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 cov
erings or triangulations are used or rendering problems are solved.