{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:32:17Z","timestamp":1766377937633},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540607236"},{"type":"electronic","value":"9783540493518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0021805","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:56:38Z","timestamp":1131846998000},"page":"212-223","source":"Crossref","is-referenced-by-count":12,"title":["Drawing stressed planar graphs in three dimensions"],"prefix":"10.1007","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Garvan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"22_CR1","volume-title":"Regular Polytopes","author":"H. S. M. Coxeter","year":"1973","unstructured":"H. S. M. Coxeter. Regular Polytopes. Dover, NY, 1973."},{"key":"22_CR2","unstructured":"I. Cahit. Drawing the Complete Graph in 3-D with Straight Lines and Without Crossings. Bulletin of the ICA, Vol 12, Sep 94."},{"key":"22_CR3","first-page":"1","volume-title":"Lecture Notes in Computer Science. Volume 894","author":"R. F. Cohen","year":"1995","unstructured":"R. F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-Dimensional Graph Drawing. Proc. Graph Drawing 94. Lecture Notes in Computer Science. Volume 8941\u201311. Springer-Verlag, Berlin, 1995."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"G. Das, M. T. Goodrich. On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra. To appear, WADS 1995.","DOI":"10.1007\/3-540-60220-8_52"},{"key":"22_CR5","volume-title":"Technical Report CS89-13","author":"R. Davidson","year":"1989","unstructured":"R. Davidson and D. Harel. Drawing Graphs Nicely Using Simulated Annealing, Technical Report CS89-13, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, July 1989."},{"issue":"11","key":"22_CR6","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. M. J. Fruchterman","year":"1991","unstructured":"T. M. J. Fruchterman and E. M. Reingold. Graph Drawing by Force-directed Placement. Software \u2014 Practice and Experience, vol. 21(11), 1129\u20131164 (Nov 1991).","journal-title":"Software \u2014 Practice and Experience"},{"key":"22_CR7","volume-title":"Convex Polytopes","author":"B. Gr\u00fcnbaum","year":"1967","unstructured":"B. Gr\u00fcnbaum. Convex Polytopes. Wiley, NY, 1967."},{"key":"22_CR8","volume-title":"Shaping Space: A Polyhedral Approach","author":"B. Gr\u00fcnbaum","year":"1988","unstructured":"B. Gr\u00fcnbaum and G. C. Shephard. Duality of Polyhedra. In Shaping Space: A Polyhedral Approach. Birkhauser, Boston, 1988."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01758769","volume":"7","author":"J. E. Hopcroft","year":"1992","unstructured":"J. E. Hopcroft and P. J. Kahn. A Paradigm for Robust Geometric Algorithms. Algorithmica (1992) 7:339\u2013380.","journal-title":"Algorithmica"},{"key":"22_CR10","volume-title":"Introduction to Combinatorial Mathematics","author":"C. L. Liu","year":"1968","unstructured":"C. L. Liu. Introduction to Combinatorial Mathematics. McGraw-Hill, NY, 1968."},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1080\/14786446408643663","volume":"xxvii","author":"J. C. Maxwell","year":"1864","unstructured":"J. C. Maxwell. On Reciprocal Figures and Diagrams of Forces. Phil. Mag. S. 4. vol. xxvii. (1864) pp.250\u2013261","journal-title":"Phil. Mag. S. 4"},{"key":"22_CR12","volume-title":"Annals of Discrete Mathematics, Volume 32","author":"T. Nishizeki","year":"1988","unstructured":"T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms. Annals of Discrete Mathematics, Volume 32. North-Holland, Netherlands, 1988."},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W. T. Tutte","year":"1963","unstructured":"W. T. Tutte. How to Draw a Graph. Proc. London. Math. Soc. (3), 13 (1963), 743\u2013768.","journal-title":"Proc. London. Math. Soc. (3)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0021805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T05:27:23Z","timestamp":1549258043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0021805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540607236","9783540493518"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0021805","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}