everything you ever wanted to know about font rasterization

This package provides a general framework for developing spatial indices. Currently it defines generic interfaces, provides simple main memory and disk based storage managers and a robust implementation of an R*-tree, an MVR-tree and a TPR-tree. In addition the library includes a 3-dimensional R-tree visualization plug-in (example image below; requires Java3D runtime). This library is free software published under the GNU Lesser General Public License. You may copy, modify and use freely.

In this post I’ll explain and demonstrate an algorithm that simulates a group of entities grouping together, illustrating something called “flocking”. I think it’s quite neat because the flock exhibits some complex collective intelligence when just a few simple governing rules are applied to each entity. The original flocking algorithm was developed by Craig Reynolds in 1986

Implementing distributed hash tables. What we’d like to do is store a dictionary of key-value pairs across a cluster of computers, preferably in a way that makes it easy to manipulate the dictionary without having to think about the details of the cluster.

Clear explanations of some non-trivial computer algorithms. Levenshtein Automata, Log-structured storage, spatial indexing, Hilbert Curves, anagram trees and BK-trees

Algorithms for identifying body text from a web page using machine learning, statistics and a wide rage of heuristics