Please use this identifier to cite or link to this item:
Title: fast computation of smallest enclosing circle with center on a query line segment
Authors: Karmakar, A
Roy, S
Das, Sandip
Keywords: Center problem
Forthest point voronoi diagram
Geometric duality
Computational geometry
Issue Date: 2007
Citation: Proceedings of the 19th annual canadian conference on computational geometry,P273-276
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.