-
Hi @ailich,
see https://github.com/Nowosad/supercells/tree/estimate_compactness.
I took your code, cleaned it a bit, decided to return all the values (and not just summaries), and added an R fun…
-
## Issue Details
Hi and thank you very much for developing CGAL,
I use the library for computing segment Voronoi diagrams and I came across an issue (hereafter drastically simplified to a MWE).
…
-
Currently:
- sprinkled throughout the code are some commented-out `cout
-
I'm currently using rgeo for a large, web based, GIS project which needs to perform a Voronoi computation on a set of points and it ocurred to me that I could write it natively inside the rgeo gem.
I…
-
**Describe the bug**
I want to perform a Voronoi tessellation of a periodic window, but I'm solving this by making mirror copies of points where necessary and then clipping my polygons to the origi…
-
## Background
[L'Huilier's Theorem](http://mathworld.wolfram.com/LHuiliersTheorem.html) allows for the calculation of the surface area of a [spherical polygon](http://mathworld.wolfram.com/SphericalP…
-
This may not be the best place to solve this, but I can imagine non overlapping buffers, that represent the area in which each line/feature is the nearest one with no overlaps, would be useful. Reprod…
-
About optimization analysis at
[OSM_Streets_SetorCensitario_spatial_match.sql](https://github.com/lucasmation/osm_cnefe_import/blob/master/OSM_Streets_SetorCensitario_spatial_match.sql) and [stacko…
-
Algorithms:
- [ ] Pick random point in triangulated polygon. `O(n)`.
- [ ] Build a mass-balanced triangle tree such that a random polygon point can be sampled in `O(log n)`.
- [ ] `kernel :: Sim…
-
**[ ID ]** 856f5f30-fc75-4506-99be-1fb49963a643
**[ Submitter's Name ]** Simon Allen
**[ Submitter's Affiliated Organisation ]** The Swarm
**[ Submitter's Twitter ]** @entertheswarm
**[ Space ]** ex…