t2gran / areavisibility

Visualize algorithm for generating a grid inside an area

Areavisibility

Visualize algorithm for generating a grid inside an area.

Compile

Use Maven to build mvn install

Run

Run Main. To switch algorithm change the main at line 35.

Algorithms

All visibility lines

This just add all visibility lines - this is very simple, but create to many lines and dificult to debug visually.

• AllVLStrategy

Delaunay lines

This strategy is similar to the Delaunay triangulation.

When all visibility lines are computed, the algorithm sort them in increasing length order and add them one by one if they not intersect with one of the existing added visibility lines.

• DeluneyVLStrategy

Improvments

Before visibility lines generation

Not all points in an erea is connected to the rest of the graph. Only entrance points are connected. If the edge is convex between two points the points in between can be dropped. Note! This may have affect on other things, like linking in Stops etc. We can safly do this point pruning BEFORE we generate visibility lines.

After visibility lines generation

If we want to use the area graph in routing we can improve space and performance by removing all edges that is not part of an optimal path. Route between all pairs of entrences in an area and mark all edges used. Then drop all vertexes and edges not visited.