{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:36Z","timestamp":1725664716699},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614227"},{"type":"electronic","value":"9783540685296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_138","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:37:01Z","timestamp":1330292221000},"page":"271-283","source":"Crossref","is-referenced-by-count":2,"title":["Linear-time heuristics for minimum weight rectangulation"],"prefix":"10.1007","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"\u00d6stlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Chazelle, B.: Triangulating a Simple Polygon in Linear Time. Proc. 31st Symp. on Foundations of Computer Science, pp. 220\u2013230, 1990.","key":"24_CR1","DOI":"10.1109\/FSCS.1990.89541"},{"doi-asserted-by":"crossref","unstructured":"Chin, F., Snoeyink, J., Wang, C.A.: Finding the Medial Axis of a Simple Polygon in Linear Time. Proc., 6th International Symposium on Algorithms and Computation, ISAAC '95, Cairns, Australia, 1995. (LNCS 1006, Springer Verlag).","key":"24_CR2","DOI":"10.1007\/BFb0015444"},{"doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J., Tarjan, R.: Scaling and Related Techniques for Geometry Problems. Proc. 16th Annual ACM Symposium on Theory of Computing, pp. 135\u2013143, April 1984.","key":"24_CR3","DOI":"10.1145\/800057.808675"},{"doi-asserted-by":"crossref","unstructured":"Gonzalez, T, Zheng, S.Q.: Bounds for Partitioning Rectilinear Polygons. Proc. First ACM Symposium on Computional Geometry, Baltimore, June 1985.","key":"24_CR4","DOI":"10.1145\/323233.323269"},{"doi-asserted-by":"crossref","unstructured":"Harel, D., Tarjan, R.E.: Fast Algorithms for Finding Nearest Common Ancestors. SIAM Journal of Computing, Vol. 13, No. 2, May 1984.","key":"24_CR5","DOI":"10.1137\/0213024"},{"unstructured":"Levcopoulos, C.: Minimum Length and \u201cThickest-first\u201d Rectangular partitions of Polygons. Proc. 20th Allerton Conf. on Comm. Control and Compt., Monticello, Illinois, 1982.","key":"24_CR6"},{"doi-asserted-by":"crossref","unstructured":"Levcopoulos, C.: Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. In Proc. of the 2nd ACM Symp. on Comp. Geomety, pp. 100\u2013108, 1986.","key":"24_CR7","DOI":"10.1145\/10515.10526"},{"unstructured":"Levcopoulos, C.: Heuristics for Minimum Decompositions of Polygons. PhD dissertation no. 155, Link\u00f6ping University, 1987.","key":"24_CR8"},{"unstructured":"Levcopoulos, C., \u00d6stlin, A.: Linear-Time Heuristics for Minimum Weight Rectangulation. Technical Report LU-CS-TR:96-165, Lund University, 1996.","key":"24_CR9"},{"unstructured":"Lingas, A.: Heuristics for Minimum Edge Length Rectangular Partitions of Rectilinear Figures. Proc. 6th GI-Conference, Dortmund, January 1983. (LNCS 145, Springer Verlag).","key":"24_CR10"},{"doi-asserted-by":"crossref","unstructured":"Levcopoulos, C., Lingas, A.: Bounds on the Length of Convex Partitions of Polygons. Proc. 4th Conference on Found. of Software Technology and Theoretical Computer Science, Bangalore, India, 1984. (LNCS 181, Springer Verlag).","key":"24_CR11","DOI":"10.1007\/3-540-13883-8_78"},{"unstructured":"Lingas, A., Pinter, R.Y., Rivest, R.L. Shamir, A.: Minimum Edge Length Partitioning of Rectilinear Polygons. Proc. 20th Allerton Conf. on Comm. Control and Compt., Monticello, Illinois, 1982.","key":"24_CR12"},{"doi-asserted-by":"crossref","unstructured":"Vuillemin, J.: A Unifying Look at Data Structures. Communications of the ACM, Vol. 23 (4), April 1980.","key":"24_CR13","DOI":"10.1145\/358841.358852"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_138.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:53Z","timestamp":1619573513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_138","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}