{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:13:24Z","timestamp":1725804804774},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401568"},{"type":"electronic","value":"9783540448426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44842-x_92","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T16:38:01Z","timestamp":1290184681000},"page":"903-912","source":"Crossref","is-referenced-by-count":0,"title":["Partitioning Polygons into Tree Monotone and Y -monotone Subpolygons"],"prefix":"10.1007","author":[{"given":"Ralph P.","family":"Boland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"92_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.1993.1004","volume":"14","author":"P. K. Agarwal","year":"1993","unstructured":"Pankaj K. Agarwal and Micha Sharir. Circle shooting in a simple polygon. J. Algorithms, 14:69\u201387, 1993.","journal-title":"J. Algorithms"},{"key":"92_CR2","volume-title":"Polygon Visibility Decompositions with Applications","author":"R. P. Boland","year":"2000","unstructured":"R. P. Boland. Polygon Visibility Decompositions with Applications. Ph.D. thesis, March, 2002, University of Ottawa., Ottawa, Ontario, Canada, 2000."},{"key":"92_CR3","unstructured":"R. P. Boland and J. Urrutia. A simpler circular ray shooting algorithm. In Proc. 13th Canad. Conf. Comput. Geom., pages 37\u201340 (Electronic version 7 pages), 2001."},{"issue":"5","key":"92_CR4","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Bernard Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6(5): 485\u2013524, 1991.","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"92_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/357337.357340","volume":"3","author":"B. Chazelle","year":"1984","unstructured":"Bernard Chazelle and Janet Incerpi. Triangulation and shape-complexity. ACM Trans. Graph., 3(2): 135\u2013152, 1984.","journal-title":"ACM Trans. Graph."},{"key":"92_CR6","doi-asserted-by":"crossref","unstructured":"Siu-Wing Cheng, Otfried Cheong, Hazel Everett, and Ren\u00e9 van Oostrum. Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 227\u2013236, June 1999.","DOI":"10.1145\/304893.304976"},{"issue":"5","key":"92_CR7","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1137\/S0097539796313477","volume":"30","author":"R. Cole","year":"2000","unstructured":"Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa Przytycka, and Mikkel Thorup. An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Comput., 30(5): 1385\u20131404 (electronic), 2000.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"92_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/357337.357341","volume":"3","author":"A. Fournier","year":"1984","unstructured":"A. Fournier and D. Y. Montuno. Triangulating simple polygons and equivalent problems. ACM Trans. Graph., 3(2):153\u2013174, 1984.","journal-title":"ACM Trans. Graph."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2014 ICCSA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44842-X_92","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T07:37:10Z","timestamp":1559806630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44842-X_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401568","9783540448426"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44842-x_92","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}