math - Is there any constant time spatial indexing of points on the surface of a sphere with balanced partitioning? -


a simple way index points in sphere use polar coordinates. is, find index of point, convert polar coordinates , apply formula polar_ang * width + azimuthal_ang. problem strategy isn't evenly spaced - indices near center of sphere have bigger areas near top.

enter image description here

is there alternative indexing strategy equally simple better partitioning properties?

use subdivided icosahedron. there 12 vertices , 20 triangular faces. each of these faces can subdivided grids of smaller triangles arbitrarily small size. not subdivided triangles have equal area, range of possible areas bounded.


Comments

Popular posts from this blog

django - (fields.E300) Field defines a relation with model 'AbstractEmailUser' which is either not installed, or is abstract -

matlab - error with cyclic autocorrelation function -

php - Using grpc in Laravel, "Class 'Grpc\ChannelCredentials' not found." -