Debian logoDebian Screenshots >
agnostic and easy to use AJAX library for django
Sorry - no description available.
Documentation for Plexus Maven Plugin
Sorry - no description available.
Perl module to calculate a convex hull using Andrew's monotone chain algorithm
Math::ConvexHull::MonotoneChain optionally exports a single function convex_hull which calculates the convex hull of the input points and returns it. Andrew's monotone chain convex hull algorithm constructs the convex hull of a set of 2-dimensional points in O(n*log(n)) time. . It does so by first sorting the points lexicographically (first by x-coordinate, and in case of a tie, by y-coordinate), and then constructing upper and lower hulls of the points in O(n) time. It should be somewhat faster than a plain Graham's scan (also O(n*log(n))) in practice since it avoids polar coordinates.
ORFEO Toolbox library - OTBImageIO
Sorry - no description available.
Compressed variant of the Java bitset class
The bit array data structure is implemented in Java as the BitSet class. Unfortunately, this fails to scale without compression. . JavaEWAH is a word-aligned compressed variant of the Java bitset class. It uses a 64-bit run-length encoding (RLE) compression scheme. It trades-off some compression for better processing speed. It also has a 32-bit version which compresses better, but is not as fast. . In general, the goal of word-aligned compression is not to achieve the best compression, but rather to improve query processing time. Hence, the class tries to save CPU cycles, maybe at the expense of storage. However, the EWAH scheme implemented is always more efficient storage-wise than an uncompressed bitmap as implemented in the BitSet class). Unlike some alternatives, javaewah does not rely on a patented scheme.
ORFEO Toolbox library - OTBImageManipulation
Sorry - no description available.