The \(k\)-centrum straight-line location problem
From MaRDI portal
Publication:655169
DOI10.1007/s10852-009-9119-zzbMath1229.65050OpenAlexW2093341719MaRDI QIDQ655169
Antonio J. Lozano, Frank Plastria, Juan A. Mesa
Publication date: 2 January 2012
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-009-9119-z
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (2)
On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ Location of weighted anti-ordered median straight lines with Euclidean distances
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The power of geometric duality revisited
- Finding transversals for sets of simple geometric figures
- Linear facility location. Solving extensions of the basic problem
- Locating lines and hyperplanes. Theory and algorithms
- Continuous location of dimensional structures.
- An efficient \(k\) nearest neighbors searching algorithm for a query line.
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
- An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
- Computing Envelopes in Four Dimensions with Applications
- The \(k\)-centrum multi-facility location problem
- An improved bound for \(k\)-sets in three dimensions
- Gauge distances and median hyperplanes
This page was built for publication: The \(k\)-centrum straight-line location problem