On intersecting a set of parallel line segments with a convex polygon of minimum area
Information Processing Letters
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
The Directed Hausdorff Distance between Imprecise Point Sets
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On intersecting a set of isothetic line segments with a convex polygon of minimum area
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
The directed Hausdorff distance between imprecise point sets
Theoretical Computer Science
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Largest and smallest tours and convex hulls for imprecise points
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |