Optimal algorithms for some smallest intersection radius problems (extended abstract)

Authors:
Binay K. Bhattacharya;Sreesh Jadhav;Asish Mukhopadhayay;Jean-Marc Robert
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada, V5A 1S6;Department of Computer Science, Indian Institute of Technology, Kanpur, India;Department of Computer Science, Indian Institute of Technology, Kanpur, India;School of Computer Science, McGill University, 3480 University St., Montreal, P.Q., Canada, H3A 2A7
Venue:
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Year:
1991

Citing 7
Cited 1

Linear programming in O(n × 3d2) time

Information Processing Letters
On a multidimensional search technique and its application to the Euclidean one centre problem

SIAM Journal on Computing
Linear programming and convex hulls made easy

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
Weighted Orthogonal Linear L\infty-Approximation and Applications

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Stabbing Parallel Segments with a Convex Polygon (Extended Abstract)

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Computational geometry.

Computational geometry.

Efficient algorithms for geometric optimization

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract