NEWS.md

In coolbutuseless/triangular: Decompose Complex Polygons into Triangles

triangular 0.1.8 2020-10-05

• decompose() now passes through all other columns on the data.frame. However, the value in each column is enforced as a single unique value across the group i.e. you cannot have different values at different vertices within a single polygon group.

triangular 0.1.7 2020-10-01

• Simplified return structure to just be the data.frame of triangles of interest
• There's a segfault in RTriangle that doesn't occur if I use polyclip::polysimplify() for duplicated vertices. Resurrecting that code from v0.1.5.
• If there aren't dupe verts then RTriangle is all that's needed.

triangular 0.1.6 2020-10-01

• polyclip package is now only used for pointinpolygon() calculation

triangular 0.1.5 2020-10-01

• Only use polyclip::polysimplify() if there are duplicated vertices, otherwise, all test examples work with RTriangle::triangulate() without any other processing.

triangular 0.1.4 2020-09-30

• new accetpable column in triangles_df returned by decompose().
  • acceptable = interior & !too_thin
  • where too_thin indicates triangles in which the centroid lies on the boundary, which makes them impossibly thin

triangular 0.1.3 2020-09-28

• Combine polyclip::polysimplify() with RTriangle::triangulate() to now cope with:
  • holes in polygons
  • self intersecting polygons
  • polygons with duplicated vertices

triangular 0.1.2 2020-09-27

• Refactor: Now use polyclip package for point-in-polygon calculations. Removed bespoke point-in-polygon R functions from this package.

triangular 0.1.1 2020-09-27

• Refactor: abstracting 'point-in-polygons'

triangular 0.1.0 2020-09-26

• Initial release

coolbutuseless/triangular documentation built on Oct. 9, 2020, 9:39 p.m.