Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/2491| 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 Algorithm |
| Issue Date: | 2007 |
| Citation: | Proceedings of the 19th annual canadian conference on computational geometry,P273-276 |
| URI: | http://hdl.handle.net/10263/2491 |
| Appears in Collections: | Computer Science |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Binder1.pdf | 786.94 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.