Abstract: The present invention provides a method, system and computer program product for routing multiple paths through polygonal obstacles. In a preferred embodiment, the method begins by offsetting the initial paths through the obstacles from the obstacles to form adjusted paths. If it is determined that any adjusted path encounters a new intersection, the adjusted path or paths are modified to form revised paths. The vertices of each obstacle are labeled. All the revised and all the adjusted paths are sorted. Then, according to their sorted order, the revised and the adjusted paths are reconstructed to form offset paths.

Abstract: A method, apparatus, and computer instructions for managing traffic information in a data processing system in a vehicle using peer to peer connections. A traffic situation is identified. A traffic data packet is generated in response to identifying the traffic situation. The traffic data packet includes traffic information and an area of influence. A traffic data packet is transmitted to another vehicle using a peer to peer connection based on a location of the vehicle with respect to the area of influence.

Abstract: A method, computer program product, and a data processing system for determining an edge for inversion in a cyclic compound directed graph. A plurality of graph nodes of a graph are evaluated for generation of a first node order subset pair. A determination that the graph requires a recursive evaluation for completing node ordering of the plurality of graph nodes is made. The graph is divided into a plurality of graph partitions, and respective node order subset pairs are generated for the graph partitions.