|
Fishnet 2.0.1
Framework for Graph-Based Analysis of GIS Vector Data
|
Wrapper around GDAL's Delaunay triangulation (GDALTriangulationCreateDelaunay). More...
#include <DelaunayTriangulation.hpp>
Public Types | |
| using | point_type = P |
| using | numeric_type = typename P::numeric_type |
Public Member Functions | |
| DelaunayTriangulation (util::forward_range_of< P > auto const &points, double tolerance=0.0, bool onlyEdges=false) | |
| Construct from a forward range of points. | |
| fishnet::Option< std::unordered_set< Segment< numeric_type > > > | edges () const noexcept |
| Get the unique undirected edges of the triangulation. | |
| fishnet::Option< std::vector< Triangle< numeric_type > > > | triangles () const noexcept |
Wrapper around GDAL's Delaunay triangulation (GDALTriangulationCreateDelaunay).
Takes a range of IPoint-conforming points, feeds them to GDAL, and exposes the result as fishnet Triangle objects and unique Segment edges.
| P | point type conforming to IPoint |
| using fishnet::geometry::DelaunayTriangulation< P >::numeric_type = typename P::numeric_type |
| using fishnet::geometry::DelaunayTriangulation< P >::point_type = P |
|
inlineexplicit |
Construct from a forward range of points.
| points | range of points to triangulate |
|
inlinenoexcept |
Get the unique undirected edges of the triangulation.
Each edge is returned as a Segment. Deduplication is performed so every edge appears exactly once. Segment's commutative operator== and hash make this trivial.
Returns an empty Option if the triangulation failed.
|
inlinenoexcept |