{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:58:22Z","timestamp":1648983502047},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1007\/bf01933206","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T22:54:58Z","timestamp":1122764098000},"page":"570-582","source":"Crossref","is-referenced-by-count":6,"title":["On the minimality of polygon triangulation"],"prefix":"10.1007","volume":"30","author":[{"given":"Chiuyuan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruei-Chuan","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"BF01933206_CR1","first-page":"232","volume":"E 67","author":"T. Asano","year":"1984","unstructured":"T. Asano, T. Asano, and Y. Ohsuga,Partitioning a polygonal region into a minimum number of triangles, The Transactions of the IECE of Japan, Vol. E 67, No. 4 (1984), pp. 232\u2013233.","journal-title":"The Transactions of the IECE of Japan"},{"issue":"2","key":"BF01933206_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0196-6774(86)90005-2","volume":"7","author":"T. Asano","year":"1986","unstructured":"T. Asano, T. Asano, and R. Y. Pinter,Polygon triangulation: efficiency and minimality, Journal of Algorithms, Vol. 7, No. 2 (1986), pp. 221\u2013231.","journal-title":"Journal of Algorithms"},{"key":"BF01933206_CR3","unstructured":"B. M. Chazelle,A theorem for polygon cutting with applications, Proceedings of the 23rd IEEE Annual Symposium on the Foundations of Computer Science (1983), pp. 339\u2013349."},{"issue":"6","key":"BF01933206_CR4","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B. M. Chazelle","year":"1989","unstructured":"B. M. Chazelle and L. J. Guibas,Visibility and intersection problems in plane geometry, Discrete Computational Geometry, Vol. 4, No. 6 (1989), pp. 551\u2013581.","journal-title":"Discrete Computational Geometry"},{"issue":"2","key":"BF01933206_CR5","doi-asserted-by":"crossref","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 Transactions on Graphics, Vol. 3, No. 2 (1984), pp. 153\u2013174.","journal-title":"ACM Transactions on Graphics"},{"issue":"4","key":"BF01933206_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M. R. Garey","year":"1978","unstructured":"M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan,Triangulating a simple polygon, Information Processing Letters, Vol. 7, No. 4 (1978), pp. 175\u2013179.","journal-title":"Information Processing Letters"},{"key":"BF01933206_CR7","first-page":"369","volume-title":"The power of non-rectilinear holes","author":"A. Lingas","year":"1982","unstructured":"A. Lingas,The power of non-rectilinear holes, Proceedings of the 9th Colloquium on Automata, Languages and Programming, Aarhus (1982), pp. 369\u2013383."},{"key":"BF01933206_CR8","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O'Rourke","year":"1987","unstructured":"J. O'Rourke,Art Gallery Theorems and Algorithms, Oxford University Press, Inc., New York (1987)."},{"issue":"1","key":"BF01933206_CR9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TCAD.1987.1270250","volume":"6","author":"K. J. Supowit","year":"1987","unstructured":"K. J. Supowit,Finding a maximum planar subset of a set of nets in a channel, IEEE Transactions on Computer-Aided Design, Vol. 6, No. 1 (1987), pp. 93\u201394.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"1","key":"BF01933206_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0217010","volume":"17","author":"R. E. Tarjan","year":"1988","unstructured":"R. E. Tarjan, and C. J. Van Wyk,An O(n loglog n)-time algorithm for triangulating a simple polygon, SIAM Journal on Computing, Vol. 17, No. 1 (1988), pp. 143\u2013178.","journal-title":"SIAM Journal on Computing"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01933206.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01933206\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01933206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T01:09:46Z","timestamp":1557450586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01933206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["BF01933206"],"URL":"https:\/\/doi.org\/10.1007\/bf01933206","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}