Searching for segments with largest relative overlap

DOI10.1016/0020-0190(92)90263-UzbMath0743.68126OpenAlexW2000255082WikidataQ127333706 ScholiaQ127333706MaRDI QIDQ1186585

Gerd Stöckl, Franz Aurenhammer

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90263-u

zbMATH Keywords

line segmentsrelative overlapgeometric searching

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the construction of abstract Voronoi diagrams
• A sweepline algorithm for Voronoi diagrams
• Concrete and abstract Voronoi diagrams
• Optimal Point Location in a Monotone Subdivision