Vertical decomposition: dynamic merge and refactoring

Refactor the vertical decomposition and implement the ability to dynamically update it upon an object merge.

fix issue #9 (closed)

Remaining TODOs:

• Cleanup
• Refactor handleMultipleIntersectedTrapezoids
• Handle overlapping segment addition
• Introduce points into the structure
• Figure out where adjacencies don't get added properly
• Ensure no trapezoid adjacency clipping happens
• Ensure that the first trapezoid intersected by a new segment is properly computed.
• Ensure segment-to-object gets updated properly
• Run 200+ consecutive random tests successfully

Bonus TODOs:

• Measure depth of the search structure.
• Construct using the random incremental approach.
• Consider rebuilding if the depth of the search structure gets too large in comparison with the number of segments.