Halving balls by a hyperplane in deterministic linear time

DOI10.20382/JOCG.V11I1A23MaRDI QIDQ3387273zbMATH OpenOpenAlexFDO

Authors

Publication date 12 January 2021

Full work available at URL https://jocg.org/index.php/jocg/article/download/3113/2851

zbMATH Keywords

\(m\)-separatorhalving hyperplaneprune-and-search paradigm

Mathematics Subject Classification ID

Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Halving balls in deterministic linear time
• Cutting a bunch of grapes by a plane
• Separating collections of points in Euclidean spaces
• Algorithms for ham-sandwich cuts
• Balanced line separators of unit disk graphs

Cited in

(6)

• Halving balls in deterministic linear time
• scientific article; zbMATH DE number 741006 (Why is no real title available?)
• Separators for sphere-packings and nearest neighbor graphs
• New algorithms and bounds for halving pseudolines
• Balanced line separators of unit disk graphs
• Balanced line separators of unit disk graphs

This page was built for publication: Halving balls by a hyperplane in deterministic linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387273)