Computing the Smallest T-Shaped Polygon Containing k Points
From MaRDI portal
Publication:4780527
DOI10.1080/00207160211923zbMath1007.65011OpenAlexW2043143954MaRDI QIDQ4780527
Vanam Srilakshmi, Michiel H. M. Smid
Publication date: 20 November 2002
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160211923
Cites Work
- Unnamed Item
- Unnamed Item
- On enclosing k points by a circle
- Iterated nearest neighbors and finding minimal polytopes
- Computing the smallest \(k\)-enclosing circle and related problems
- On geometric optimization with few violated constraints
- Finding k points with minimum diameter and related problems
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Static and Dynamic Algorithms for k-Point Clustering Problems