{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T18:27:57Z","timestamp":1778783277263,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T00:00:00Z","timestamp":1345852800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00453-012-9682-y","type":"journal-article","created":{"date-parts":[[2012,8,24]],"date-time":"2012-08-24T12:59:28Z","timestamp":1345813168000},"page":"531-544","source":"Crossref","is-referenced-by-count":7,"title":["On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs"],"prefix":"10.1007","volume":"68","author":[{"given":"Xin","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,25]]},"reference":[{"issue":"3","key":"9682_CR1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/net.21449","volume":"59","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Di Battista, G., Frati, F.: Succinct greedy drawings do not always exist. Networks 59(3), 267\u2013274 (2012)","journal-title":"Networks"},{"issue":"1","key":"9682_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.7155\/jgaa.00197","volume":"14","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. J. Graph Algorithms Appl. 14(1), 19\u201351 (2010)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"9682_CR3","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s00454-009-9169-z","volume":"42","author":"L. Castelli Aleardi","year":"2009","unstructured":"Castelli Aleardi, L., Fusy, \u00c8., Lewiner, T.: Schnyder woods for higher genus triangulated surfaces, with applications to encoding. Discrete Comput. Geom. 42(3), 489\u2013516 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"9682_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s00453-006-0177-6","volume":"47","author":"N. Bonichon","year":"2007","unstructured":"Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected planar graph. Algorithmica 47(4), 399\u2013420 (2007)","journal-title":"Algorithmica"},{"key":"9682_CR5","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/I-SPAN.2009.20","volume-title":"Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009)","author":"L. Cao","year":"2009","unstructured":"Cao, L., Strelzoff, A., Sun, J.Z.: On succinctness of geometric greedy routing in Euclidean plane. In: Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), pp. 326\u2013331 (2009)"},{"issue":"7","key":"9682_CR6","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/j.dam.2010.10.016","volume":"159","author":"M. Ben Chen","year":"2011","unstructured":"Ben Chen, M., Gortler, S.J., Gotsman, C., Wormser, C.: Distributed computation of virtual coordinates for greedy routing in sensor networks. Discrete Appl. Math. 159(7), 544\u2013560 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9682_CR7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s00454-009-9235-6","volume":"43","author":"R. Dhandapani","year":"2009","unstructured":"Dhandapani, R.: Greedy drawings of triangulations. Discrete Comput. Geom. 43(2), 375\u2013392 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"9682_CR8","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/PL00009264","volume":"23","author":"G. Di Battista","year":"1999","unstructured":"Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive reporting of disjoint paths. Algorithmica 23(4), 302\u2013340 (1999)","journal-title":"Algorithmica"},{"issue":"11","key":"9682_CR9","doi-asserted-by":"crossref","first-page":"1571","DOI":"10.1109\/TC.2010.257","volume":"60","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., Goodrich, M.T.: Succinct greedy graph drawing in the hyperbolic plane. IEEE Trans. Comput. 60(11), 1571\u20131580 (2011)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"9682_CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/A:1010604726900","volume":"18","author":"S. Felsner","year":"2001","unstructured":"Felsner, S.: Convex drawings of planar graphs and the order dimension of 3-polytopes. Order 18(1), 19\u201337 (2001)","journal-title":"Order"},{"issue":"4","key":"9682_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:ORDE.0000009251.68514.8b","volume":"20","author":"S. Felsner","year":"2003","unstructured":"Felsner, S.: Geodesic embeddings and planar graphs. Order 20(4), 135\u2013150 (2003)","journal-title":"Order"},{"issue":"1","key":"9682_CR12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00454-007-9027-9","volume":"40","author":"S. Felsner","year":"2008","unstructured":"Felsner, S., Zickfeld, F.: Schnyder woods and orthogonal surfaces. Discrete Comput. Geom. 40(1), 103\u2013126 (2008)","journal-title":"Discrete Comput. Geom."},{"key":"9682_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-642-03409-1_14","volume-title":"Proceedings of the 17th International Conference on Fundamentals of Computation Theory (FCT 2009)","author":"S. Kumar Ghosh","year":"2009","unstructured":"Kumar Ghosh, S., Sinha, K.: On convex greedy embedding conjecture for 3-connected planar graphs. In: Proceedings of the 17th International Conference on Fundamentals of Computation Theory (FCT 2009). Lecture Notes in Computer Science, vol. 5699, pp. 145\u2013156 (2009)"},{"key":"9682_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/978-3-642-10631-6_79","volume-title":"Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009)","author":"M.T. Goodrich","year":"2009","unstructured":"Goodrich, M.T., Strash, D.: Succinct greedy geometric routing in the Euclidean plane. In: Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009). Lecture Notes in Computer Science, vol. 5878, pp. 781\u2013791 (2009)"},{"key":"9682_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-642-13562-0_25","volume-title":"Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010)","author":"X. He","year":"2010","unstructured":"He, X., Zhang, H.: Schnyder greedy routing algorithm. In: Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010). Lecture Notes in Computer Science, vol. 6108, pp. 271\u2013283 (2010)"},{"key":"9682_CR16","doi-asserted-by":"crossref","first-page":"1902","DOI":"10.1109\/INFCOM.2007.221","volume-title":"Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM 2007)","author":"R. Kleinberg","year":"2007","unstructured":"Kleinberg, R.: Geographic routing using hyperbolic space. In: Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM 2007), pp. 1902\u20131909 (2007)"},{"issue":"3","key":"9682_CR17","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1007\/s00454-009-9227-6","volume":"44","author":"T. Leighton","year":"2010","unstructured":"Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. Discrete Comput. Geom. 44(3), 686\u2013705 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"9682_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-540-68552-4_6","volume-title":"Proceedings of the 7th International Workshop on Experimental Algorithms (WEA 2008)","author":"K.M. Lillis","year":"2008","unstructured":"Lillis, K.M., Pemmaraju, S.V.: On the efficiency of a local iterative algorithm to compute Delaunay realizations. In: Proceedings of the 7th International Workshop on Experimental Algorithms (WEA 2008). Lecture Notes in Computer Science, vol. 5038, pp. 69\u201386 (2008)"},{"key":"9682_CR19","first-page":"961","volume-title":"Proceedings of the 4th International Conference on Information Technology (ITNG 2007)","author":"R.B. Muhammad","year":"2007","unstructured":"Muhammad, R.B.: A\u00a0distributed geometric routing algorithm for ad hoc wireless networks. In: Proceedings of the 4th International Conference on Information Technology (ITNG 2007), pp. 961\u2013963 (2007)"},{"issue":"1","key":"9682_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"C.H. Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci. 344(1), 3\u201314 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9682_CR21","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/938985.938996","volume-title":"Proceedings of the 9th International Conference on Mobile Computing and Networking (MobiCom 2003)","author":"A. Rao","year":"2003","unstructured":"Rao, A., Ratnasamy, S., Papadimitriou, C.H., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proceedings of the 9th International Conference on Mobile Computing and Networking (MobiCom 2003), pp. 96\u2013108 (2003)"},{"issue":"4","key":"9682_CR22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W. Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order 5(4), 323\u2013343 (1989)","journal-title":"Order"},{"key":"9682_CR23","first-page":"138","volume-title":"Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1990)","author":"W. Schnyder","year":"1990","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9682-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9682-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9682-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T23:40:29Z","timestamp":1562110829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9682-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,25]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9682"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9682-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,25]]}}}