Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/2491
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKarmakar, A-
dc.contributor.authorRoy, S-
dc.contributor.authorDas, Sandip-
dc.date.accessioned2011-08-11T11:25:02Z-
dc.date.available2011-08-11T11:25:02Z-
dc.date.issued2007-
dc.identifier.citationProceedings of the 19th annual canadian conference on computational geometry,P273-276en_US
dc.identifier.urihttp://hdl.handle.net/10263/2491-
dc.language.isoenen_US
dc.subjectCenter problemen_US
dc.subjectForthest point voronoi diagramen_US
dc.subjectGeometric dualityen_US
dc.subjectComputational geometryen_US
dc.subjectAlgorithmen_US
dc.titlefast computation of smallest enclosing circle with center on a query line segmenten_US
dc.typeArticleen_US
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
Binder1.pdf786.94 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.