Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/2491
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Karmakar, A | - |
dc.contributor.author | Roy, S | - |
dc.contributor.author | Das, Sandip | - |
dc.date.accessioned | 2011-08-11T11:25:02Z | - |
dc.date.available | 2011-08-11T11:25:02Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Proceedings of the 19th annual canadian conference on computational geometry,P273-276 | en_US |
dc.identifier.uri | http://hdl.handle.net/10263/2491 | - |
dc.language.iso | en | en_US |
dc.subject | Center problem | en_US |
dc.subject | Forthest point voronoi diagram | en_US |
dc.subject | Geometric duality | en_US |
dc.subject | Computational geometry | en_US |
dc.subject | Algorithm | en_US |
dc.title | fast computation of smallest enclosing circle with center on a query line segment | en_US |
dc.type | Article | en_US |
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.