• 0001 Own algorithms, no third-party geometry engine
  • 0002 Geometry interfaces: count + indexer, flat ring list, Z only on the point
  • 0003 Holes: even-odd on input, parts in the result
  • 0004 Geometry factory: coordinate-based, optional parameter with a global default
  • 0005 Overlay: OverlayNG-style pipeline with winding numbers and snap rounding
  • 0006 Buffer as raw offset + union(Positive), OffsetCurve after the JTS pattern
  • 0007 Cut: flat list of pieces, untouched parts stay together and unrounded
  • 0008 Test strategy: shared WKT fixtures, NTS oracle at run time, two implementations
  • 0009 SpatialNET.IO: WKT and GeoJSON via the factory, geometries only
  • 0010 Playground projection: server-side with Proj4Net, default auto-UTM, distances in CRS units
  • 0011 Playground: "map first", minimal API without a frontend build, UI from explicit algorithm descriptors
  • 0012 API signatures: typed overloads, values instead of geometries for point-like measures, fixed exception rules
  • 0013 Predicates: full DE-9IM, public Relate, prepared geometries as a snapshot
  • 0014 Public spatial index: static, STR-packed, over envelopes with a payload
  • 0015 M values: carried and interpolated like Z, never evaluated by the geometry algorithms
  • 0016 WKB: read ISO and EWKB, write ISO, through the factory
  • 0017 Linear referencing: by length and by M, first hit along the line, values instead of geometries
  • 0018 UnionAll: cascaded union over the spatial index, one grid for all steps
  • 0019 Measure and point helpers: nearest points, distance test, point on surface, boundary, densify, reverse
  • 0020 MakeValid: even-odd normalisation through the overlay core, no mixed dimensions
  • 0021 Spatial join: pairs of two indexes by a joint walk, envelopes only
  • 0022 Locate, envelope helpers and rectangle clip
  • 0023 LineMerge and Polygonize
  • 0024 PreparedGeometry thread-safe, with distance
  • 0025 Transformations, checks and Hausdorff distance
  • 0026 Bounding shapes and label point
  • 0027 Clean-up: holes, small parts, grid
  • 0028 Public API tracking and the criteria for 1.0
  • 0029 Delaunay triangulation and concave hull
  • 0030 CalibrateM: M values from anchor points
  • 0031 Project with a window of lengths
  • 0032 LocateBetween and LocateAlong
  • 0033 Event tables: interval arithmetic on M ranges
  • 0034 LocateFeature: from a geometry to ranges of M
  • 0035 Offset to the side and projection with distance and side
  • 0036 Voronoi diagram and the edges of the Delaunay triangulation
  • 0037 The triangulation as a surface: neighbours, height, contour lines
  • 0038 Constrained Delaunay triangulation and the triangulation of a polygon
  • 0039 Terrain analysis: slope, aspect, area, volume and a line over the surface
  • 0040 Point events and drawing events on the route
  • 0041 Natural neighbour interpolation, quality meshes and questions about whole surfaces
  • 0042 Height bands: the areas between two heights
  • 0043 Smoothing lines, and the surface under contour lines
  • 0044 The viewshed: what can be seen from a point
  • 0045 A mutable mesh for Delaunay refinement
  • 0046 Snapping to a target
  • 0047 UnionAll of polygons in one pass
  • 0048 Vector tiles (MVT) in SpatialNET.IO
  • 0049 Networks: a graph held by the host behind IGraph
  • 0050 Building a network: joining line ends, splitting lines, shards
  • 0051 Tracing: one run per source, supply areas and the supply of sinks
  • 0052 Network rules: counting the neighbours of an element
  • 0053 Fast label points, and the net path of the clip prefilter
  • 0054 Coincident real nodes: the host may choose a winner