Approximate center points in dense point sets
From MaRDI portal
Recommendations
Cites work
- A note on the Weber location problem
- Computing a centerpoint of a finite planar set of points in linear time
- Cutting dense point sets in half
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 804595 (Why is no real title available?)
- scientific article; zbMATH DE number 850290 (Why is no real title available?)
- scientific article; zbMATH DE number 917638 (Why is no real title available?)
- scientific article; zbMATH DE number 6965874 (Why is no real title available?)
- Local convergence in a generalized Fermat-Weber problem
- Local convergence in Fermat's problem
- Range Searching and Point Location among Fat Objects
Cited in
(8)- A p-center grid-positioning aggregation procedure
- A linear time deterministic algorithm to find a small subset that approximates the centroid
- scientific article; zbMATH DE number 1526594 (Why is no real title available?)
- On strong centerpoints
- Approximate center points with proofs
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- The centroid of points with approximate weights
- Approximate centerpoints with proofs
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)
