Re:Solving the minimum cut problem for undirected graphs
by regularfry on Wednesday April 17, 2024 @12:07PM
(#40066613)
For a use case, graph cutting was one of the original techniques behind seam carving: https://en.wikipedia.org/wiki/Seam_carving
[ Parent
| on HN ]
Re:Solving the minimum cut problem for undirected graphs
by ygra on Thursday April 18, 2024 @05:00AM
(#40074267)
We've implemented making space in a graph drawing a few years ago where a user would basically say that they want some free space somewhere in an existing drawing and everything else should shift in a way to clear that space, but also to not destroy the drawing too much. One approach I thought about was basically seam carving (apparently coming full circle here), the "global" strategy here: http://live.yworks.com/demos/layout/clearrectanglearea/ ... although sadly it happened to not work out that well in practice and we found better ways of handling that.