Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
暂无分享,去创建一个
[1] San Skulrattanakulchai,et al. 4-edge-coloring Graphs of Maximum Degree 3 in Linear Time , 2002, Inf. Process. Lett..
[2] János Pach,et al. Embedding Planar Graphs at Fixed Vertex Locations , 1998, GD.
[3] Csaba D. Tóth,et al. Graphs that admit right angle crossing drawings , 2010, Comput. Geom..
[4] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[5] Sergio Cabello. Planar embeddability of the vertices of a graph using a fixed point set is NP-hard , 2006, J. Graph Algorithms Appl..
[6] Alexander Wolff,et al. Manhattan-Geodesic Embedding of Planar Graphs , 2009, Graph Drawing.
[7] Xavier Goaoc,et al. Untangling a Planar Graph , 2009, Discret. Comput. Geom..
[8] R. Pollack,et al. Embedding a planar triangulation with vertices at specified points , 1991 .
[9] Stephan Olariu,et al. An Optimal Greedy Heuristic to Color Interval Graphs , 1991, Inf. Process. Lett..
[10] Walter Didimo,et al. Drawing graphs with right angle crossings , 2009, Theor. Comput. Sci..
[11] Alexander Wolff,et al. Untangling a Planar Graph , 2008, SOFSEM.
[12] Emilio Di Giacomo,et al. Orthogeodesic point-set embedding of trees , 2013, Comput. Geom..
[13] Gerhard J. Woeginger,et al. Reconstructing sets of orthogonal line segments in the plane , 1993, Discret. Math..
[14] Sartaj Sahni,et al. Single Bend Wiring , 1986, J. Algorithms.
[15] Emilio Di Giacomo,et al. Orthogeodesic Point-Set Embedding of Trees , 2011, GD.
[16] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..
[17] Peter Eades,et al. Effects of Crossing Angles , 2008, 2008 IEEE Pacific Visualization Symposium.
[18] Alexander Wolff,et al. Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles , 2011, Graph Drawing.
[19] Michael Kaufmann,et al. Journal of Graph Algorithms and Applications Embedding Vertices at Points: Few Bends Suffice for Planar Graphs , 2022 .
[20] Emilio Di Giacomo,et al. Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings , 2009, Theory of Computing Systems.
[21] Ioannis G. Tollis,et al. Efficient Orthogonal Drawings of High Degree Graphs , 2000, Algorithmica.