Displaying 1 to 7 from 7 results

geo - S2 geometry library in Go

  •    Go

This is a library for manipulating geometric shapes. Unlike many geometry libraries, S2 is primarily designed to work with spherical geometry, i.e., shapes drawn on a sphere rather than on a planar 2D map. (In fact, the name S2 is derived from the mathematical notation for the unit sphere.) This makes it especially suitable for working with geographic data.Basic representations of angles, intervals, latitude-longitude points, unit 3D vectors, and conversions among them.

Silverlight Sphere Control

  •    Silverlight

This is a Silverlight spherical selection control that I built that uses the projection transformations in Silverlight. It includes several modes (including random, rows, columns, vertical carousel, horizontal carousel, and checkered) and events. Upon selecting one of the ...

icosphere - Generates icosphere meshes of varying levels of complexity

  •    Javascript

Generates icosphere meshes of varying levels of complexity – implementation sourced from this article.MIT. See LICENSE.md for details.

leaflet-geodesy - a leaflet plugin for the earth

  •    Javascript

A Leaflet plugin for the earth.Either via require('leaflet-geodesy') or the LGeo object when used without browserify.

static-kdtree - A static kdtree data structure

  •    Javascript

kd-trees are a compact data structure for answering orthogonal range and nearest neighbor queries on higher dimensional point data in linear time. While they are not as efficient at answering orthogonal range queries as range trees - especially in low dimensions - kdtrees consume exponentially less space, support k-nearest neighbor queries and are relatively cheap to construct. This makes them useful in small to medium dimensions for achieving a modest speed up over a linear scan. It is also worth mentioning that for approximate nearest neighbor queries or queries with a fixed size radius, grids and locality sensitive hashing are strictly better options. In these charts the transition between "Medium" and "Big" depends on how many points there are in the data structure. As the number of points grows larger, the dimension at which kdtrees become practical goes up.

q3c - PostgreSQL extension for spatial indexing on a sphere

  •    C

Idea and implementation by Sergey Koposov with help from Oleg Bartunov. To read more about the Q3C indexing, check out the Q3C paper published in ADASS conference proceedings http://adsabs.harvard.edu/abs/2006ASPC..351..735K The citation is "Koposov, S., & Bartunov, O. 2006, Astronomical Society of the Pacific Conference Series, 351, 735" If you use Q3C you are kindly asked to cite this paper. I would be also happy to hear about any usage of Q3C.

s2 - R bindings for Google's s2 library for geometry on the sphere

  •    C

The package (master branch) currently passes R CMD check without any errors and warnings on Linux, OSX and Windows. Only a minor subset of the C++ library is wrapped at the moment. Simple R data structures such as plain matrices and lists are used. The API is not stable and changes should be expected. The core C++ code is in src/geometry. This code is a slightly modified copy of the corresponding directory in this repo. (The subdirectories python and test are removed since they aren't needed by the R package.) The modifications to the original code are minor edits to satisfy the R package checker, and no new functionality is introduced at the C++ level.