https://github.com/grasbock/fibonacci-sphere-section

Create a section of a fibonacci sphere efficiently.
https://github.com/grasbock/fibonacci-sphere-section

Last synced: about 2 months ago
JSON representation

Create a section of a fibonacci sphere efficiently.

• Host: GitHub
• URL: https://github.com/grasbock/fibonacci-sphere-section
• Owner: GRASBOCK
• License: mit
• Created: 2022-01-21T16:58:44.000Z (almost 3 years ago)
• Default Branch: main
• Last Pushed: 2022-02-22T13:57:22.000Z (almost 3 years ago)
• Last Synced: 2024-03-19T12:55:44.968Z (9 months ago)
• Language: Python
• Size: 230 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# fibonacci-sphere-section

Create a section of a fibonacci sphere efficiently.

If one wants to generate a fibonacci sphere with a large amount of points (for example ~50 million) but only needs a subset of these, removing by discarding can become very inefficient. This implmentation generates only those that are in the specified bounding box. It doesn't scale with the absolute number of points on the whole sphere but only with those that are contained in the boundinb box.

Here is a section of a sphere with 10,000 points, shown in red. The rest of the sphere is also shown in blue to make it apparent that this is a section. 



  



Here is another section with 100,000,000 points. The execution time is about the same.