Find the smallest circle that contains all longitude and latitude input points. From the generated center and radius, variable side polygons can be created, navigation based on bearing and distance can be applied, and more. Based on a modified version of Welzl's algorithm for smallest circle. Distance calculations are based on the haversine formula. Calculations for distance, midpoint, bearing and more are derived from <https://www.movable-type.co.uk>.
| Version: | 0.1.1 |
| Imports: | grDevices |
| Suggests: | sp, mapview |
| Published: | 2019-09-03 |
| Author: | Shant Sukljian |
| Maintainer: | Shant Sukljian <asshtnt at gmail.com> |
| License: | MIT + file LICENSE |
| NeedsCompilation: | no |
| Materials: | README |
| CRAN checks: | geosed results |
| Reference manual: | geosed.pdf |
| Package source: | geosed_0.1.1.tar.gz |
| Windows binaries: | r-devel: geosed_0.1.1.zip, r-release: geosed_0.1.1.zip, r-oldrel: geosed_0.1.1.zip |
| macOS binaries: | r-release: geosed_0.1.1.tgz, r-oldrel: geosed_0.1.1.tgz |
Please use the canonical form https://CRAN.R-project.org/package=geosed to link to this page.