Application: gvSIG desktop

/* Spatial Operations & Editing Tools for uDig

 *

 *      http://b5m.gipuzkoa.net

 *

 * DFG-OT agrees to licence under Lesser General Public License (LGPL).

 * Foundation; version 2.1 of the License.

 *

 * This library is distributed in the hope that it will be useful,

import java.util.ArrayList;

import java.util.List;

import com.vividsolutions.jts.geom.Coordinate;

import com.vividsolutions.jts.geom.CoordinateArrays;

import com.vividsolutions.jts.geom.Geometry;

 * which is called in order to ensure propper orientation of the shell and holes.

 * </p>

 * </p>

 * @author Gabriel Roldán, Axios Engineering

 * @author Mauricio Pazos, Axios Engineering

 * @since 1.1.0

    /**

     * Removes the given edge and its related {@link DirectedEdge}'s from this graph

     * @param edge the edge to remove

     * @throws IllegalArgumentException if no enclosing DirectedEdge is found for <code>edge</code>

     * @see #remove(DirectedEdge)

    /**

     * Removes a DirectedEdge, its sym and its {@link SplitEdge} from this graph. May lead to the

     * graph containing dangling nodes.

     * @param edgeEnd

     */

    public void remove( final DirectedEdge edgeEnd ) {

    /**

     * Builds a linestrnig from splitter such that it contains no endpoints lying inside the polygon

     * @param polygon

     * @param splitter

     * @return

    /**

     * <pre>

     * <code>

     *                  +----------o-----------+

     *                  |          |           |

     *                  |          |           |

     *                  |    o__\__o_____|     |

     *                  |       /  |           |

     *                 /|\        /|\          |

     * </code>

     * </pre>

     * @throws Exception

     */

    private void buildGraph() {

        for( int i = 0; i < nParts; i++ ) {

            currGeom = linearGeom.getGeometryN(i);

            coords = currGeom.getCoordinates();

            Label label = new Label(onLoc, leftLoc, rightLoc);

            Edge edge = new SplitEdge(coords, label);

            edges.add(edge);

        }

        // for each edge in the list, adds two DirectedEdge, one reflecting

        // the given edge and other the opposite

    }

}