Separating and shattering long line segments

DOI10.1016/S0020-0190(97)00188-9MaRDI QIDQ293158zbMATH OpenFDO

Authors Alon Efrat, Otfried Cheong

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019097001889?np=y

zbMATH Keywords

computational geometryBSP-treesline separation

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Separating and shattering long line segments
• On the union of fat wedges and separating a collection of segments by a line
• Separating collections of points in Euclidean spaces
• Shattering a set of objects in 2D
• scientific article; zbMATH DE number 6850368

Cites work

• Applications of a semi-dynamic convex hull algorithm
• Applications of random sampling in computational geometry. II
• Applications of random sampling to on-line algorithms in computational geometry
• New applications of random sampling in computational geometry
• On a class of \(O(n^ 2)\) problems in computational geometry
• On lazy randomized incremental construction
• On the union of fat wedges and separating a collection of segments by a line
• The complexity and construction of many faces in arrangements of lines and of segments
• Topologically sweeping an arrangement

Cited in

(4)

• Locating an obnoxious line among planar objects
• Separating and shattering long line segments
• Shattering a set of objects in 2D
• Separating overlapped intervals on a line

This page was built for publication: Separating and shattering long line segments

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