Triangulation

Jerome asked for suggestion on programming triangulation of cell positioning. He has a list of position IDs, and wants to add which of the other points are connected to that point. The number of connected point is not always same, so single position should have a flexible memory allocation.

My suggestion was to make a 2D binary matrix of Number of Positions x Number of Positions, and fill 1 for direct connections while the others 0. In this way list scanning and referencing should be fast, while the memory allocation is stably defined.