{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:16:42Z","timestamp":1742941002006,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031236112"},{"type":"electronic","value":"9783031236129"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-23612-9_6","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"84-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Construction of\u00a0Planar Embedding for\u00a0a\u00a0Class of\u00a0Orthogonal Polyhedra"],"prefix":"10.1007","author":[{"given":"Nilanjana","family":"Karmakar","sequence":"first","affiliation":[]},{"given":"Arindam","family":"Biswas","sequence":"additional","affiliation":[]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"6_CR1","unstructured":"Aguilera, A.: Orthogonal Polyhedra: Study and Application. Ph.D. thesis, Universitat Polit$$\\acute{e}$$cnica de Catalunya (1998)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Alexa, M.: Merging polyhedral shapes with scattered features. In: Proceedings of the International Conference on Shape Modeling and Applications, SMI 1999, p. 202 (1999)","DOI":"10.1109\/SMA.1999.749341"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/PL00007211","volume":"16","author":"M Alexa","year":"2000","unstructured":"Alexa, M.: Merging polyhedral shapes with scattered features. Vis. Comput. 16(1), 26\u201337 (2000)","journal-title":"Vis. Comput."},{"key":"6_CR4","unstructured":"Batini, C., Nardelli, E., Talamo, M., Tamassia, R.: A Grap-theoretic approach to aesthetic layout of information systems diagrams. In: 10th International Workshop on Graph-theoretic Concepts in Computer Science, Trauner Verlag, Berlin, pp. 9\u201318 (1984)"},{"issue":"5","key":"6_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"GD Battista","year":"1994","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. 4(5), 235\u2013282 (1994)","journal-title":"Comput. Geom."},{"key":"6_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry-Algorithms and Applications","author":"MD Berg","year":"1997","unstructured":"Berg, M.D., Cheong, O., Kreveld, M.V., Overmars, M.: Computational Geometry-Algorithms and Applications, 3rd edn. Springer, Heidelberg (1997)","edition":"3"},{"key":"6_CR7","unstructured":"Biedl, T.C., Genc, B.: When can a graph form an orthogonal polyhedron? In: Canadian Conference On Computational Geometry, pp. 53\u201356 (2004)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-04128-0_7","volume-title":"Algorithms - ESA 2009","author":"T Biedl","year":"2009","unstructured":"Biedl, T., Genc, B.: Cauchy\u2019s theorem for orthogonal polyhedra of genus 0. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 71\u201382. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04128-0_7"},{"key":"6_CR9","unstructured":"Cruz, I.F., Tamassia, R.: Graph Drawing Tutorial. http:\/\/cs.brown.edu\/people\/rtamassi\/gd-tutorial.html"},{"key":"6_CR10","volume-title":"Graph Theory with Application to Engineering and Computer Science","author":"N Deo","year":"2009","unstructured":"Deo, N.: Graph Theory with Application to Engineering and Computer Science. PHI Learning Private Limited, New Delhi (2009)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1090\/S0025-5718-96-00749-1","volume":"65","author":"AJW Duijvestijn","year":"1996","unstructured":"Duijvestijn, A.J.W.: The number of polyhedral (3-connected planar) graphs. Math. Comput. 65, 1289\u20131293 (1996)","journal-title":"Math. Comput."},{"key":"6_CR12","first-page":"149","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congr. Numer. 42, 149\u2013160 (1984)","journal-title":"Congr. Numer."},{"key":"6_CR13","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. 1027, pp. 212\u2013223. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021805"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-00219-9_9","volume-title":"Graph Drawing","author":"D Eppstein","year":"2009","unstructured":"Eppstein, D.: The topology of bendless three-dimensional orthogonal graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 78\u201389. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_9"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Mumford, E.: Steinitz theorems for orthogonal polyhedra. In: Proceeedings 2010 Annual Symposium on Computational Geometry, SoCG 2010, ACM, New York, USA, pp. 429\u2013438 (2010)","DOI":"10.1145\/1810959.1811030"},{"key":"6_CR16","unstructured":"Genc, B.: Reconstruction of Orthogonal Polyhedra. Ph.D. thesis, University of Waterloo (2008)"},{"issue":"3\u20135","key":"6_CR17","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.disc.2005.09.037","volume":"307","author":"B Gr\u00fcnbaum","year":"2007","unstructured":"Gr\u00fcnbaum, B.: Graphs of polyhedra. Polyhedra Graphs. Discrete Math. 307(3\u20135), 445\u2013463 (2007)","journal-title":"Polyhedra Graphs. Discrete Math."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Henk, M., Richter-Gebert, J., Ziegler, G.M.: Basic properties of convex polytopes, second edn. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, chap. 15, pp. 243\u2013270. CRC Press LLC, Boca Raton, FL, USA (2004)","DOI":"10.1201\/9781420035315.pt2"},{"issue":"4","key":"6_CR19","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/s00453-011-9570-x","volume":"61","author":"SH Hong","year":"2011","unstructured":"Hong, S.H., Nagamochi, H.: Extending Steinitz\u2019s theorem to upward star-shaped polyhedra and spherical polyhedra. Algorithmica 61(4), 1022\u20131076 (2011)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR20","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-21073-0_9","volume-title":"Combinatorial Image Analysis","author":"N Karmakar","year":"2011","unstructured":"Karmakar, N., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: Construction of 3D orthogonal cover of a digital object. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 70\u201383. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21073-0_9"},{"issue":"8","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1080\/00207160.2012.734813","volume":"90","author":"N Karmakar","year":"2013","unstructured":"Karmakar, N., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: A combinatorial algorithm to construct 3D isothetic covers. Int. J. Comput. Math. 90(8), 1571\u20131606 (2013)","journal-title":"Int. J. Comput. Math."},{"key":"6_CR23","volume-title":"Digital Geometry: Geometric Methods for Digital Picture Analysis","author":"R Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)"},{"key":"6_CR24","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: International Symposium on Theory of Graphs, Gordon and Breach, New York, pp. 215\u2013232 (1967)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Lipton, R., North, S., Sandberg, J.: A method for drawing graphs. In: ACM Symposium on Computational Geometry, pp. 153\u2013160 (1985)","DOI":"10.1145\/323233.323254"},{"key":"6_CR26","unstructured":"Orbani$$\\acute{c}$$, A., Boben, M., Jakli\u010d, G., Pisanski, T.: Algorithms for drawing polyhedra from 3-connected planar graphs. Spec. Issue: Theor. Comput. Sci. Guest Editors: Bo\u0161tjan Vilfan 28, 239\u2013243 (2004)"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1090\/conm\/453\/08805","volume":"453","author":"J O\u2019Rourke","year":"2008","unstructured":"O\u2019Rourke, J.: Unfolding orthogonal polyhedra. Contemp. Math. 453, 307 (2008)","journal-title":"Contemp. Math."},{"key":"6_CR28","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0093761","volume-title":"Realization Spaces of Polytopes","author":"J Richter-Gebert","year":"1996","unstructured":"Richter-Gebert, J.: Realization Spaces of Polytopes. Lecture Notes in Mathematics, vol. 164. Springer-Verlag, Berlin (1996)"},{"key":"6_CR29","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 138\u2013148 (1990)"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Tamassia, R.: Planar orthogonal drawings of graphs. In: IEEE International Symposium on Circuits and Systems, vol. 1, pp. 319\u2013322 (1990)","DOI":"10.1109\/ISCAS.1990.112025"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Tamassia, R., Battista, G.D., Batini, C.: Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern. SMC-18(1), 61\u201379 (1988)","DOI":"10.1109\/21.87055"},{"issue":"3","key":"6_CR32","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/214748.214752","volume":"30","author":"RE Tarjan","year":"1987","unstructured":"Tarjan, R.E.: Algorithm design. Commun. ACM 30(3), 205\u2013212 (1987)","journal-title":"Commun. ACM"},{"key":"6_CR33","volume-title":"Convex Polytopes: Extremal Constructions and f -Vector Shapes","author":"GM Ziegler","year":"2004","unstructured":"Ziegler, G.M.: Convex Polytopes: Extremal Constructions and f -Vector Shapes, vol. 14. IAS\/Park City Mathematics, Salt Lake City (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23612-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T09:53:07Z","timestamp":1728640387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23612-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031236112","9783031236129"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23612-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWCIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Image Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Messina","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iwcia2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}