Displaying 1 to 8 from 8 results

magellan - Geo Spatial Data Analytics on Spark

  •    Scala

Magellan is a distributed execution engine for geospatial analytics on big data. It is implemented on top of Apache Spark and deeply leverages modern database techniques like efficient data layout, code generation and query optimization in order to optimize geospatial queries. The application developer writes standard sql or data frame queries to evaluate geometric expressions while the execution engine takes care of efficiently laying data out in memory during query processing, picking the right query plan, optimizing the query execution with cheap and efficient spatial indices while presenting a declarative abstraction to the developer.

pygal - Python Geometric Algorithms Library (CGAL Bindings)

  •    C++

The pygal library consists of wrappers for CGAL, one of the most powerful libraries for geometric algorithms. However, CGAL is written in C++, compiles like a turtle and is not much fun to use. The pygal library offers some extremely nice wrappers for python, that harness the speed of C++ and combine it with the beauty of Python.

hgeometry - HGeometry

  •    Haskell

HGeometry also includes a datastructure/data type for planar graphs. In particular, it has a EdgeOracle data structure, that can be built in (O(n)) time that can test if the graph contains an edge in constant time. All geometry types are parameterized by a numerical type r. It is well known that Floating-point arithmetic and Geometric algorithms don't go well together; i.e. because of floating point errors one may get completely wrong results. Hence, I strongly advise against using Double or Float for these types. In several algorithms it is sufficient if the type r is Fractional. Hence, you can use an exact number type such as Rational.

ofxBranchesPrimitive - openFrameworks addon to create geometries composed by branches

  •    C++

This openFrameworks addon can be used to compose geometries that are made out of branches. As "branch" I mean a class that is initialized with a starting point and an end point, a quaternion that defines the initial orientation and an initial direction. The desired geometry for each branch can be specified when merging the branches into the mesh. By default, this addon comes with a cylindric geometry that can be used to create tubular structures, as in the example-circle-points app. If you want to create your own geometry for the branches, have a look at the example-branch application, find the ofxBranchCylinder::putIntoMesh method and substitute it with your custom one.




quickhull - Header-only single-class implementation of the Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space

  •    C++

NOTE: This library is header-only. Implementation of the Quickhull algorithm (Barber et al) for the convex hulls finding in arbitrary dimension (>1) space. Also implemented the Mehlhorn algorithm (Mehlhorn et al) for checking convexity of resulting geometric structure.

sweepline - Fortune's algorithm for Voronoi diagram generating on the plane

  •    C++

Fortune's algorithm for Voronoi diagram generating on the plane. Intended for runtime speed and careful handling of corner cases.

geometry - Boost.Geometry - Generic Geometry Library

  •    C++

Boost.Geometry, part of collection of the Boost C++ Libraries, defines concepts, primitives and algorithms for solving geometry problems.