I added a couple of images to the JTS PR: https://github.com/locationtech/jts/pull/775
Blog post coming soon. This triangulation implementation uses Ear-Clipping, so is only usable on polygons. It would be nice to have an implementation for Constrained Delaunay on linear inputs. The Tri data structure is a good way of constructing and representing this, so maybe that can have soon (perhaps via use of Chew's algorithm). It's also worth noting that another reason for creating the Tri data structure is to make it easier to implement concave hull algorithms, which hopefully will also appear soon. On Thu, Sep 23, 2021 at 2:20 PM Paul Ramsey <pram...@cleverelephant.ca> wrote: > FYI on a big new port dropping from JTS today. Maybe Martin can share some > pictures. > > - CAPI: GEOSConstrainedDelaunayTriangulation, builds a constrained > triangulation > of an input Polygon or MultiPolygon, returning a > GeometryCollection(Polygon) > of the triangles. > > > > https://github.com/libgeos/geos/commit/896af228fb27076bdd7f0529d55b3e79e3f10191 > _______________________________________________ > geos-devel mailing list > geos-devel@lists.osgeo.org > https://lists.osgeo.org/mailman/listinfo/geos-devel >
_______________________________________________ geos-devel mailing list geos-devel@lists.osgeo.org https://lists.osgeo.org/mailman/listinfo/geos-devel
