{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:56:50Z","timestamp":1743112610956,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642539312"},{"type":"electronic","value":"9783642539329"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-53932-9_59","type":"book-chapter","created":{"date-parts":[[2013,12,20]],"date-time":"2013-12-20T05:54:07Z","timestamp":1387518847000},"page":"603-613","source":"Crossref","is-referenced-by-count":1,"title":["Route Standardization Based on Polygon Triangulation Cutting Algorithm"],"prefix":"10.1007","author":[{"given":"Baozhu","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Huifeng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yanfeng","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Yanling","family":"Su","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-45078-8_33","volume-title":"Algorithms and Data Structures","author":"O. Aichholzer","year":"2003","unstructured":"Aichholzer, O., Rote, G., Speckmann, B., Streinu, I.: The Zigzag Path of a Pseudo-Triangulation. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 377\u2013388. Springer, Heidelberg (2003)"},{"key":"59_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"key":"59_CR3","volume-title":"Computers and Intractability: A Guide to Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"59_CR4","unstructured":"Gilbert, P.D.: New Results in Planar Triangulations. Report R-850. University of Illinois, Coordinated Science Lab (1979)"},{"key":"59_CR5","unstructured":"Grantson, M., Borgelt, C., Levcopoulos, C.: A Fixed Parameter Algorithm for Minimum Weight Triangulation: Analysis and Experiments. Technical Report LUCS-TR: 2005-234, ISSN 1650-1276 Report 154. Lund University, Sweden (2005)"},{"key":"59_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-28639-4_18","volume-title":"Parameterized and Exact Computation","author":"M. Hoffmann","year":"2004","unstructured":"Hoffmann, M., Okamoto, Y.: The Minimum Weight Triangulation Problem with Few Inner Points. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 200\u2013212. Springer, Heidelberg (2004)"},{"key":"59_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70044-X","volume":"9","author":"G.T. Klincsek","year":"1980","unstructured":"Klincsek, G.T.: Minimal Triangulations of Polygonal Domains. Annals of Discrete Mathematics\u00a09, 121\u2013123 (1980)","journal-title":"Annals of Discrete Mathematics"},{"key":"59_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.3233\/FI-1978-2114","volume":"2","author":"E. Lodi","year":"1979","unstructured":"Lodi, E., Luccio, F., Mugnai, C., Pagli, L.: On Two-Dimensional Data Organization, Part I. Fundaments Informaticae\u00a02, 211\u2013226 (1979)","journal-title":"Fundaments Informaticae"},{"key":"59_CR9","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1137\/0403010","volume":"3","author":"A. Lubiw","year":"1990","unstructured":"Lubiw, A.: The Boolean Basis Problem and How to Cover Some Polygons by Rectangles. SIAM Journal on Discrete Mathematics\u00a03, 98\u2013115 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"59_CR10","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/BF01759065","volume":"6","author":"D. Moitra","year":"1991","unstructured":"Moitra, D.: Finding a Minimum Cover for Binary Images: An Optimal Parallel Algorithm. Algorithmica\u00a06, 624\u2013657 (1991)","journal-title":"Algorithmica"},{"key":"59_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/0196-6774(87)90020-4","volume":"8","author":"D. Plaisted","year":"1987","unstructured":"Plaisted, D., Hong, J.: A Heuristic Triangulation Algorithm. Journal of Algorithms\u00a08, 405\u2013437 (1987)","journal-title":"Journal of Algorithms"},{"key":"59_CR12","unstructured":"Sharir, M., Welzl, E.: On the Number of Crossing-Free Matchings (Cycles and Partitions). In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006 (to appear, 2006)"}],"container-title":["Communications in Computer and Information Science","Information Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-53932-9_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,20]],"date-time":"2022-03-20T09:57:55Z","timestamp":1647770275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-53932-9_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642539312","9783642539329"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-53932-9_59","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}