In the Search for Good Neck Cuts
By: Sam Ruggerio, Sariel Har-Peled
We study the problem of finding neck-like features on a surface. Applications for such cuts include robotics, mesh segmentation, and algorithmic applications. We provide a new definition for a surface bottleneck -- informally, it is the shortest cycle relative to the size of the areas it separates. Inspired by the isoperimetric inequality, we formally define such optimal cuts, study their properties, and present several algorithms inspired by these ideas that work surprisingly well in practice. For examples of our algorithms, see https://neckcut.space.
Similar Papers
Edge-wise Topological Divergence Gaps: Guiding Search in Combinatorial Optimization
Computational Geometry
Finds shortest routes faster using shape math.
Connectivity-Preserving Cortical Surface Tetrahedralization
Computational Geometry
Makes computer models of bodies work better.
Solving Euclidean Problems by Isotropic Initialization
Computational Geometry
Solves hard shape problems by using a simpler math.