Complexsive Systems

For the next several months I will be developing a geometric package for computing geometric queries and calculations needed for AI. Areas of study include Polygon Triangulation, Convex Hulls, Point Location (maybe), Line Intersection, KD Trees, Binary Space Partitions (maybe), Voronoi Diagrams and Delauney Triangulations. The geometric package will provide classes for solving proximity queries for collision avoidance, path finding, spatial awareness, steering behaviors and creating virtual worlds. Also demos will be included.

Some useful links:

Computational Geometry: Algorithms and Applications – http://www.cs.uu.nl/geobook/
Computing the Voronoi Diagram – http://cg.scs.carleton.ca/~mathieu/mcouture/node2.html
Approximate Nearest Neighbor Searching – http://www.cs.umd.edu/~mount/ANN/
Computational Geometry Software Libraries – http://compgeom.cs.uiuc.edu/~jeffe/compgeom/software.html
CGAL – http://www.cgal.org
Collision Detection and Proximity Queries – http://gamma.cs.unc.edu/research/collision/
Sweep Line Algorithm – http://en.wikipedia.org/wiki/Sweep_line_algorithm

Complexsive Systems develops Artificial Intelligence (AI) middleware in Java for game development, visualization systems, and real time simulations and animations.  Complexsive utilizes technologies such as neural networks, genetic programming, fuzzy logic, finite state machines and planning algorithms to solve problems in path finding, intelligent control, machine learning and decision-making.