mlsanityData to 14 Oct 2026

Skeletonization via Local Separators

arXiv 2007.03483 ↗First posted 7 Jul 2020cs.CG cs.GRcited by 6

Not on the map. Why?

Abstract (arXiv)

We propose a new algorithm for curve skeleton computation which differs from previous algorithms by being based on the notion of local separators. The main benefits of this approach are that it is able to capture relatively fine details and that it works robustly on a range of shape representations. Specifically, our method works on shape representations that can be construed as a spatially embedded graphs. Such representations include meshes, volumetric shapes, and graphs computed from point clouds. We describe a simple pipeline where geometric data is initially converted to a graph, optionally simplified, local separators are computed and selected, and finally a skeleton is constructed. We test our pipeline on polygonal meshes, volumetric shapes, and point clouds. Finally, we compare our results to other methods for skeletonization according to performance and quality.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 2; 2025: 0; 2026: 1.

6 papers.