{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:25Z","timestamp":1725761125964},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_16","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"173-184","source":"Crossref","is-referenced-by-count":0,"title":["A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Igamberdiev","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1090\/S0002-9947-1961-0120222-7","volume":"99","author":"G.E. Andrews","year":"1961","unstructured":"Andrews, G.E.: A lower bound for the volume of strictly convex bodies with many boundary lattice points. Trans. Amer. Math. Soc.\u00a099, 272\u2013277 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"369","DOI":"10.4171\/dm\/214","volume":"11","author":"I. B\u00e1r\u00e1ny","year":"2006","unstructured":"B\u00e1r\u00e1ny, I., Rote, G.: Strictly convex drawings of planar graphs. Documenta Math.\u00a011, 369\u2013391 (2006)","journal-title":"Documenta Math."},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-15775-2_10","volume-title":"Algorithms \u2013 ESA 2010","author":"K. Buchin","year":"2010","unstructured":"Buchin, K., Schulz, A.: On the number of spanning trees a planar graph can have. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 110\u2013121. Springer, Heidelberg (2010)"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0925-7721(97)00006-0","volume":"8","author":"G. Das","year":"1997","unstructured":"Das, G., Goodrich, M.T.: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees. Computational Geometry: Theory and Applications\u00a08(3), 123\u2013137 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Schulz, A.: Embedding stacked polytopes on a polynomial-size grid. In: Proc. 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1177\u20131187. ACM Press (2011)","DOI":"10.1137\/1.9781611973082.89"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/BFb0021805","volume-title":"Graph Drawing","author":"P. Eades","year":"1996","unstructured":"Eades, P., Garvan, P.: Drawing stressed planar graphs in three dimensions. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 212\u2013223. Springer, Heidelberg (1996)"},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01758769","volume":"7","author":"J.E. Hopcroft","year":"1992","unstructured":"Hopcroft, J.E., Kahn, P.J.: A paradigm for robust geometric algorithms. Algorithmica\u00a07(4), 339\u2013380 (1992)","journal-title":"Algorithmica"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jctb.2000.2027","volume":"82","author":"L. Lov\u00e1sz","year":"2001","unstructured":"Lov\u00e1sz, L.: Steinitz representations of polyhedra and the Colin de Verdi\u00e8re number. J. Comb. Theory, Ser. B\u00a082(2), 223\u2013236 (2001)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1080\/14786446408643663","volume":"27","author":"J.C. Maxwell","year":"1864","unstructured":"Maxwell, J.C.: On reciprocal figures and diagrams of forces. Phil. Mag. Ser.\u00a027, 250\u2013261 (1864)","journal-title":"Phil. Mag. Ser."},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00454-010-9301-0","volume":"45","author":"A.R. Mor","year":"2011","unstructured":"Mor, A.R., Rote, G., Schulz, A.: Small grid embeddings of 3-polytopes. Discrete & Computational Geometry\u00a045(1), 65\u201387 (2011)","journal-title":"Discrete & Computational Geometry"},{"key":"16_CR12","first-page":"125","volume":"35","author":"S. Onn","year":"1994","unstructured":"Onn, S., Sturmfels, B.: A quantitative Steinitz\u2019 theorem. Beitr\u00e4ge zur Algebra und Geometrie\u00a035, 125\u2013129 (1994)","journal-title":"Beitr\u00e4ge zur Algebra und Geometrie"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Richter-Gebert, J.: Realization Spaces of Polytopes. Lecture Notes in Mathematics, vol.\u00a01643. Springer (1996)","DOI":"10.1007\/BFb0093761"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-642-55566-4_33","volume":"25","author":"G. Rote","year":"2003","unstructured":"Rote, G., Santos, F., Streinu, I.: Expansive motions and the polytope of pointed pseudo-triangulations. Discrete and Computational Geometry\u2013The Goodman-Pollack Festschrift\u00a025, 699\u2013736 (2003)","journal-title":"Discrete and Computational Geometry\u2013The Goodman-Pollack Festschrift"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.7155\/jgaa.00216","volume":"15","author":"A. Schulz","year":"2011","unstructured":"Schulz, A.: Drawing 3-polytopes with good vertex resolution. Journal of Graph Algorithms and Applications\u00a015(1), 33\u201352 (2011)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"16_CR16","first-page":"1","volume-title":"Encyclop\u00e4die der mathematischen Wissenschaften","author":"E. Steinitz","year":"1916","unstructured":"Steinitz, E.: Polyeder und Raumeinteilungen. In: Encyclop\u00e4die der mathematischen Wissenschaften, vol.\u00a03-1-2 (Geometrie), ch. 12, pp. 1\u2013139. B.G. Teubner, Leipzig (1916)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. Amer. J. Math.\u00a054, 150\u2013168 (1932)","journal-title":"Amer. J. Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T15:42:18Z","timestamp":1688830938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}