Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Clustering algorithms based on minimum and maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Finding k points with minimum diameter and related problems
Journal of Algorithms
Static and dynamic algorithms for k-point clustering problems
Journal of Algorithms
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Enclosing k points in the smallest axis parallel rectangle
Information Processing Letters
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Nordic Journal of Computing
Computational Geometry: Theory and Applications
Square and Rectangle Covering with Outliers
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Covering points by disjoint boxes with outliers
Computational Geometry: Theory and Applications
k-enclosing axis-parallel square
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Roundabout collision avoidance for multiple robots based on minimum enclosing rectangle
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.89 |
Given a set of n points in 2D, the problem of identifying the smallest rectangle of arbitrary orientation, and containing exactly k(=