tag:blogger.com,1999:blog-6555947.post114903660088561804..comments2014-01-12T10:46:48.153-07:00Comments on The Geomblog: Shortest Paths On Convex PolytopesSuresh Venkatasubramaniannoreply@blogger.comBlogger5125tag:blogger.com,1999:blog-6555947.post-11581027371893608552007-03-27T07:20:00.000-06:002007-03-27T07:20:00.000-06:00This may be a dumb question, but if we generalize ...This may be a dumb question, but if we generalize from 3 dimensions to n dimensions, is the problem still (relatively) easy?Kurthttp://www.blogger.com/profile/13744720784619976570noreply@blogger.comtag:blogger.com,1999:blog-6555947.post-24914296950466232182007-03-27T02:45:00.000-06:002007-03-27T02:45:00.000-06:00Kapoor can jump up and down as much as he wants, b...Kapoor can jump up and down as much as he wants, but it would not change the basic issue that he never understood the problem well enough to solve it, and his "solution" is a piece of crap that should have never been accepted to STOC. His failure to provide a full detailed version just makes it clear he never had a clue about this problem. <BR/><BR/>His claim that he solved the problem is ludicrous and should be treated with contempt.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-6555947.post-1149181404872867802006-06-01T11:03:00.000-06:002006-06-01T11:03:00.000-06:00I have spoken with H.Hoppe recently and he did agr...I have spoken with H.Hoppe recently and he did agree that their siggraph implementation is still quite complex. I believe the Fast Marching algorithm for computing shortest path on surface (continuous version of Dijkstra) is still a good option due to its simplicity of implementation.<BR/><BR/>Those who are interested in FM can send me an email! <BR/><BR/><A></A><A></A>Posted by<A><B> </B></A><A HREF="http://www.cmap.polytechnique.fr/~peyre/" REL="nofollow" TITLE="">Gabriel Peyré</A>Gabriel Peyréhttp://www.cmap.polytechnique.fr/~peyre/noreply@blogger.comtag:blogger.com,1999:blog-6555947.post-1149082758813425722006-05-31T07:39:00.000-06:002006-05-31T07:39:00.000-06:00Also, on a practical side,Surazhsky et al. demonst...Also, on a practical side,<BR/>Surazhsky et al. demonstrated (siggraph'05) an efficient implementation of Mitchell, Mount and Papadimitriou algorithm: see <A HREF="http://research.microsoft.com/~hoppe/#geodesics" REL="nofollow">here.</A>  <BR/><BR/><A></A><A></A>Posted by<A><B> </B></A>Samuel HornusSamuel Hornusnoreply@blogger.comtag:blogger.com,1999:blog-6555947.post-1149071861460031852006-05-31T04:37:00.000-06:002006-05-31T04:37:00.000-06:00Perhaps this is totally unrelated, but recently I ...Perhaps this is totally unrelated, but recently I heard about the UC Davis topologist <A HREF="http://www.math.ucdavis.edu/research/profiles/fuchs" REL="nofollow">Dmitry Fuchs</A> ' work on classification of <EM>closed</EM> geodesics on convex surfaces. Here is a link to an abstract of his recent <A HREF="http://64.233.183.104/search?q=cache:ZYNacqWUC58J:www.humboldt.edu/~math/colloquium/enquirer-v16.06.pdf+fuchs+dmitry+closed+geodesic&hl=en&ct=clnk&cd=2&client=safari" REL="nofollow">talk</A> on the subject.<BR/><BR/>Incidentally, thanks Suresh for your blog. I am not a TCS'ist myself but always read it with interest. <BR/><BR/><A></A><A></A>Posted by<A><B> </B></A><A HREF="http://ansobol.blogsome.com" REL="nofollow" TITLE="ansobol at gmail dot com">Andrei Sobolevskii</A>ansobolhttp://www.blogger.com/profile/09511696027099191902noreply@blogger.com