{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:45:02Z","timestamp":1743003902244,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115573"},{"type":"electronic","value":"9783319115580"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11558-0_41","type":"book-chapter","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:22:39Z","timestamp":1410834159000},"page":"582-590","source":"Crossref","is-referenced-by-count":1,"title":["Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Schwarzentruber","sequence":"first","affiliation":[]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Auber, D.: Tulip a huge graph visualization framework. In: Graph Drawing Software, pp. 105\u2013126. Springer (2004)","DOI":"10.1007\/978-3-642-18638-7_5"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Borning, A., Marriott, K., Stuckey, P.J., Xiao, Y.: Solving linear arithmetic constraints for user interface applications. In: ACM Symposium on User Interface Software and Technology, pp. 87\u201396 (1997)","DOI":"10.1145\/263407.263518"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Ellson, J., Gansner, E.R., Koutsofios, E., North, S.C., Woodhull, G.: Graphviz and dynagraph static and dynamic graph drawing tools. In: Graph Drawing Software, pp. 127\u2013148. Springer (2004)","DOI":"10.1007\/978-3-642-18638-7_6"},{"key":"41_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-46037-3_6","volume-title":"Diagrammatic Representation and Inference","author":"J. Flower","year":"2002","unstructured":"Flower, J., Howse, J.: Generating euler diagrams. In: Hegarty, M., Meyer, B., Narayanan, N.H. (eds.) Diagrams 2002. LNCS (LNAI), vol.\u00a02317, pp. 61\u201375. Springer, Heidelberg (2002)"},{"key":"41_CR5","unstructured":"Hohenwarter, M., Preiner, J.: Dynamic mathematics with geogebra. Journal of Online Mathematics and its Applications, 7 (2007)"},{"key":"41_CR6","unstructured":"Kontchakov, R., Nenov, Y., Pratt-Hartmann, I., Zakharyaschev, M.: On the decidability of connectedness constraints in 2d and 3d euclidean spaces. In: IJCAI Proceedings-International Joint Conference on Artificial Intelligence, vol.\u00a022, p. 957 (2011)"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-2(2:5)2006","volume":"2","author":"C. Lutz","year":"2006","unstructured":"Lutz, C., Wolter, F.: Modal logics of topological relations. Logical Methods in Computer Science\u00a02, 1\u201314 (2006)","journal-title":"Logical Methods in Computer Science"},{"key":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/3-540-45578-7_25","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"K. Marriott","year":"2001","unstructured":"Marriott, K., Moulder, P., Stuckey, P.J.: Solving disjunctive constraints for interactive graphical applications. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 361\u2013376. Springer, Heidelberg (2001)"},{"key":"41_CR9","unstructured":"Micallef, L., Rodgers, P.: Drawing area-proportional venn-3 diagrams using ellipses. In: 2012 Grace Hopper Celebration of Women in Computing, ACM Student Research Competition and Poster Session. ACM Press (2012)"},{"key":"41_CR10","unstructured":"Papadimitriou, C.H.: Computational complexity. John Wiley and Sons Ltd. (2003)"},{"key":"41_CR11","first-page":"165","volume":"92","author":"D.A. Randell","year":"1992","unstructured":"Randell, D.A., Cui, Z., Cohn, A.G.: A spatial logic based on regions and connection. KR\u00a092, 165\u2013176 (1992)","journal-title":"KR"},{"issue":"1","key":"41_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0004-3702(99)00002-8","volume":"108","author":"J. Renz","year":"1999","unstructured":"Renz, J., Nebel, B.: On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus. Artificial Intelligence\u00a0108(1), 69\u2013123 (1999)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"41_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M. Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Recognizing string graphs in np. Journal of Computer and System Sciences\u00a067(2), 365\u2013380 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Schaefer, M., Stefankovic, D.: Decidability of string graphs. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 241\u2013246. ACM (2001)","DOI":"10.1145\/380752.380807"},{"issue":"2","key":"41_CR15","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.artint.2008.10.009","volume":"173","author":"S. Schockaert","year":"2009","unstructured":"Schockaert, S., De Cock, M., Kerre, E.E.: Spatial reasoning in a fuzzy region connection calculus. Artificial Intelligence\u00a0173(2), 258\u2013298 (2009)","journal-title":"Artificial Intelligence"},{"key":"41_CR16","unstructured":"Schwarzentruber, F., Hao, J.-K.: Drawing euler diagrams from region connection calculus specifications. Technical report"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Simonetto, P., Auber, D., Archambault, D.: Fully automatic visualisation of overlapping sets. In: Computer Graphics Forum, vol.\u00a028, pp. 967\u2013974. Wiley Online Library (2009)","DOI":"10.1111\/j.1467-8659.2009.01452.x"},{"key":"41_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-23196-4_7","volume-title":"Spatial Information Theory","author":"M. Sridhar","year":"2011","unstructured":"Sridhar, M., Cohn, A.G., Hogg, D.C.: From video to rcc8: exploiting a distance based semantics to stabilise the interpretation of mereotopological relations. In: Egenhofer, M., Giudice, N., Moratz, R., Worboys, M. (eds.) COSIT 2011. LNCS, vol.\u00a06899, pp. 110\u2013125. Springer, Heidelberg (2011)"},{"issue":"7","key":"41_CR19","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/TVCG.2010.119","volume":"17","author":"G. Stapleton","year":"2011","unstructured":"Stapleton, G., Zhang, L., Howse, J., Rodgers, P.: Drawing euler diagrams with circles: The theory of piercings. IEEE Trans. Vis. Comput. Graph.\u00a017(7), 1020\u20131032 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"41_CR20","unstructured":"Van Harmelen, F., Lifschitz, V., Porter, B.: Handbook of knowledge representation, vol.\u00a01. Elsevier (2008)"},{"key":"41_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-25931-2_13","volume-title":"Diagrammatic Representation and Inference","author":"A. Verroust","year":"2004","unstructured":"Verroust, A., Viaud, M.-L.: Ensuring the drawability of extended euler diagrams for up to 8 sets. In: Blackwell, A.F., Marriott, K., Shimojima, A. (eds.) Diagrams 2004. LNCS (LNAI), vol.\u00a02980, pp. 128\u2013141. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11558-0_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T08:19:20Z","timestamp":1674548360000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11558-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115573","9783319115580"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11558-0_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}