Abstract
This paper describes a local search based approach and a software tool to approximate the problem of drawing Euler diagrams. Specifications are written using RCC-8-constraints and radius constraints. Euler diagrams are described as set of circles.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Auber, D.: Tulip a huge graph visualization framework. In: Graph Drawing Software, pp. 105–126. Springer (2004)
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–96 (1997)
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–148. Springer (2004)
Flower, J., Howse, J.: Generating euler diagrams. In: Hegarty, M., Meyer, B., Narayanan, N.H. (eds.) Diagrams 2002. LNCS (LNAI), vol. 2317, pp. 61–75. Springer, Heidelberg (2002)
Hohenwarter, M., Preiner, J.: Dynamic mathematics with geogebra. Journal of Online Mathematics and its Applications, 7 (2007)
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. 22, p. 957 (2011)
Lutz, C., Wolter, F.: Modal logics of topological relations. Logical Methods in Computer Science 2, 1–14 (2006)
Marriott, K., Moulder, P., Stuckey, P.J.: Solving disjunctive constraints for interactive graphical applications. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 361–376. Springer, Heidelberg (2001)
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)
Papadimitriou, C.H.: Computational complexity. John Wiley and Sons Ltd. (2003)
Randell, D.A., Cui, Z., Cohn, A.G.: A spatial logic based on regions and connection. KR 92, 165–176 (1992)
Renz, J., Nebel, B.: On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus. Artificial Intelligence 108(1), 69–123 (1999)
Schaefer, M., Sedgwick, E., Štefankovič, D.: Recognizing string graphs in np. Journal of Computer and System Sciences 67(2), 365–380 (2003)
Schaefer, M., Stefankovic, D.: Decidability of string graphs. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 241–246. ACM (2001)
Schockaert, S., De Cock, M., Kerre, E.E.: Spatial reasoning in a fuzzy region connection calculus. Artificial Intelligence 173(2), 258–298 (2009)
Schwarzentruber, F., Hao, J.-K.: Drawing euler diagrams from region connection calculus specifications. Technical report
Simonetto, P., Auber, D., Archambault, D.: Fully automatic visualisation of overlapping sets. In: Computer Graphics Forum, vol. 28, pp. 967–974. Wiley Online Library (2009)
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. 6899, pp. 110–125. Springer, Heidelberg (2011)
Stapleton, G., Zhang, L., Howse, J., Rodgers, P.: Drawing euler diagrams with circles: The theory of piercings. IEEE Trans. Vis. Comput. Graph. 17(7), 1020–1032 (2011)
Van Harmelen, F., Lifschitz, V., Porter, B.: Handbook of knowledge representation, vol. 1. Elsevier (2008)
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. 2980, pp. 128–141. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Schwarzentruber, F., Hao, JK. (2014). Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search. In: Fermé, E., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2014. Lecture Notes in Computer Science(), vol 8761. Springer, Cham. https://doi.org/10.1007/978-3-319-11558-0_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-11558-0_41
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11557-3
Online ISBN: 978-3-319-11558-0
eBook Packages: Computer ScienceComputer Science (R0)