Optimal algorithms for some smallest intersection radius problems (extended abstract)
Binay Kumar Bhattacharya, Sreesh Jadhav, Asish Mukhopadhayay, Jean–Marc Robert · 1991
Article Optimal algorithms for some smallest intersection radius problems (extended abstract) Share on Authors: Binay K. Bhattacharya School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada, V5A 1S6 School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada, V5A 1S6View Profile , Sreesh Jadhav Department of Computer Science, Indian Institute of Technology, Kanpur, India Department of Computer Science, Indian Institute of Technology, Kanpur, IndiaView Profile , Asish Mukhopadhayay Department of Computer Science, Indian Institute of Technology, Kanpur, India Department of Computer Science, Indian Institute of Technology, Kanpur, IndiaView Profile , Jean-Marc Robert School of Computer Science, McGill University, 3480 University St., Montreal, P.Q., Canada, H3A 2A7 School of Computer Science, McGill University, 3480 University St., Montreal, P.Q., Canada, H3A 2A7View Profile Authors Info & Claims SCG '91: Proceedings of the seventh annual symposium on Computational geometryJune 1991 Pages 81–88https://doi.org/10.1145/109648.109657Online:01 June 1991Publication History 1citation335DownloadsMetricsTotal Citations1Total Downloads335Last 12 Months2Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access