koobas.hobune.stream
2D Geometry / Topology Algorithm help
Requesting known Geometry / Topology Algorithm OR any advice on methodology.
Not totally sure about the "shortest lines possible" part, but that's the best way I can think to describe the choice to form an edge. Conceptually, it's like wrapping a rubber band around a cluster of pegs, but preferring shorter segments to longer ones.
I've been doodling with ways to handle this programmatically, but nothing terribly clever has occurred. Resultant data format doesn't matter much, I guess any sequential collection of points or line segments would do.
Any thoughts? I appreciate your time! :3
It sounds like you're describing alpha shapes, which can be derived from a Delauney triangulation of a set of data. http://alastaira.wordpress.com/2011/03/22/alpha-shapes-and-concave-hulls/
Accepting as correct because I recognize this concept and don't recall ever finding a superior alternative.
Thanks!
