{"id":"https://openalex.org/W2004367845","doi":"https://doi.org/10.1145/2462356.2462392","title":"A simple aggregative algorithm for counting triangulations of planar point sets and related problems","display_name":"A simple aggregative algorithm for counting triangulations of planar point sets and related problems","publication_year":2013,"publication_date":"2013-06-17","ids":{"openalex":"https://openalex.org/W2004367845","doi":"https://doi.org/10.1145/2462356.2462392","mag":"2004367845"},"language":"en","primary_location":{"id":"doi:10.1145/2462356.2462392","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462392","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-ninth 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":["Saarland University, Saarbrucken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarbrucken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083878690","display_name":"Raimund Seidel","orcid":"https://orcid.org/0000-0003-2349-785X"},"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":"Raimund Seidel","raw_affiliation_strings":["Saarland University, Saarbrucken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarbrucken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":9.1146,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.97134849,"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":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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.9987000226974487,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.7426658272743225},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.7390812635421753},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5482443571090698},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5461706519126892},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5370708107948303},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30059701204299927},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1358107030391693},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.12252727150917053}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7426658272743225},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.7390812635421753},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5482443571090698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5461706519126892},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5370708107948303},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30059701204299927},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1358107030391693},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.12252727150917053},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2462356.2462392","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462392","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-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.359.7741","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.359.7741","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/A Simple Aggregative Algorithm for Counting Triangulations of Planar Point Sets and Related Problems - SoCG 2013.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W13988344","https://openalex.org/W22200857","https://openalex.org/W67063475","https://openalex.org/W116735976","https://openalex.org/W1525312108","https://openalex.org/W1817632074","https://openalex.org/W1992578069","https://openalex.org/W1992743664","https://openalex.org/W2000008376","https://openalex.org/W2017870334","https://openalex.org/W2025525764","https://openalex.org/W2030996579","https://openalex.org/W2069225643","https://openalex.org/W2085179971","https://openalex.org/W2089506206","https://openalex.org/W2090290344","https://openalex.org/W2090529709","https://openalex.org/W2096398399","https://openalex.org/W2099843275","https://openalex.org/W2122052024","https://openalex.org/W2132345770","https://openalex.org/W2152141013","https://openalex.org/W2161968825","https://openalex.org/W2163448076","https://openalex.org/W2170949858","https://openalex.org/W2173213060","https://openalex.org/W2561675875","https://openalex.org/W2594841682","https://openalex.org/W3015776104","https://openalex.org/W4233537290","https://openalex.org/W4240555338","https://openalex.org/W6674306307"],"related_works":["https://openalex.org/W1887191277","https://openalex.org/W2334954212","https://openalex.org/W2776018879","https://openalex.org/W2230691193","https://openalex.org/W4248389398","https://openalex.org/W2794684478","https://openalex.org/W2964285269","https://openalex.org/W18977309","https://openalex.org/W2018619927","https://openalex.org/W1965976175"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2],"algorithm":[3,34,56],"that":[4,35],"determines":[5],"the":[6,21,31,32],"number":[7],"(S)":[8,42],"of":[9,13,17,52],"straight":[10],"line":[11],"triangulations":[12],"a":[14],"set":[15,50],"S":[16,51],"n":[18,53],"points":[19],"in":[20,23],"plane":[22],"worst":[24],"case":[25],"time":[26],"O(n2":[27],"2n).":[28],"This":[29],"is":[30,36,43],"first":[33],"provably":[37],"faster":[38],"than":[39],"enumeration,":[40],"since":[41],"known":[44],"to":[45],"be":[46],"\u03a9(2.43n)":[47],"for":[48],"any":[49],"points.":[54],"Our":[55],"requires":[57],"exponential":[58],"space.":[59]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}