Separator for $c$-Packed Segments and Curves
Computational Geometry
2026-04-07 v1
Authors:
Sariel Har-Peled
Abstract
We provide a simple algorithm for computing a balanced separator for a set of segments that is c-packed, showing that the separator cuts only O(c) segments. While the result was known before, arguably our proof is simpler.
Cite
@article{arxiv.2604.04011,
title = {Separator for $c$-Packed Segments and Curves},
author = {Sariel Har-Peled},
journal= {arXiv preprint arXiv:2604.04011},
year = {2026}
}
Related papers
View all related →
Computational Geometry · Computer Science
A Simple Proof of the Existence of a Planar Separator
Sariel Har-Peled
2025-10-07
Computational Geometry · Computer Science
A Simple Algorithm for Computing a Cycle Separator
Sariel Har-Peled, Amir Nayyeri
2018-01-19
Data Structures and Algorithms · Computer Science
Combinatorial Geometry of Graph Partitioning - I
Manjish Pal
2010-11-22
Distributed, Parallel, and Cluster Computing · Computer Science
A Simple Distributed Deterministic Planar Separator
Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann
2026-02-27
Computational Geometry · Computer Science
A WSPD, Separator and Small Tree Cover for c-packed Graphs
Lindsey Deryckere, Joachim Gudmundsson, André van Renssen, Yuan Sha +1
2025-05-13
Data Structures and Algorithms · Computer Science
Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
Jack Spalding-Jamieson
2025-11-18
Combinatorics · Mathematics
On weighted sublinear separators
Zdeněk Dvořák
2021-09-20
Data Structures and Algorithms · Computer Science
Towards an $O(\sqrt[3]{\log n})$-Approximation Algorithm for {\sc Balanced Separator}
Manjish Pal
2009-07-10
Computational Complexity · Computer Science
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs
Chetan Gupta, Rahul Jain, Raghunath Tewari
2020-05-14
Data Structures and Algorithms · Computer Science
Separators for Planar Graphs that are Almost Trees
Linda Cai, Sariel Har-Peled, Simiao Ye
2018-08-09
Computational Geometry · Computer Science
Geometric Separability using Orthogonal Objects
Abidha V P, Pradeesha Ashok
2022-01-31
Distributed, Parallel, and Cluster Computing · Computer Science
Distributed Balanced Partitioning via Linear Embedding
Kevin Aydin, MohammadHossein Bateni, Vahab Mirrokni
2015-12-10
Data Structures and Algorithms · Computer Science
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition
Lorenzo Orecchia, Nisheeth K. Vishnoi
2010-10-21
Data Structures and Algorithms · Computer Science
Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator
Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi
2011-11-08
Computational Geometry · Computer Science
Star-Based Separators for Intersection Graphs of $c$-Colored Pseudo-Segments
M. de Berg, B. M. P. Jansen, J. S. K. Lamme
2025-11-10
Computer Vision and Pattern Recognition · Computer Science
A Graph Multi-separator Problem for Image Segmentation
Jannik Irmai, Shengxian Zhao, Jannik Presberger, Bjoern Andres
2023-07-11
Computer Vision and Pattern Recognition · Computer Science
Compassionately Conservative Balanced Cuts for Image Segmentation
Nathan D. Cahill, Tyler L. Hayes, Renee T. Meinhold, John F. Hamilton
2018-03-28
Computational Geometry · Computer Science
Computing the Fr\'echet Distance When Just One Curve is $c$-Packed: A Simple Almost-Tight Algorithm
Jacobus Conradi, Ivor van der Hoog, Thijs van der Horst, Tim Ophelders
2025-12-23
Discrete Mathematics · Computer Science
On the Parameterized Complexity of Computing Balanced Partitions in Graphs
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondřej Suchý
2016-01-12
Computational Geometry · Computer Science
Balanced partitions of 3-colored geometric sets in the plane
Sergey Bereg, Matias Korman, Rodrigo I. Silveira, Ferran Hurtado +5
2017-08-22
Computational Geometry · Computer Science
Approximating the Fr\'echet distance when only one curve is $c$-packed
Joachim Gudmundsson, Tiancheng Mai, Sampson Wong
2024-11-08
Combinatorics · Mathematics
Partition functions for dense instances of combinatorial enumeration problems
Alexander Barvinok
2013-05-14
Data Structures and Algorithms · Computer Science
Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems
Batya Kenig
2026-04-28
Number Theory · Mathematics
Complex Divisor Functions
Colin Defant
2018-01-11
Data Structures and Algorithms · Computer Science
Partitioning a Graph into Small Pieces with Applications to Path Transversal
Euiwoong Lee
2016-07-19