An embedding is the information that says how the graph is laid out with no edges crossing. As a data structure, it can be given in various ways. The simplest is for adjacency lists of each vertex to be given in sorted order clockwise or anti-clockwise.
On Jan 7, 5:10 pm, sravanreddy001 <sravanreddy...@gmail.com> wrote: > @Gene: I didn't understand on what you termed as "embedding" Can you > provide more insights on this? > > @dabbcomputers: also, listing set of points (not just one) isn't going to > be a better than O(n) solution. > for eg: a value of R that eliminates only half the points outside the > circle. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
