https://github.com/papachristoumarios/spherical-packing

An algorithm to solve spherical packing via cone-sphere intersections on a given closed spherical region. Can be used for finding maximum coverage for satellite tracking (LEO tracking etc.)
https://github.com/papachristoumarios/spherical-packing

Last synced: 8 months ago
JSON representation

An algorithm to solve spherical packing via cone-sphere intersections on a given closed spherical region. Can be used for finding maximum coverage for satellite tracking (LEO tracking etc.)

• Host: GitHub
• URL: https://github.com/papachristoumarios/spherical-packing
• Owner: papachristoumarios
• License: gpl-3.0
• Created: 2014-12-08T20:20:48.000Z (almost 11 years ago)
• Default Branch: master
• Last Pushed: 2015-10-25T18:37:44.000Z (almost 10 years ago)
• Last Synced: 2025-01-12T18:37:48.030Z (9 months ago)
• Language: Python
• Size: 160 KB
• Stars: 3
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
spherical-packing

=================

An algorithm to solve spherical packing via cone-sphere intersections on a given closed spherical region. Can be used for finding maximum coverage for satellite tracking (LEO tracking etc.). [FYI]

[FYI]: http://papachristoumarios.blogspot.gr/2015/04/number-of-groundstations-needed-to.html