Excess in arrangements of segments

DOI10.1016/0020-0190(96)00065-8zbMath0875.68902OpenAlexW2054310938WikidataQ127472421 ScholiaQ127472421MaRDI QIDQ1349964

Micha Sharir

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00065-8

zbMATH Keywords

Computational geometryCombinatorial geometrySegment intersection

Mathematics Subject Classification ID

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

Cites Work

• Finding the upper envelope of n line segments in O(n log n) time
• The complexity and construction of many faces in arrangements of lines and of segments
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• On the general motion-planning problem with two degrees of freedom
• Castles in the air revisited
• Unnamed Item

This page was built for publication: Excess in arrangements of segments