Abstract
Random discrete points have important application value in meshless PDE equation discretization, molecular dynamics simulation, point cloud imaging and so on. There are many common methods to generate random points, such as Monte Carlo, Gibbs Sampling, and Hammersley series and etc. But Halton random point algorithm has a defect that it only generates discrete points in [0,1] <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> region. However, in practical applications, it is necessary to be able to generate discrete points on any area. This paper proposed a new Halton points extension algorithm to solve this defects. We defined a linear operator which can transform discrete points from [0,1] <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> region into any plane region. Two examples are given, the extension algorithm respectively includes square, rectangular and polar coordinates region. The numerical results show that our method is accurate, effective and more general, it also enhanced the application range by our method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
