Computing balanced convex partitions of lines

DOI10.1007/s00453-022-01082-zMaRDI QIDQ6174825

Sergey Bereg

Publication date: 17 August 2023

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

computational geometrybalanced partitionsham-sandwich cut

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Optimal slope selection via expanders
• Orthogonal equipartitions
• Randomized optimal algorithm for slope selection
• On computing the length of longest increasing subsequences
• Balanced convex partitions of measures in \(\mathbb R^{2}\)
• Optimal slope selection via cuttings
• Generalizing ham sandwich cuts to equitable subdivisions
• A center transversal theorem for hyperplanes and applications to graph drawing
• Balanced convex partitions of lines in the plane
• Corrigendum: Topologically sweeping an arrangement
• Discrete geometry on colored point sets in the plane -- a survey
• Longest Increasing and Decreasing Subsequences
• Computing Least Median of Squares Regression Lines and Guided Topological Sweep
• An Optimal-Time Algorithm for Slope Selection
• A survey of mass partitions
• A RANDOMIZED ALGORITHM FOR SLOPE SELECTION