Anuhya
asked on
Minimum spanning circle
Show how the furthest-point Vorronoi diagram can be used to compute the smallest-circle that surrounds a given point set.Assume F(P) is available
courtesy Joseph O Rourke 5.5.6
courtesy Joseph O Rourke 5.5.6
ASKER
hey but i wanted a proof not the articel found online, that i could search too please reply fast
regards
anuhya
regards
anuhya
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
ASKER
thanx i found that already but didnt know how to put that stuff as proof to compute smallest circle , well....anything more specific please let me know and i didnt understand the relavance of page 195...is sit the theorem 6.2.1????
regards
Anuhya
regards
Anuhya
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
http://www.cs.mcgill.ca/~netty/html/507.html
Cheers!
sunnycoder