Planar graph embedding book unclear description -
I am searching for a linear-timetable graph embedding algorithm. I have found a book "A Grid on Drawing a Plain Graph for a Linear-Time Algorithm" - M. Choback, THPayne.
They write in the algorithm statement "We believe that J is already triangular and embedded in the plane, and that is given to an authentic order of the G."
It is strange that the algorithm whose purpose is to embed the plane, it is necessary to embed the already calculated plane.
How can this be explained? And then I should use the algorithm (s) to embed the plane if I have only proximity matrix / list.
There are more variations of graph embedding problems.
In the article that you have got to deal with embedding the grid in the grid, it is to identify the corner of the graph with the grid's vatics, to hide non-straight lines such edges if I think right , Then you are normally working with an embedded graph in a plane.
While grid embedding is the solution to your problem, the graphic planner will have to change the embed to fit the grid with straight lines in the form of edges and it's really okay what's the matter with the article.
For a special algorithm for plumber embedding, it can be useful (implementing it can be a challenge though):
Comments
Post a Comment