I/O-efficient well-separated pair decomposition and applications

DOI10.1007/s00453-005-1197-3zbMath1099.68121OpenAlexW2103317190MaRDI QIDQ2505500

Sathish Govindarajan, Tamás Lukovszki, Norbert Zeh, Anil Maheshwari

Publication date: 26 September 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-005-1197-3

zbMATH Keywords

external-memory algorithm

Mathematics Subject Classification ID

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

Related Items (2)

I/O-efficient algorithms for computing planar geometric spanners ⋮ Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

This page was built for publication: I/O-efficient well-separated pair decomposition and applications