-shaped point set embeddings of high-degree plane graphs
References
- BattistaG.D.EadesP.TamassiaR.TollisI.G., Graph Drawing: Algorithms for the Visualization of Graphs1999Prentice-Hall
- RahmanM.S.NakanoS.-i.NishizekiT., A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs Proc. of GD 1997Lect. Notes in Computer Science vol. 13531997Springer
- RahmanM.S.EgiN.NishizekiT., No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs Proc. of GD 2003Lect. Notes in Computer Science vol. 29122004Springer387–392
- RahmanM.S.NishizekiT.NazninM., Orthogonal drawings of plane graphs without bends J. Graph Algortihms Appl. 7 4 2003 335–362
- TamassiaR.TollisI.G.VitterJ.S., Lower bounds for planar orthogonal drawings of graphs Inform. Process. Lett. 39 1 1991 35–40
- GiacomoE.D.FratiF.FulekR.GrilliL.KrugM., Orthogeodesic point-set embedding of trees Comput. Geom. 46 8 2013 929–944
- KanoM.SuzukiK., Geometric graphs in the plane lattice Proc. of EGC 2011Lect. Notes in Computer Science vol. 75792012Springer274–281
- KhanN.KarimaN.RahmanM.S.HossainM.I., Orthogonal grid pointset embeddings of maximal outerplanar graphs Proc. of ICEEICT2014IEEE1–6
- NishizekiT.RahmanM.S., Planar graph drawing Lecture Notes Series on Computing2004
- BoseP.McAllisterM.SnoeyinkJ., Optimal algorithms to embed trees in a point set J. Graph Algorithms Appl. 1 2 1997 1–15
- BoseP., On embedding an outer-planar graph in a point set Comput. Geom. : Theory Appl. 23 3 2002 303–312