{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:05Z","timestamp":1750307345052,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,13]],"date-time":"2011-06-13T00:00:00Z","timestamp":1307923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,13]]},"DOI":"10.1145\/1998196.1998263","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"407-416","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons"],"prefix":"10.1145","author":[{"given":"Mohammad Ali","family":"Abam","sequence":"first","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Aronov","sequence":"additional","affiliation":[{"name":"Polytechnic Institute of NYU, Brooklyn, New York City, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"De Berg","sequence":"additional","affiliation":[{"name":"TU Eindhoven, Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amirali","family":"Khosravi","sequence":"additional","affiliation":[{"name":"TU Eindhoven, Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/220279.220308"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90129-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574703"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187720"},{"key":"e_1_3_2_1_5_1","volume-title":"Leiserson and Ronald L. Rivest and Clifford Stein. Introduction to Algorithms","author":"Cormen Thomas","year":"2001","unstructured":"Thomas Cormen and Charles E . Leiserson and Ronald L. Rivest and Clifford Stein. Introduction to Algorithms , second edition. The MIT Press . Cambridge, Massachusetts. 2001 . Thomas Cormen and Charles E. Leiserson and Ronald L. Rivest and Clifford Stein. Introduction to Algorithms, second edition. The MIT Press. Cambridge, Massachusetts. 2001."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1017"},{"key":"e_1_3_2_1_7_1","volume-title":"Heuristics for Minimum Decompositions of Polygons. Linkoping Studies in Science and Technology. Dissertations","author":"Levcopoulos Christos","year":"1987","unstructured":"Christos Levcopoulos . Heuristics for Minimum Decompositions of Polygons. Linkoping Studies in Science and Technology. Dissertations . 1987 . Christos Levcopoulos. Heuristics for Minimum Decompositions of Polygons. Linkoping Studies in Science and Technology. Dissertations. 1987."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(86)90127-1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10998-008-8217-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/06066031X"}],"event":{"name":"SoCG '11: Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Paris France","acronym":"SoCG '11"},"container-title":["Proceedings of the twenty-seventh annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998196.1998263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1998196.1998263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:27Z","timestamp":1750244787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998196.1998263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,13]]},"references-count":10,"alternative-id":["10.1145\/1998196.1998263","10.1145\/1998196"],"URL":"https:\/\/doi.org\/10.1145\/1998196.1998263","relation":{},"subject":[],"published":{"date-parts":[[2011,6,13]]},"assertion":[{"value":"2011-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}