tag:blogger.com,1999:blog-6555947.post115700412734776059..comments2024-03-14T01:32:43.610-06:00Comments on The Geomblog: Planar graphs and Steinitz's theoremSuresh Venkatasubramanianhttp://www.blogger.com/profile/15898357513326041822noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-6555947.post-1157051354281685702006-08-31T13:09:00.000-06:002006-08-31T13:09:00.000-06:00This  might be helpful. The bound shown here ...<A HREF="http://www-m10.mathematik.tu-muenchen.de/~richter/Papers/PDF/19_RealizationSpaces.pdf" REL="nofollow">This</A>  might be helpful. The bound shown here (Chapter 13) beats Onn/Strumfels in every case and Goodrich et. al in the case of simplicial polytopes.<BR/> <BR/><BR/><A></A><A></A>Posted by<A><B> </B></A>RaghavanAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-6555947.post-1157032400084276032006-08-31T07:53:00.000-06:002006-08-31T07:53:00.000-06:00Write to Lovasz. He might reply. Posted by An...Write to Lovasz. He might reply. <BR/><BR/><A></A><A></A>Posted by<A><B> </B></A>AnonymousAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-6555947.post-1157006015230209182006-08-31T00:33:00.000-06:002006-08-31T00:33:00.000-06:00It doesn't answer your question, but I think the C...It doesn't answer your question, but I think the Chrobak Goodrich and Tamassia paper from SoCG'96 has better bounds than the Onn and Sturmfels one you state: O(n log n) bits per coordinate instead of O(n^3). <BR/><BR/><A></A><A></A>Posted by<A><B> </B></A><A HREF="http://11011110.livejournal.com/" REL="nofollow" TITLE="">D. Eppstein</A>Anonymousnoreply@blogger.com