/*
* Copyright (c) 2016 Vivid Solutions.
*
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* and Eclipse Distribution License v. 1.0 which accompanies this distribution.
* The Eclipse Public License is available at http://www.eclipse.org/legal/epl-v10.html
* and the Eclipse Distribution License is available at
*
* http://www.eclipse.org/org/documents/edl-v10.php.
*/
package org.locationtech.jts.noding;
import java.util.Collection;
/**
* Computes all intersections between segments in a set of {@link SegmentString}s.
* Intersections found are represented as {@link SegmentNode}s and added to the
* {@link SegmentString}s in which they occur.
* As a final step in the noding a new set of segment strings split
* at the nodes may be returned.
*
* @version 1.7
*/
public interface Noder
{
/**
* Computes the noding for a collection of {@link SegmentString}s.
* Some Noders may add all these nodes to the input SegmentStrings;
* others may only add some or none at all.
*
* @param segStrings a collection of {@link SegmentString}s to node
*/
void computeNodes(Collection segStrings);
/**
* Returns a {@link Collection} of fully noded {@link SegmentString}s.
* The SegmentStrings have the same context as their parent.
*
* @return a Collection of SegmentStrings
*/
Collection getNodedSubstrings();
}