Dlib is a C++ toolkit containing machine learning algorithms and tools for creating complex software in C++ to solve real world problems.
Polygon and line clipping and offsetting library (C++, C#, Delphi)
The Clipper library performs clipping and offsetting for both lines and polygons. All four boolean clipping operations are supported - intersection, union, difference and exclusive-or. Polygons can be of any shape including self-intersecting polygons. 17 March 2016: Since it's been some time since the last update, some may be wondering if I no longer plan further updates. I do have plans for more updates but I also have a chronic health condition (not life threatening) that's set me back, and I don't really have a good idea when I'll restart development.
STXXL is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, containers, and algorithms that can process huge volumes of data that only fit on disks.
C++ code to count the number pages in a given PDF file.
This C++ library contains the 'PdfPageCount' class that performs the single task of finding the number of pages in a given PDF document. While the PdfPageCount class is very simple to use, the contained code is complex because the page count can be hidden in any number of places, quite often within compressed data.
Implementation of cache conscious STL lists in Frias, L., Petit, J., and Roura, S. 2009. Lists revisited: Cache-conscious STL lists. J. Exp. Algorithmics 14 (Dec. 2009), 3.5-3.27. DOI= http://doi.acm.org/10.1145/1498698.1564505
A set of tools for processing AIS data (Automatic Identification System) encompassing statistics, vessel tracking, trend analysis and not least global sharing of AIS data.
Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.
Interval Container Library (ICL): An STL based generic library for computations on intervals, interval containers and cubes
This project will attempt to provide a headers-only library in Modern C++( boost) for all the programs(including exercises) of the famous book: Introduction to Algorithms by Cormen et al, also known as CLR book.
Implementation of Multikey Quickselect and new Multikey Quicksort variants in Frias L, Roura, S. Multikey Quickselect. Technical report LSI-09-27-R, Universitat Politècnica de Catalunya, 2009. http://www.lsi.upc.edu/dept/techreps/techreps.html.
Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.
This project will host the implementation of Stanford GraphBase Library (Donald E. Knuth) in Modern C++ using boost and beyond in headers-only library.
This project attempts to host the complete re-write of all the programs(including exercises too) of the seminal volumes of The Art of Computer Programming by Donald E. Knuth in modern C++, mostly using boost in a header-only C++ library.
TRSL is a C++ library that implements several (statistical) sampling schemes behind an (STL-like) iterator interface. The library may be used e.g. in particle filtering. It is distributed under the Boost SL (BSL is a free-software license).
The project is created with an aim to provide - design patterns implemented in C++ using boost. Following are the primary requirements 1) Generic Header Only Library 2) Using Boost Libraries, Coding Style, Philosophy 3) Standard C++
fxSTL is a C++ container library. fxSTL stands for the Fixed Standard Template Library. fxSTL is not a replacement for the STL, but is rather an extension of the STL that provides implementations of fixed size containers.
A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.