Package NetTopologySuite.Triangulate

Namespaces
package	QuadEdge

Classes
class	ConformingDelaunayTriangulationBuilder
	A utility class which creates Conforming Delaunay Trianglulations from collections of points and linear constraints, and extract the resulting triangulation edges or triangles as geometries. More...
class	ConformingDelaunayTriangulator
	Computes a Conforming Delaunay Triangulation over a set of sites and a set of linear constraints. More...
class	ConstraintEnforcementException
	Indicates a failure during constraint enforcement. More...
class	ConstraintVertex
	A vertex in a Constrained Delaunay Triangulation. The vertex may or may not lie on a constraint. If it does it may carry extra information about the original constraint. More...
interface	ConstraintVertexFactory
	An interface for factories which create a ConstraintVertex More...
class	DelaunayTriangulationBuilder
	A utility class which creates Delaunay Trianglulations from collections of points and extract the resulting triangulation edges or triangles as geometries. More...
interface	IConstraintSplitPointFinder
	An interface for strategies for determining the location of split points on constraint segments. The location of split points has a large effect on the performance and robustness of enforcing a constrained Delaunay triangulation. Poorly chosen split points can cause repeated splitting, especially at narrow constraint angles, since the split point will end up encroaching on the segment containing the original encroaching point. With detailed knowledge of the geometry of the constraints, it is sometimes possible to choose better locations for splitting. More...
class	IncrementalDelaunayTriangulator
	Computes a Delauanay Triangulation of a set of Vertexes, using an incrementatal insertion algorithm. More...
class	MidpointSplitPointFinder
	A simple split point finder which returns the midpoint of the split segment. This is a default strategy only. Usually a more sophisticated strategy is required to prevent repeated splitting. Other points which could be used are: More...
class	NonEncroachingSplitPointFinder
	A strategy for finding constraint split points which attempts to maximise the length of the split segments while preventing further encroachment. (This is not always possible for narrow angles). More...
class	Segment
	Models a constraint segment in a triangulation. A constraint segment is an oriented straight line segment between a start point and an end point. More...
class	SplitSegment
	Models a constraint segment which can be split in two in various ways, according to certain geometric constraints. More...
class	VertexTaggedGeometryDataMapper
	Creates a map between the vertex Coordinates of a set of Geometrys, and the parent geometry, and transfers the source geometry data objects to geometry components tagged with the coordinates. More...
class	VoronoiDiagramBuilder
	A utility class which creates Voronoi Diagrams from collections of points. The diagram is returned as a IGeometryCollection of Polygons, clipped to the larger of a supplied envelope or to an envelope determined by the input sites. More...