UserFriendly Strip Comments


	The Daily Static UF Archives Register UF Membership Ad Free Site Postcards Community Geekfinder UFie Gear Advertise on UF Forum Rules & FAQ Username Password Create a New Account

Back to UserFriendly Strip Comments Index

geometry problem	by dennismv	2007-07-29 16:44:09
"Nearest Neighbours", repeatedly?	by williamashbless	2007-07-29 17:34:02
In O(n^2) time you can figure out which points of the set of n are in or out of a particular circle. (Just test to see if each point falls inside the circle radius). If the number of points that can fall in the circle is fixed, you can improve on that time bounds with the O(n log n) nearest-neighbour algorithm. Not sure if the whole removing-points thing until all of them are gone has a specific name, though. But I'm sure that part of the problem isn't what you're most interested in... it's the optimal choice of circles you're after? The second part of the question is ill-formed. You could simply have d be large enough so that only one circle is needed. There must be some sort of other constraint.
[ Reply ]
I'm pretty sure it is Dominating Set (n/t)	by imperito	2007-07-29 17:37:19

[Todays Cartoon Discussion] [News Index]

Come get yer ARS (Account Registration System) Source Code here!
All images, characters, content and text are copyrighted and trademarks of J.D. Frazer except where other ownership applies. Don't do bad things, we have lawyers.
UserFriendly.Org and its operators are not liable for comments or content posted by its visitors, and will cheerfully assist the lawful authorities in hunting down script-kiddies, spammers and other net scum. And if you're really bad, we'll call your mom. (We're not kidding, we've done it before.)