2
$\begingroup$

I am currently putting together an independent study in advanced algorithms and because of my interest in (computational) geometry, wanted to include as many interesting algorithms from this field as possible. Does anyone have any suggestions for material that might be suitable?

You may assume the math background acquired from an undergraduate CS degree, along with a high motivation to learn more if necessary (i.e. to learn about interesting problems).

$\endgroup$
1
$\begingroup$

A good starting point would be Joseph O'Rourke's site here.

$\endgroup$
0
$\begingroup$

Given a bunch of ink blobs on a plane. Find the shortest path between any two given points out of the ink and not touching the ink.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.