Table of Contents

Namespace SpatialNET

Namespaces

SpatialNET.IO
SpatialNET.Imp
SpatialNET.Network

Classes

AlternativeLabelOptions

Options for SpatialNET.Shapes.FastAlternativePolygonLabelsLazy(SpatialNET.IPolygon2D,SpatialNET.Coordinate,SpatialNET.AlternativeLabelOptions). One instance can be kept and reused for every call.

BufferOptions

Options for SpatialNET.Buffering.Buffer(SpatialNET.IGeometry2D,System.Double,SpatialNET.BufferOptions,SpatialNET.IGeometryFactory,System.Nullable{System.Double}); defaults as in JTS (ADR 0006).

Buffering

Buffer as raw offset + union with SpatialNET.FillRule.Positive (ADR 0006).

Characteristics

Yes/no questions about the form of a geometry (ADR 0025): IsSimple, IsClosed, IsRing and EqualsExact.

Cleaning

Clean-up of geometries (ADR 0027): RemoveHoles, RemoveSmallParts, SnapToGrid and ReducePrecision. Results are created through the factory and restricted to what it supports (SupportsZ, SupportsM).

Constructions

Small constructions with geometric results (ADR 0019): Boundary, Densify and Reverse. Results are created through the factory and restricted to what it supports (SupportsZ, SupportsM).

Cutting

Cut according to ADR 0007: a flat list of the pieces without left/right. Cut pieces are one element each; all untouched parts or paths together form one element and keep their original coordinates (without snap rounding). If nothing is cut, the list contains exactly one element. The cutting line is not extended; Z and M at intersection points are interpolated on the original segment (ADR 0005, ADR 0015).

Envelopes

Conversions of an SpatialNET.Envelope2D to a geometry (ADR 0022).

GeometryFactory

Global access to the default SpatialNET.IGeometryFactory (ADR 0004).

LineEvents

Interval arithmetic on the events of a route (ADR 0033): which events hold at the same time (Intersect), the route cut at every boundary of two tables (Union), what one table has that the other has not (Difference), neighbours with the same value joined (Dissolve), and cutting to a range (Clip) or to a point (At). The operations compute with the M values only: no geometry, no factory. Draw an event with SpatialNET.LinearReferencing.LocateBetween(SpatialNET.IPolyline2D,System.Double,System.Double,SpatialNET.IGeometryFactory) on the calibrated route.

LinearReferencing

Linear referencing on polylines (ADR 0017): a position on a line is addressed by its length along the line or by its M value (ADR 0015). Lengths are planar (like SpatialNET.Measures.Length(SpatialNET.IPolyline2D)); the paths of a polyline are laid end to end in their order. Point-like and scalar results are values, only the pieces of Substring and SubstringByM are created through the factory.

ListViews

List views of point sequences, polylines and polygons for LINQ and foreach (ADR 0002).

Locations

Where a point lies relative to a geometry (ADR 0022). Exact: the decisions use the input coordinates without a grid, like the predicates.

Measures

Measures: area, length, envelope, centroid and distance (ADR 0012).

OffsetCurves

Offset curves following JTS OffsetCurve (ADR 0006): buffer with flat ends, raw offset of the side, matched against the buffer boundary. The result is guaranteed to lie on the buffer boundary and, at narrow spots, is a polyline with several paths. Z and M are interpolated on the nearest source segment.

OffsetOptions

Options for SpatialNET.OffsetCurves.OffsetCurve(SpatialNET.IPolyline2D,System.Double,SpatialNET.OffsetOptions,SpatialNET.IGeometryFactory,System.Nullable{System.Double}) (ADR 0006).

Overlays

Overlay operations (ADR 0005/0012): snap rounding to the grid size (gridSize → SpatialNET.Precision.DefaultGridSize → automatic), winding numbers with a selectable SpatialNET.FillRule, strict semantics (results are dimension-homogeneous, touch and collapse remnants are dropped). Results are valid, rings closed, shells counter-clockwise; Z and M (ADR 0015) at new vertices are interpolated on the original segment, at crossings the Z and M of the first operand apply.

