{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T05:05:14Z","timestamp":1751432714596,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":13,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628445"},{"type":"electronic","value":"9789819628452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_3","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T15:59:50Z","timestamp":1740067190000},"page":"32-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Conforming Partitions with\u00a0Low Stabbing Number for\u00a0Rectilinear Polygons"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9003-3783","authenticated-orcid":false,"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6589-3538","authenticated-orcid":false,"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7370-8697","authenticated-orcid":false,"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6987-4855","authenticated-orcid":false,"given":"Rahnuma Islam","family":"Nishat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5985-2169","authenticated-orcid":false,"given":"Bastien","family":"Rivier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Abam, M.A., Aronov, B., de\u00a0Berg, M., Khosravi, A.: Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. In: Proceedings of the 27th ACM Symposium on Computational Geometry (SCG), pp. 407\u2013416 (2011). https:\/\/doi.org\/10.1145\/1998196.1998263","DOI":"10.1145\/1998196.1998263"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"03","key":"3_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M de Berg","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(03), 187\u2013205 (2012). https:\/\/doi.org\/10.1142\/S0218195912500045","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-020-00769-5","volume":"83","author":"T Biedl","year":"2021","unstructured":"Biedl, T., Mehrabi, S.: On orthogonally guarding orthogonal polygons with bounded treewidth. Algorithmica 83, 641\u2013666 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00769-5","journal-title":"Algorithmica"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Biedl, T., Derka, M., Irvine, V., Lubiw, A., Mondal, D., Turcotte, A.: Partitioning orthogonal histograms into rectangular boxes. In: Proceedings of the 13th Latin American Symposium on Theoretical Informatics (LATIN), pp. 146\u2013160. Springer (2018)","DOI":"10.1007\/978-3-319-77404-6_12"},{"key":"3_CR6","unstructured":"Borradaile, G., Erickson, J., Le, H., Weber, R.: Embedded-width: a variant of treewidth for plane graphs. CoRR abs\/1703.07532 (2017). http:\/\/arxiv.org\/abs\/1703.07532"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","DOI":"10.1016\/0890-5401(90)90043-H"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(94)90129-5","volume":"52","author":"M de Berg","year":"1994","unstructured":"de Berg, M., van Kreveld, M.: Rectilinear decompositions with low stabbing number. Inf. Process. Lett. 52(4), 215\u2013221 (1994). https:\/\/doi.org\/10.1016\/0020-0190(94)90129-5","journal-title":"Inf. Process. Lett."},{"key":"3_CR9","unstructured":"Durocher, S., Mehrabi, S.: Erratum to: computing partitions of rectilinear polygons with minimum stabbing number. https:\/\/citeseerx.ist.psu.edu\/document?repid=rep1&type=pdf &doi=0093663d76ea6411084216000c1c61b7c0b0f49d"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.tcs.2017.05.035","volume":"689","author":"S Durocher","year":"2017","unstructured":"Durocher, S., Mehrabi, S.: Computing conforming partitions of orthogonal polygons with minimum stabbing number. Theor. Comput. Sci. 689, 157\u2013168 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.05.035","journal-title":"Theor. Comput. Sci."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/s00453-016-0247-3","volume":"80","author":"P Floderus","year":"2018","unstructured":"Floderus, P., Jansson, J., Levcopoulos, C., Lingas, A., Sledneu, D.: 3D rectangulations and geometric matrix multiplication. Algorithmica 80, 136\u2013154 (2018)","journal-title":"Algorithmica"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J Hershberger","year":"1995","unstructured":"Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms 18(3), 403\u2013431 (1995). https:\/\/doi.org\/10.1006\/jagm.1995.1017","journal-title":"J. Algorithms"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.cor.2016.12.014","volume":"80","author":"B Piva","year":"2017","unstructured":"Piva, B., de Souza, C.C.: Minimum stabbing rectangular partitions of rectilinear polygons. Comput. Oper. Res. 80, 184\u2013197 (2017)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T15:59:53Z","timestamp":1740067193000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}