From bb4a2669be15b2367dcdb256c480b68ec3bc011f Mon Sep 17 00:00:00 2001 From: Anshul Singhvi Date: Wed, 17 Jul 2024 10:08:30 +0530 Subject: [PATCH] Refactor name to `MonotoneChainMethod Co-authored-by: Daniel VandenHeuvel <95613936+DanielVandH@users.noreply.github.com> --- src/methods/convex_hull.jl | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/src/methods/convex_hull.jl b/src/methods/convex_hull.jl index edf781b20..9fd0dfe6e 100644 --- a/src/methods/convex_hull.jl +++ b/src/methods/convex_hull.jl @@ -61,15 +61,15 @@ This is a pure Julia algorithm which provides an optimal Delaunay triangulation. See also [`convex_hull`](@ref) """ -struct DelaunayTriangulationMethod end +struct MonotoneChainMethod end -# , [`DelaunayTriangulationMethod`](@ref), [`EarCutMethod`](@ref). +# , [`MonotoneChainMethod`](@ref), [`EarCutMethod`](@ref). # GrahamScanMethod, etc. can be implemented in GO as well, if someone wants to... -convex_hull(geometries) = convex_hull(DelaunayTriangulationMethod(), geometries) +convex_hull(geometries) = convex_hull(MonotoneChainMethod(), geometries) # TODO: have this respect the CRS by pulling it out of `geometries`. -function convex_hull(::DelaunayTriangulationMethod, geometries) +function convex_hull(::MonotoneChainMethod, geometries) # Extract all points as tuples. We have to collect and allocate # here, because DelaunayTriangulation only accepts vectors of # point-like geoms.