{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:48:13Z","timestamp":1725792493946},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071473"},{"type":"electronic","value":"9783319071480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07148-0_4","type":"book-chapter","created":{"date-parts":[[2014,4,23]],"date-time":"2014-04-23T05:48:40Z","timestamp":1398232120000},"page":"25-36","source":"Crossref","is-referenced-by-count":2,"title":["On Intersection Graphs of Convex Polygons"],"prefix":"10.1007","author":[{"given":"Valentin E.","family":"Brimkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Kafer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Szczepankiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Terhaar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00224-005-1141-6","volume":"38","author":"C. Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, C., Wagner, U.: The clique problem in intersection graphs of ellipses and triangles. Theory Comput. Syst.\u00a038, 279\u2013292 (2005)","journal-title":"Theory Comput. Syst."},{"key":"4_CR2","volume-title":"Computer Vision","author":"D.H. Ballard","year":"1982","unstructured":"Ballard, D.H., Brown, M.: Computer Vision. Prentice-Hall, Englewood Cliffs (1982)"},{"key":"4_CR3","unstructured":"Brimkov, V.E., Kafer, S., Szczepankiewicz, M., Terhaar, J.: Maximal cliques in intersection graphs of quasi-homothetic trapezoids. In: Proc. MCURCSM 2013, Ohio, 10 p. (2013)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-33090-2_22","volume-title":"Algorithms \u2013 ESA 2012","author":"S. Cabello","year":"2012","unstructured":"Cabello, S., Cardinal, J., Langerman, S.: The clique problem in ray intersection graphs. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 241\u2013252. Springer, Heidelberg (2012)"},{"key":"4_CR5","first-page":"13","volume-title":"Proc. Sympos. \u201cTheory of Graphs and its Applications\u201d (Smolenice, 1963)","author":"K. \u010cul\u00edk","year":"1964","unstructured":"\u010cul\u00edk, K.: Applications of graph theory to mathematical logic and linguistics. In: Proc. Sympos. \u201cTheory of Graphs and its Applications\u201d (Smolenice, 1963), pp. 13\u201320. Publ. House Czechoslovak Acad. Sci., Prague (1964)"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P, Goodman, A.W., P\u00f3sa, L.: The representation of a graph by set intersections. Canad. J. Math. 18, 106\u2013112 (1966)","journal-title":"Canad. J. Math."},{"issue":"1-3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0012-365X(94)00230-G","volume":"147","author":"A.V. Evako","year":"1995","unstructured":"Evako, A.V.: Topological properties of the intersection graph of covers of n-dimensional surfaces. Discrete Mathematics\u00a0147(1-3), 107\u2013120 (1995)","journal-title":"Discrete Mathematics"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(96)00013-3","volume":"74","author":"S. Felsner","year":"1993","unstructured":"Felsner, S., M\u00fcller, R., Wernisch, L.: Trapezoid graphs and generalizations, geometry and algorithms. Discrete Applied Mathematics\u00a074, 13\u201332 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR9","unstructured":"Fish, A., Stapleton, G.: Formal issues in languages based on closed curves. In: Proc. Distributed Multimedia Systems, pp. 161\u2013167 (2006)"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S1093-3263(97)00089-2","volume":"15","author":"E.J. Gardiner","year":"1997","unstructured":"Gardiner, E.J., Artymiuk, P.J., Willett, P.: Clique-detection algorithms for matching three-dimensional molecular structures. J. Molecular Graph Modelling\u00a015(4), 245\u2013253 (1997)","journal-title":"J. Molecular Graph Modelling"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs. Acad. Press (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"4_CR12","unstructured":"Heinzle, F., Ander, K.H., Sester, M.: Graph based approaches for recognition of patterns and implicit information in road networks. In: Proc. 22nd International Cartographic Conference, A Coruna (2005)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H. Imai","year":"1983","unstructured":"Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. Journal of Algorithms\u00a04, 300\u2013323 (1983)","journal-title":"Journal of Algorithms"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Ion, A., Carreira, J., Sminchisescu, C.: Image segmentation by figure-ground composition into maximal cliques. In: Proc. 13th International Conference on Computer Vision, Barcelona, pp. 2110\u20132117 (2011)","DOI":"10.1109\/ICCV.2011.6126486"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1002\/jgt.3190150603","volume":"15","author":"M.S. Jacobson","year":"1991","unstructured":"Jacobson, M.S., Morris, F.R., Scheinermann, E.R.: General results on tolerance intersection graphs. J. Graph Theory\u00a015, 573\u2013577 (1991)","journal-title":"J. Graph Theory"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters\u00a027, 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"4_CR17","series-title":"Geometric Methods for Digital Picture Analysis","volume-title":"Digital Geometry","author":"R. Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry. Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-642-35261-4_64","volume-title":"Algorithms and Computation","author":"K. Junosza-Szaniawski","year":"2012","unstructured":"Junosza-Szaniawski, K., Kratochv\u00edl, J., Pergel, M., Rz\u0105\u017cewski, P.: Beyond homothetic polygons: Recognition and maximum clique. In: Chao, K.-M., Hsu, T.-s., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 619\u2013628. Springer, Heidelberg (2012)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Kratochv\u00edl, J., Lehmann, K., Subramanian, A.: Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. In: Proc. SODA 2006, pp. 832\u2013841 (2006)","DOI":"10.1145\/1109557.1109649"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0012-365X(97)81834-1","volume":"178","author":"J. Kratochv\u00edl","year":"1998","unstructured":"Kratochv\u00edl, J., Kub\u011bna, A.: On intersection representations of co-planar graphs. Discrete Mathematics\u00a0178, 251\u2013255 (1998)","journal-title":"Discrete Mathematics"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Combinatorial Theory Ser. B\u00a062, 289\u2013315 (1994)","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"4_CR22","first-page":"85","volume":"31","author":"J. Kratochv\u00edl","year":"1990","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J.: Independent set and clique problems in intersection-defined classes of graphs. Comm. Math. Uni. Car.\u00a031, 85\u201393 (1990)","journal-title":"Comm. Math. Uni. Car."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.endm.2008.06.056","volume":"31","author":"J. Kratochv\u00edl","year":"2008","unstructured":"Kratochv\u00edl, J., Pergel, M.: Intersection graphs of homothetic polygons. Electronic Notes in Discr. Math.\u00a031, 277\u2013280 (2008)","journal-title":"Electronic Notes in Discr. Math."},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications, vol. 2. SIAM, Philadelphia (1999)","DOI":"10.1137\/1.9780898719802"},{"key":"4_CR25","doi-asserted-by":"crossref","first-page":"303","DOI":"10.4064\/fm-33-1-303-307","volume":"33","author":"E. Szpilrajn-Marczewski","year":"1945","unstructured":"Szpilrajn-Marczewski, E.: Sur deux propri\u00e9t\u00e9s des classes d\u2019ensembles. Fund. Math.\u00a033, 303\u2013307 (1945)","journal-title":"Fund. Math."},{"issue":"3","key":"4_CR26","first-page":"C79","volume":"16","author":"H. Nakamura","year":"1997","unstructured":"Nakamura, H., Masatake, H., Mamoru, H.: Robust computation of intersection graph between two solids. Graphical Models\u00a016(3), C79\u2013C88 (1997)","journal-title":"Graphical Models"},{"issue":"8","key":"4_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0898-1221(95)00029-X","volume":"29","author":"S.C. Nandy","year":"1995","unstructured":"Nandy, S.C., Bhattacharya, B.B.: A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Computers Math. Applic.\u00a029(8), 45\u201361 (1995)","journal-title":"Computers Math. Applic."},{"issue":"3","key":"4_CR28","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1049\/ip-vis:19971094","volume":"144","author":"R. Paget","year":"1997","unstructured":"Paget, R., Longsta, D.: Extracting the cliques from a neighbourhood system. IEE Proc. Vision Image and Signal Processing\u00a0144(3), 168\u2013170 (1997)","journal-title":"IEE Proc. Vision Image and Signal Processing"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Simonetto, P., Auber, D.: An heuristic for the construction of intersection graphs. In: Proc. 13th International Conference on Information Visualisation, pp. 673\u2013678 (2009)","DOI":"10.1109\/IV.2009.30"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Simonetto, P., Auber, D.: Visualise undrawable Euler diagrams. In: Proc. 12th IEEE International Conference on Information Visualisation, pp. 594\u2013599 (2008)","DOI":"10.1109\/IV.2008.78"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Tian, J., Tinghua, A., Xiaobin, J.: Graph based recognition of grid pattern in street networks. In: The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Advances in Spatial Data Handling and GIS. Lecture Notes in Geoinformation and Cartography, Part II, vol.\u00a038, pp. 129\u2013143 (2012)","DOI":"10.1007\/978-3-642-25926-5_10"},{"key":"4_CR32","unstructured":"Vairinhos, V.M., Lobo, V., Galindo, M.P.: Intersection graph-based representation of contingency tables, \n                    \n                      http:\/\/www.isegi.unl.pt\/docentes\/vlobo\/Publicacoes\/3_17_lobo08_DAIG_conting_tables.pdf"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"M\u00fcller, T., van Leeuven, E.J., van Leeuven, J.: Integer representations of convex polygons intersection graphs. In: Symposium on Computational Geometry, pp. 300\u2013307 (2011)","DOI":"10.1145\/1998196.1998248"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-18469-7_35","volume-title":"Graph Drawing","author":"E.J. Leeuwen van","year":"2011","unstructured":"van Leeuwen, E.J., van Leeuwen, J.: Convex polygon intersection graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 377\u2013388. Springer, Heidelberg (2011)"},{"key":"4_CR35","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)"},{"key":"4_CR36","unstructured":"Wang, X., Bai, X., Yang, X., Wenyu, L., Latecki, L.J.: Maximal cliques that satisfy hard constraints with application to deformable object model learning. In: Advances in Neural Information Processing Systems, vol.\u00a024, pp. 864\u2013872 (2011)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07148-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T17:10:01Z","timestamp":1558890601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07148-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319071473","9783319071480"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07148-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}