Greedy Drawings of Triangulations
暂无分享,去创建一个
[1] László Lovász,et al. Rubber bands, convex embeddings and graph connectivity , 1988, Comb..
[2] Petar Maymounkov,et al. Greedy Embeddings , Trees , and Euclidean vs . Lobachevsky Geometry , 2006 .
[3] Goos Kant,et al. Drawing planar graphs using the lmc-ordering , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[4] Bronisław Knaster,et al. Ein Beweis des Fixpunktsatzes für n-dimensionale Simplexe , 1929 .
[5] Ivan Stojmenovic,et al. Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.
[6] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.
[7] Brad Karp,et al. GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.
[8] J. Matousek,et al. Using The Borsuk-Ulam Theorem , 2007 .
[9] Stefan Felsner,et al. Geometric Graphs and Arrangements , 2004 .
[10] Stefan Felsner,et al. Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes , 2001, Order.
[11] J. Matousek,et al. Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry , 2007 .
[12] W. T. Tutte. Convex Representations of Graphs , 1960 .
[13] Yan Zhang,et al. Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.
[14] Éric Fusy,et al. Dissections and trees, with applications to optimal mesh encoding and to random sampling , 2005, SODA '05.
[15] Nitin H. Vaidya,et al. Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications , 1999 .
[16] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .
[17] Christos H. Papadimitriou,et al. On a Conjecture Related to Geometric Routing , 2004, ALGOSENSORS.
[18] Scott Shenker,et al. Geographic routing without location information , 2003, MobiCom '03.
[19] Walter Schnyder,et al. Embedding planar graphs on the grid , 1990, SODA '90.
[20] Ôôöøøøøóò Óó,et al. Strictly Convex Drawings of Planar Graphs , 2022 .
[21] Md. Saidur Rahman,et al. Planar Graph Drawing , 2004, Lecture Notes Series on Computing.
[22] Günter Rote. Strictly convex drawings of planar graphs , 2005, SODA.
[23] Shirshu Varma,et al. Geographic Routing in Hyperbolic Space: A Comprehensive Study , 2010 .
[24] János Pach,et al. Small sets supporting fary embeddings of planar graphs , 1988, STOC '88.
[25] Stefan Felsner,et al. Convex Drawings of 3-Connected Plane Graphs , 2005, SODA '05.
[26] Roger Wattenhofer,et al. Geometric ad-hoc routing , 2003 .
[27] Stefan Felsner,et al. Convex Drawings of 3-Connected Plane Graphs , 2004, SODA '05.