Separating and shattering long line segments
From MaRDI portal
Publication:293158
DOI10.1016/S0020-0190(97)00188-9zbMATH Open1338.68262MaRDI QIDQ293158FDOQ293158
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
Recommendations
Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- New applications of random sampling in computational geometry
- Applications of random sampling in computational geometry. II
- On a class of \(O(n^ 2)\) problems in computational geometry
- Applications of random sampling to on-line algorithms in computational geometry
- On lazy randomized incremental construction
- Topologically sweeping an arrangement
- On the union of fat wedges and separating a collection of segments by a line
- Applications of a semi-dynamic convex hull algorithm
- The complexity and construction of many faces in arrangements of lines and of segments
Cited In (4)
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)