fast computation of smallest enclosing circle with center on a query line segment

Simple item page
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

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Binder1.pdf
Size:
786.94 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Computer Science