Approximate geometric MST range queries

DOI10.4230/LIPICS.SOCG.2015.781MaRDI QIDQ5368728zbMATH OpenOpenAlexFDO

Authors Sunil Arya, David M. Mount, Eunhui Park

Publication date 10 October 2017

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.SOCG.2015.781

zbMATH Keywords

approximation algorithmsgeometric data structuresminimum spanning treesrange searching

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 2079416
• Approximate range searching
• Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
• Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
• A fast and simple algorithm for computing approximate Euclidean minimum spanning trees

Cited in

(5)

• Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
• Range-Aggregate Queries Involving Geometric Aggregation Operations
• scientific article; zbMATH DE number 2079416 (Why is no real title available?)
• Approximate range queries for clustering
• Range counting oracles for geometric problems

This page was built for publication: Approximate geometric MST range queries

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