scientific article; zbMATH DE number 1554935

zbMATH Open0953.68608MaRDI QIDQ4525264FDOQ4525264

Authors: Maurizio Talamo, Paolo G. Franciosa 

Publication date: 21 January 2001

Title of this publication is not available (Why is that?)

Recommendations

• Halfspace range search: An algorithmic application of k-sets
• How hard is half-space range searching?
• Efficient searching with linear constraints
• Halfplanar range search in linear space and \(O(n^{0.695})\) query time
• Reporting points in halfspaces

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Partial orders, general (06A06) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (5)

• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
• Efficient searching with linear constraints
• A data structure for lattice representation
• Halfspace range search: An algorithmic application of k-sets
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep

This page was built for publication:

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