Given a large set (tens of thousands up to millions) of disordered points represented as 3D Cartesian vectors, what's a good algorithm for making a regular square grid (of user-defined spacing) that encloses all of the points? Some constraints:Given a large set (tens of thousands up to mill
阅读背景：
在一组无序的点上放置网格的算法
来源：互联网
分享到：
