{"id":"https://openalex.org/W1992578069","doi":"https://doi.org/10.1145/2261250.2261259","title":"Counting crossing-free structures","display_name":"Counting crossing-free structures","publication_year":2012,"publication_date":"2012-06-17","ids":{"openalex":"https://openalex.org/W1992578069","doi":"https://doi.org/10.1145/2261250.2261259","mag":"1992578069"},"language":"en","primary_location":{"id":"doi:10.1145/2261250.2261259","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2261250.2261259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058680237","display_name":"V\u00edctor \u00c1lvarez","orcid":"https://orcid.org/0000-0002-3014-9020"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Victor Alvarez","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["Max Planck Institut for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institut for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080255734","display_name":"Radu Curticapean","orcid":"https://orcid.org/0000-0001-7201-9905"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Radu Curticapean","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111453426","display_name":"Saurabh Ray","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Saurabh Ray","raw_affiliation_strings":["Max Planck Institut for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institut for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.8039,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.96761401,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"61","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7567036151885986},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6272711753845215},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5672009587287903},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.564948320388794},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5336414575576782},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4852183163166046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4498811662197113},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44897687435150146},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4297749996185303},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.41574737429618835},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3865298330783844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3862024247646332},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.369024395942688},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3553500771522522}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7567036151885986},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6272711753845215},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5672009587287903},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.564948320388794},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5336414575576782},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4852183163166046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4498811662197113},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44897687435150146},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4297749996185303},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41574737429618835},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3865298330783844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3862024247646332},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.369024395942688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3553500771522522},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2261250.2261259","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2261250.2261259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.359.8259","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.359.8259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.victoralvarez.net/papers/Counting crossing-free structures in the plane - SoCG 2012.pdf","raw_type":"text"},{"id":"pmh:oai:pure.mpg.de:item_1858467","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-BB4F-B","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W13988344","https://openalex.org/W36639738","https://openalex.org/W1570425181","https://openalex.org/W1988809014","https://openalex.org/W2015954167","https://openalex.org/W2017870334","https://openalex.org/W2069225643","https://openalex.org/W2089506206","https://openalex.org/W2089842370","https://openalex.org/W2096398399","https://openalex.org/W2122052024","https://openalex.org/W2163448076","https://openalex.org/W2569928643","https://openalex.org/W2594841682"],"related_works":["https://openalex.org/W108845024","https://openalex.org/W4300125793","https://openalex.org/W2578985712","https://openalex.org/W2406961474","https://openalex.org/W2143566611","https://openalex.org/W2013740965","https://openalex.org/W588267724","https://openalex.org/W4297743441","https://openalex.org/W1687551056","https://openalex.org/W2248869909"],"abstract_inverted_index":{"Let":[0],"P":[1,15,72],"be":[2,295,311],"a":[3,17,50,110,138,303],"set":[4,23,83,112,151,249],"of":[5,27,32,37,43,53,60,68,84,105,109,145,148,164,169,174,187,190,214,250,272,329],"$n$":[6],"points":[7,86,215,252],"in":[8,24,269,297],"the":[9,58,66,102,143,155,162,185,230,270,286,298,326],"plane.":[10],"A":[11],"crossing-free":[12,28,107,146],"structure":[13],"on":[14,124,319],"is":[16,78,99,121,177,184,202,229,244,261,266],"straight-edge":[18],"planar":[19],"graph":[20],"with":[21,216,224],"vertex":[22],"P.":[25,113,152,170,191],"Examples":[26],"structures":[29,108,147],"include":[30],"triangulations":[31,69,120,165,201,273],"P,":[33,38,44],"and":[34,91,166,221],"spanning":[35,167],"cycles":[36,168],"also":[39,276],"known":[40,80,100,122],"as":[41],"polygonalizations":[42],"among":[45],"others.":[46],"There":[47],"has":[48,73,87],"been":[49],"large":[51],"amount":[52],"research":[54],"trying":[55],"to":[56,157,232,284,294,310,325],"bound":[57],"number":[59,67,144,163,186,271],"such":[61,239],"structures.":[62,330],"In":[63,133,192,241,308],"particular,":[64,193],"bounding":[65],"spanned":[70],"by":[71,180],"received":[74],"considerable":[75],"attention.":[76],"It":[77],"currently":[79],"that":[81,196,208,247,278,322],"every":[82],"n":[85,251],"at":[88,92,217,255],"most":[89],"O(30n)":[90],"least":[93,218,256],"\u03a9(2.43n)":[94],"triangulations.":[95,132,258],"However,":[96],"much":[97],"less":[98],"about":[101],"algorithmic":[103],"problem":[104],"counting":[106,119,200,289],"given":[111],"For":[114],"example,":[115],"no":[116],"algorithm":[117,198,228,237,265,316],"for":[118,141,160,199,238],"that,":[123],"all":[125,131],"instances,":[126],"performs":[127],"faster":[128],"than":[129,205],"enumerating":[130],"this":[134,260],"paper":[135],"we":[136,194,292],"develop":[137],"general":[139,282,315],"technique":[140,156],"computing":[142,161],"an":[149],"input":[150],"We":[153,275],"apply":[154],"obtain":[158],"algorithms":[159,176],"The":[171],"running":[172],"time":[173],"our":[175,197,227,264,279,314],"upper":[178],"bounded":[179],"nO(k),":[181],"where":[182],"k":[183],"onion":[188],"layers":[189],"show":[195,277],"not":[203],"slower":[204],"O(3.1414n).":[206],"Given":[207],"there":[209],"are":[210,281,323],"several":[211],"well-studied":[212],"configurations":[213],"\u03a9(3.464n)":[219,257],"triangulations,":[220,226],"some":[222],"even":[223],"\u03a9(8n)":[225],"first":[231],"asymptotically":[233],"outperform":[234],"any":[235,248],"enumeration":[236],"instances.":[240],"fact,":[242],"it":[243],"widely":[245],"believed":[246],"must":[253,317],"have":[254],"If":[259],"true,":[262],"then":[263],"strictly":[267],"sub-linear":[268],"counted.":[274],"techniques":[280],"enough":[283],"solve":[285],"restricted":[287],"triangulation":[288],"problem,":[290],"which":[291],"prove":[293],"W[2]-hard":[296],"parameter":[299],"k.":[300],"This":[301],"implies":[302],"\"no":[304],"free":[305],"lunch\"":[306],"result:":[307],"order":[309],"fixed-parameter":[312],"tractable,":[313],"rely":[318],"additional":[320],"properties":[321],"specific":[324],"considered":[327],"class":[328]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}