Approximate center points in dense point sets
From MaRDI portal
Publication:287016
DOI10.1016/S0020-0190(97)00017-3zbMATH Open1336.68268OpenAlexW1994242911MaRDI QIDQ287016FDOQ287016
Authors: Knut Verbarg
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00017-3
Recommendations
Cites Work
- Title not available (Why is that?)
- Computing a centerpoint of a finite planar set of points in linear time
- Cutting dense point sets in half
- Range Searching and Point Location among Fat Objects
- Local convergence in Fermat's problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local convergence in a generalized Fermat-Weber problem
- A note on the Weber location problem
Cited In (7)
- Approximate center points with proofs
- Approximate centerpoints with proofs
- A linear time deterministic algorithm to find a small subset that approximates the centroid
- Title not available (Why is that?)
- The centroid of points with approximate weights
- On strong centerpoints
- A \(p\)-center grid-positioning aggregation procedure
This page was built for publication: Approximate center points in dense point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287016)