PointEvents

Operations on the point events of a route (ADR 0040), as SpatialNET.LineEvents is for the line events: which point events lie in a range (Between), which lie in which line event (Within), and which lie in none (Outside). They compute with the M values only: no geometry, no factory, no database access. Draw point events with SpatialNET.LinearReferencing.LocateEvents``1(SpatialNET.IPolyline2D,System.Collections.Generic.IEnumerable{SpatialNET.PointEvent{``0}},SpatialNET.IGeometryFactory).

Precision

Global settings for the grid size of the overlays (ADR 0005).

Preparation

Preparation for repeated predicates (ADR 0013).

PreparedGeometry

A geometry prepared for repeated predicates (ADR 0013): a snapshot of the coordinates plus a segment index. Later changes to the host object have no effect. Results are identical to the unprepared predicates; fast paths exist for SpatialNET.PreparedGeometry.Intersects(SpatialNET.IGeometry2D)/SpatialNET.PreparedGeometry.Disjoint(SpatialNET.IGeometry2D), point-in-area and SpatialNET.PreparedGeometry.Contains(SpatialNET.IGeometry2D) of an area (vertices and segment contacts through the index); everything else, and a contact with the boundary that has no witness, goes through the exact SpatialNET.Relations.Relate(SpatialNET.IGeometry2D,SpatialNET.IGeometry2D).

Relations

Spatial predicates based on DE-9IM (ADR 0013): exact on the input coordinates, without a grid. Areas by even-odd (ADR 0003), line boundaries by mod-2. If a geometry is empty, only SpatialNET.Relations.Disjoint(SpatialNET.IGeometry2D,SpatialNET.IGeometry2D) is true. Invalid input is handled deterministically and without exceptions, but without any guarantee of mutual consistency.

Shapes

Bounding shapes and label points (ADR 0026): MinimumRotatedRectangle, MinimumBoundingCircle and Polylabel.

Simplification

Simplification by Douglas-Peucker (ADR 0012).

Smoothing

Rounding of lines (ADR 0043): Smooth replaces the corners of a polyline, or the rings of a polygon, by curves. It is meant for contour lines and everything else that was digitised or computed as a chain of straight pieces.

Snapping

Snapping to a target (ADR 0046): SnapTo moves the vertices of a geometry that lie within a tolerance of another geometry onto it, so that data with small errors (digitised by hand, projected, rounded) meets where it is meant to meet. The exact operations (Cut, the overlays, the predicates) stay exact; snapping is the step before them: cutter.SnapTo(polygon, 0.01).Cut(polygon).

SpatialIndex<T>

A static, bulk-loaded spatial index over envelopes with a payload (ADR 0014). The tree is packed once with the Sort-Tile-Recursive (STR) method and never changes afterwards; to reflect changes, build a new index.

SpatialIndexing

