Lin.ear th.inking

My previous blog post reviewed the concept of the Hausdorff distance (which more descriptively could be called farthest distance.)

The Hausdorff Distance is a useful spatial function which can appear slightly mysterious.

Some spatial use cases require identifying "narrow" or "skinny" polygons.

The JTS Topology Suite has been rolling out the capability to manage polygonal coverages.

A previous post introduced a new algorithm in the JTS Topology Suite called RelateNG.

The most fundamental and widely-used operations in the JTS Topology Suite are the ones that evaluate topological relationships between geometries.

A new capability for the JTS Topology Suite is operations to process Simple Polygonal Coverages.

The next operation delivered in the build-out of Simple Polygonal Coverages in the JTS Topology Suite is Coverage Union.

Recently JTS gained the ability to compute Concave Hulls of point sets.

There is an elegant mathematical theory of binary relations.

The previous post discussed polygonal coverages and outlined the plan to support them in the JTS Topology Suite.

An important concept in spatial data modelling is that of a coverage.

JTS 1.19 has just been released!

The previous post introduced the new ConcaveHullOfPolygons class in the JTS Topology Suite.

A common spatial need is to compute a polygon which contains another set of polygons.

The electrons were hardly dry on the JTS Outer and Inner Polygon Hull post when another interesting use case popped up on GIS StackExchange.

The JTS Topology Suite recently gained the ability to compute concave hulls.

As the title of this blog indicates, I'm a fan of linearity.

A common spatial need is to find a polygon that accurately represents a set of points.

Offset curves (also known as parallel curves) are an oft-requested feature in JTS.

Every so often I produce an image in the JTS TestBuilder which strikes me as worthy of capture.

A (long) while ago I posted about "soon-to-be-released" JTS code for polygon triangulation using Ear Clipping.

Recently a GEOS patch was contributed to change the KdTree query implementation to use an explicit stack rather than recursion.

In a previous post I described how the JTS Topology Suite operation IsSimpleOp has been completely rewritten to reduce code dependencies, improve performance, and provide a simpler, more understandable implementation.

Hard to believe that the JTS Topology Suite is almost 20 years old.