General methods for 'all elements' and 'all pairs' problems

DOI10.1016/0020-0190(81)90011-9zbMath0457.68057OpenAlexW2151335991MaRDI QIDQ1151265

Mark H. Overmars

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90011-9

zbMATH Keywords

decomposable searching problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Some principles for dynamizing decomposable searching problems
• Maintenance of configurations in the plane
• Decomposable searching problems
• Rectilinear line segment intersection, layered segment trees, and dynamization

This page was built for publication: General methods for 'all elements' and 'all pairs' problems