{"id":"https://openalex.org/W1965880317","doi":"https://doi.org/10.1080/00207160.2014.1002780","title":"Generating strictly binary trees at random based on convex polygon triangulations","display_name":"Generating strictly binary trees at random based on convex polygon triangulations","publication_year":2015,"publication_date":"2015-01-02","ids":{"openalex":"https://openalex.org/W1965880317","doi":"https://doi.org/10.1080/00207160.2014.1002780","mag":"1965880317"},"language":"en","primary_location":{"id":"doi:10.1080/00207160.2014.1002780","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2014.1002780","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-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/A5030954720","display_name":"Yu Jing","orcid":"https://orcid.org/0000-0002-1343-8357"},"institutions":[{"id":"https://openalex.org/I3923682","display_name":"Soochow University","ror":"https://ror.org/05t8y2r12","country_code":"CN","type":"education","lineage":["https://openalex.org/I3923682"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jing Yu","raw_affiliation_strings":["School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu215006, China","School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu215006, China#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu215006, China","institution_ids":["https://openalex.org/I3923682"]},{"raw_affiliation_string":"School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu215006, China#TAB#","institution_ids":["https://openalex.org/I3923682"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087971073","display_name":"Tang Zi-li","orcid":null},"institutions":[{"id":"https://openalex.org/I3923682","display_name":"Soochow University","ror":"https://ror.org/05t8y2r12","country_code":"CN","type":"education","lineage":["https://openalex.org/I3923682"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zi-Li Tang","raw_affiliation_strings":["School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu215006, China","School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu215006, China#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu215006, China","institution_ids":["https://openalex.org/I3923682"]},{"raw_affiliation_string":"School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu215006, China#TAB#","institution_ids":["https://openalex.org/I3923682"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030954720"],"corresponding_institution_ids":["https://openalex.org/I3923682"],"apc_list":null,"apc_paid":null,"fwci":0.8325,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77458948,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"93","issue":"3","first_page":"445","last_page":"452"},"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.9998999834060669,"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.9998999834060669,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9919000267982483,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.8705754280090332},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.74020916223526},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.7304224967956543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7208046913146973},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.692764163017273},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.6805314421653748},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6557847857475281},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5472859144210815},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5198429226875305},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.5057523250579834},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46418896317481995},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42116397619247437},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.4162670373916626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4005064070224762},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3440428078174591},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3342156410217285},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17520391941070557},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1680401861667633},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08556395769119263}],"concepts":[{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.8705754280090332},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.74020916223526},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7304224967956543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7208046913146973},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.692764163017273},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.6805314421653748},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6557847857475281},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5472859144210815},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5198429226875305},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.5057523250579834},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46418896317481995},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42116397619247437},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.4162670373916626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4005064070224762},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3440428078174591},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3342156410217285},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17520391941070557},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1680401861667633},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08556395769119263},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160.2014.1002780","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2014.1002780","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2004566793","https://openalex.org/W2005311123","https://openalex.org/W2013246077","https://openalex.org/W2038276550","https://openalex.org/W2095382539","https://openalex.org/W4242246215"],"related_works":["https://openalex.org/W1979520615","https://openalex.org/W3169685561","https://openalex.org/W2501849745","https://openalex.org/W2364382882","https://openalex.org/W2022598760","https://openalex.org/W2038309235","https://openalex.org/W2949895650","https://openalex.org/W2026697457","https://openalex.org/W2112680985","https://openalex.org/W4292564608"],"abstract_inverted_index":{"A":[0],"set":[1],"of":[2,26,39,67,70],"maximal":[3],"non-intersecting":[4],"diagonals":[5,16],"can":[6,17,87],"decompose":[7],"a":[8,27],"polygon":[9],"into":[10,20],"triangles,":[11],"and":[12,15,23,41],"the":[13,21,65,91],"edges":[14],"be":[18,88],"converted":[19],"external":[22],"internal":[24],"nodes":[25],"strictly":[28,55,71,82],"binary":[29,56,72,83,96],"tree.":[30],"This":[31],"paper":[32,49],"gives":[33,50],"algorithms":[34],"to":[35,53,80,90,93],"generate":[36,54,81,95],"all":[37],"types":[38],"triangulations":[40,42],"at":[43,58,85],"random.":[44,59],"Based":[45],"on":[46],"that,":[47],"this":[48],"an":[51],"algorithm":[52,79,92],"trees":[57,73,84],"The":[60,78],"experimental":[61],"results":[62],"show":[63],"that":[64],"numbers":[66],"various":[68],"shapes":[69],"generated":[74],"are":[75],"nearly":[76],"equal.":[77],"random":[86],"transformed":[89],"randomly":[94],"trees.":[97]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}