Namespace Edgar.Legacy.GeneralAlgorithms.Algorithms.Polygons

Classes

CachedPolygonPartitioning

Class that computes partition and caches results for later use.

FastPolygonOverlap

Computes polygon overlap by fast caching with int aliases.

GridPolygonPartitioning

GridPolygonUtils

Class implementing utility functions for grid polygons.

PolygonOverlap

Computes polygon overlap by caching polygon partitions of polygons. See FastPolygonOverlap for a faster implementation.

PolygonOverlapBase<TShape>

Base class for implementing the IPolygonOverlap<TShape> interface.

Interfaces

IPolygonOverlap<TShape>

Interface for computing when polygons overlap.

IPolygonPartitioning

Represents algorithms that can decompose a given polygon into rectangular partitions that do not overlap and cover the whole polygon.

IPolygonUtils<T>

Represents types that can normalize given polygons.