Self-intersection elimination algorithm using graph
Original Publication Date: 2000-May-01
Included in the Prior Art Database: 2003-Jun-19
Disclosed is an algorithm for self-intersection elimination of closed loop. In this algorithm, topology of self-intersections is presented using a graph structure. Then eliminate all self-intersections by traversing the graph. A topology of self-intersections in loop is presented using a graph as Fig.1. Fig.1 a graph for the topology of self-intersections Pseudo code to build a graph is shown below.