I'm curious about how to modify a convex hull algorithm so it will take into account different radii for the points involved, basically a convex hull algorithm for random circles instead of random points.
I've found a few papers on the topic, but they are a bit beyond my understanding, I was hoping you could break it down and make things clearer.
I'm curious about how to modify a convex hull algorithm so it will take into account different radii for the points involved, basically a convex hull algorithm for random circles instead of random points. I've found a few papers on the topic, but they are a bit beyond my understanding, I was hoping you could break it down and make things clearer.
A few links I've found on the subject. https://franknielsen.github.io/ConvexHullDisk/ https://link.springer.com/article/10.1007/s10898-021-01002-5 https://www.sciencedirect.com/science/article/pii/092577219290015K