Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
From MaRDI portal
Publication:1041762
DOI10.1016/j.ipl.2005.02.013zbMath1182.68331MaRDI QIDQ1041762
Sandip Das, Subhas C. Nandy, Partha P. Goswami
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.02.013
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Square and Rectangle Covering with Outliers, Covering points by disjoint boxes with outliers, SMALLEST COLOR-SPANNING OBJECT REVISITED
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enclosing \(k\) points in the smallest axis parallel rectangle
- Iterated nearest neighbors and finding minimal polytopes
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
- On geometric optimization with few violated constraints
- On the computational power of pushdown automata
- Finding k points with minimum diameter and related problems
- Printer graphics for clustering
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Static and Dynamic Algorithms for k-Point Clustering Problems