Michael Sumner

"there's no high level funs", but see TRI/TRI0

algorithm validation

1

Stuff to consider/check - [ ] merge rearcut JS implementation with this package - [ ] set up tests that ensure the design claims are met - [ ] writer...

Explore implications of path/ring origin and bridge segments

1

There's a bit of this in the vignette. Had a conversation with a colleague and we'd both thought "hmm, which triangulations end up the same from which kinds of starting...

Totally unexplored so far is the use of earcut for topological fixes to degeneracies. With sf, this can rewind self-intersections (pesky WKT!), remove convex and concave slivers(?), what about holes...

another CGAL option

1

at this point the the exploding number of CGAL packages on CRAN, probably just dig into the impl and diy ```R x

https://github.com/stla/RCDT

support alphahull

15

Start with ```R #' @param xa a single row of ahull()$arcs rc_data

smoothr - apply to ARC

5

https://github.com/mstrimas/smoothr Apply this to arcs and recompose for topological-aware smoothing

monotone polygons

2

These will be interesting as a multiple-groupings example. Start here: https://rpubs.com/cyclemumner/pmonotone