News for hackers. Stuff that matters.
Re:What are the lesser known but cool data structures? by sjs on Sunday May 23, 2010 @12:13AM (#1371769)
Not sure if kd-trees are lesser known, but they are neat. I only learned about them recently so to me they were "lesser known".

"In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). kd-trees are a special case of BSP trees." -- http://en.wikipedia.org/wiki/Kd-tree

Re:What are the lesser known but cool data structures? by cloudkj on Sunday May 23, 2010 @04:32PM (#1372940)
I second kd-trees. I also only recently learned them, and at first encounter thought that they are in concept similar to binary space partitions used in computer graphics. Nearest neighbor search can be implemented using a pretty simple two-dimensional kd-tree. Useful for things like finding the n closest neighboring points for a given point on a plane (used for mapping applications, etc.)