Search Results for

    Show / Hide Table of Contents

    Namespace NetTopologySuite.Operation.Polygonize

    Contains classes to implement a polygonization algorithm. This package can be used to create polygons from fully noded linework.

    Classes

    EdgeRing

    Represents a ring of PolygonizeDirectedEdges which form a ring of a polygon. The ring may be either an outer shell or a hole.

    EdgeRing.EnvelopeAreaComparator

    Compares EdgeRings based on the area of their envelopes. Smaller envelopes sort before bigger ones. This effectively sorts EdgeRings in order of containment.

    EdgeRing.EnvelopeComparator

    Compares EdgeRings based on their envelope, using the standard lexicographic ordering. This ordering is sufficient to make edge ring sorting deterministic.

    HoleAssigner

    Assigns hole rings to shell rings during polygonization. Uses spatial indexing to improve performance of shell lookup.

    PolygonizeDirectedEdge

    A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph. May be logically deleted from the graph by setting the marked flag.

    PolygonizeEdge

    An edge of a polygonization graph.

    PolygonizeGraph

    Represents a planar graph of edges that can be used to compute a polygonization, and implements the algorithms to compute the EdgeRings formed by the graph. The marked flag on DirectedEdges is used to indicate that a directed edge has be logically deleted from the graph.

    Polygonizer

    Polygonizes a set of Geometrys which contain linework that represents the edges of a planar graph.

    • Edit this page
    In this article
    Back to top Generated by DocFX