{"repo":"gdagstn/oveRlay","free":true,"listed":false,"github":"https://github.com/gdagstn/oveRlay","clone":"git clone https://github.com/gdagstn/oveRlay.git","description":"Annotate 2D point clouds using overlay polygons","language":"R","stars":15,"topics":["data-visualization"],"license":null,"category":"analytics","readme_excerpt":"oveRlay Annotate 2D point clouds using overlay polygons. Motivation and methodology This R package (in development) offers an alternative to the concave hull geom in ggforce by taking an entirely different approach: - creates a regularly spaced grid of squares, whose side is defined by a step size (a fraction of the range of your data) - calculates which squares contain points, with user-defined tolerance, and keeps the vertices - uses isoband to calculate a contour joining vertices on the grid - calculates holes, i.e. which polygons are inside other polygons, so that their space can be \"subtracted\" when plotting by ggplot2 - optional smoothing (via smoothr ), offset (via polyclip ) and joining of overlapping polygons (again via polyclip ) The resulting polygon (or sets of polygons) follow the shapes of the point cloud quite closely and, if a point or set of points is far enough, another disjointed polygon is created. This allows to deal with outliers nicely; the current ggforce implementation of geom mark hull() is super fast, but will enclose all points no matter how far they are. Moreover, and to the best of my knowledge, the concave hull in ggforce does not allow holes. The step size controls how granular the resulting polygon set is: small step sizes will create shapes that follow the data more closely (at the expense of computing speed and, eventually, usability). Here is an example of how different step sizes behave on the same set of 2D rnorm(1000) : Installation You ","default_branch":null,"files":null,"tree":[],"storefront":"/r/gdagstn","claimed":false,"request_supported":{"post":"https://gitbuyer.com/r/gdagstn/oveRlay/request-supported","requests":0},"note":"indexed from public GitHub; nothing is for sale on this page. Clone it from GitHub. Paid listings live at /search."}