Building and querying a SpatialNET.SpatialIndex`1 from geometries (ADR 0014).

Transformations

Coordinate transformations with geometric results (ADR 0025): Translate, Scale, Rotate and the general Transform. Every vertex is mapped, X and Y by the transformation, Z and M are kept (unless Transform changes them). Results are created through the factory and restricted to what it supports (SupportsZ, SupportsM).

Triangulation

A triangulated surface (ADR 0037, ADR 0038): vertices, triangles that know their neighbours, and what a terrain model needs from it: the triangle at a point, the height at a point, contour lines. It is made from points (the Delaunay triangulation), from points and lines that must be kept (a constrained Delaunay triangulation, for break lines), or from a polygon (the triangles inside it).

Validation

Validity according to ADR 0003: area by even-odd, OGC rules for crossings and touches. A missing closing point and the ring orientation are irrelevant; a ring in a hole is an island, not an error. Decisions are exact (orient2d).

ValidationResult

The result of a validity check.

Structs

Circle

A circle: a centre and a radius (ADR 0026).

Coordinate

A coordinate as a value. Algorithms pass results to the SpatialNET.IGeometryFactory exclusively as coordinates (ADR 0004).

Envelope2D

The envelope: the axis-aligned rectangle that encloses a geometry. A value, not an interface; hosts do not have to implement anything (ADR 0002).

IntersectionMatrix

The DE-9IM intersection matrix: dimension of the intersection of interior (I), boundary (B) and exterior (E) of two geometries; −1 means empty ("F").

LineEvent<T>

An event on a route: something that holds for a range of M values, with a value of the host's choice (ADR 0033). A speed limit from kilometre 3.0 to 5.5, a surface, a road class.

LineProjection

Where a point lies relative to a line (ADR 0035), the result of SpatialNET.LinearReferencing.ProjectDetailed(SpatialNET.IPolyline2D,SpatialNET.Coordinate).

PointEvent<T>

An event at one M value on a route (ADR 0040): a bridge at kilometre 8.2, a damage report, a hydrant. The point-like counterpart of SpatialNET.LineEvent`1.

PolygonPart

A polygon part: a shell together with the holes that lie directly inside it (ADR 0003).

ValidationIssue

A validity finding with its location.

VoronoiCell

The cell of one site of a Voronoi diagram (ADR 0036).

Interfaces

IGeometry2D

Common base type of all geometries: point, multipoint, polyline and polygon. Paths and rings are parts of a geometry and are not geometries themselves (ADR 0002).

IGeometryFactory

The geometry factory: creates the result geometries of an algorithm from coordinates as host geometries (ADR 0004).

IMultiPoint2D

A set of points as one geometry.

IPath2D

A path: a line string as part of an SpatialNET.IPolyline2D.

IPoint2D

A point in the plane.

IPoint3D

A point with a height. Algorithms interpolate Z at new vertices if the points involved are SpatialNET.IPoint3D; 3D exists only on points (ADR 0002).

IPointCollection2D

An ordered sequence of points; common base of SpatialNET.IPath2D, SpatialNET.IRing2D and SpatialNET.IMultiPoint2D.

IPointM

A point with a measure (M). Algorithms carry M and interpolate it at new vertices if the points involved are SpatialNET.IPointM, but never compute with it (ADR 0015). It is independent of SpatialNET.IPoint3D: a point may implement either or both.

IPolygon2D

A polygon as a flat list of rings that together describe one or more parts (corresponds to MultiPolygon).

IPolyline2D

A polyline made of one or more paths (corresponds to MultiLineString).

IRing2D

A ring: a closed path as part of an SpatialNET.IPolygon2D.

Enums

CapStyle

Shape of the line ends (ADR 0006).

FillRule

The fill rule: decides from the winding number of a point whether it belongs to the area of an input (ADR 0005).

JoinStyle

Shape of the corners on the outside (ADR 0006).

Location

The position of a point relative to a geometry (ADR 0022).

MExtrapolation

What SpatialNET.LinearReferencing.CalibrateM(SpatialNET.IPolyline2D,System.Collections.Generic.IEnumerable{SpatialNET.Coordinate},System.Double,SpatialNET.MExtrapolation,SpatialNET.IGeometryFactory) gives the line before its first and after its last anchor (ADR 0030).

SmoothingMethod

How SpatialNET.Smoothing.Smooth(SpatialNET.IPolyline2D,System.Int32,SpatialNET.SmoothingMethod,SpatialNET.IGeometryFactory) rounds a line (ADR 0043).

SnapEnds

How a loose end reaches the target in SpatialNET.SnapMode.Ends (ADR 0046).

SnapMode

What SpatialNET.Snapping.SnapTo(SpatialNET.IPolyline2D,SpatialNET.IGeometry2D,System.Double,SpatialNET.SnapMode,SpatialNET.SnapEnds,SpatialNET.IGeometryFactory) moves (ADR 0046).

ValidationIssueKind

Kind of a validity finding (ADR 0003/0012).