{"id":"https://openalex.org/W2010369728","doi":"https://doi.org/10.1007/s00453-004-1101-6","title":"A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons","display_name":"A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons","publication_year":2004,"publication_date":"2004-06-21","ids":{"openalex":"https://openalex.org/W2010369728","doi":"https://doi.org/10.1007/s00453-004-1101-6","mag":"2010369728"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-004-1101-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1101-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5102161998","display_name":"Jianbo Qian","orcid":null},"institutions":[{"id":"https://openalex.org/I4210093841","display_name":"Institute of Applied Mathematics","ror":"https://ror.org/00h9jx107","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210093841","https://openalex.org/I4210124601","https://openalex.org/I4210148470"]},{"id":"https://openalex.org/I84653119","display_name":"Academia Sinica","ror":"https://ror.org/05bxb3784","country_code":"TW","type":"facility","lineage":["https://openalex.org/I84653119"]}],"countries":["RU","TW"],"is_corresponding":true,"raw_author_name":"Jianbo Qian","raw_affiliation_strings":["Institute of Applied Mathematics, Chinese Academy of Science, Beijing, China","Institute of Applied Mathematics, Chinese Academy of Science, Beijing"],"affiliations":[{"raw_affiliation_string":"Institute of Applied Mathematics, Chinese Academy of Science, Beijing, China","institution_ids":[]},{"raw_affiliation_string":"Institute of Applied Mathematics, Chinese Academy of Science, Beijing","institution_ids":["https://openalex.org/I4210093841","https://openalex.org/I84653119"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110048549","display_name":"Cao An Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I130438778","display_name":"Memorial University of Newfoundland","ror":"https://ror.org/04haebc03","country_code":"CA","type":"education","lineage":["https://openalex.org/I130438778"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Cao An Wang","raw_affiliation_strings":["Department of Computer Science, Memorial University of Newfoundland, St. John\u2019s, Newfoundland,\nA1B 3X5, Canada","Department of Computer Science, Memorial University of Newfoundland, St. John\u2019s, Newfoundland,#N#A1B 3X5"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Memorial University of Newfoundland, St. John\u2019s, Newfoundland,\nA1B 3X5, Canada","institution_ids":["https://openalex.org/I130438778"]},{"raw_affiliation_string":"Department of Computer Science, Memorial University of Newfoundland, St. John\u2019s, Newfoundland,#N#A1B 3X5","institution_ids":["https://openalex.org/I130438778"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102161998"],"corresponding_institution_ids":["https://openalex.org/I4210093841","https://openalex.org/I84653119"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4107,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71903386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"40","issue":"3","first_page":"161","last_page":"172"},"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.9998000264167786,"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.9998000264167786,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9811000227928162,"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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.972000002861023,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.7801525592803955},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7056660056114197},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.7015761137008667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6455979347229004},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6342689990997314},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.6119437217712402},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.6042304039001465},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5643545389175415},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.5184738039970398},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.4664478003978729},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45572346448898315},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44066131114959717},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.420853853225708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36022770404815674},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3530203700065613},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.352355420589447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2436853051185608},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.20808792114257812},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1515006422996521},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12793487310409546}],"concepts":[{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.7801525592803955},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7056660056114197},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7015761137008667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6455979347229004},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6342689990997314},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.6119437217712402},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.6042304039001465},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5643545389175415},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.5184738039970398},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.4664478003978729},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45572346448898315},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44066131114959717},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.420853853225708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36022770404815674},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3530203700065613},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.352355420589447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2436853051185608},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.20808792114257812},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1515006422996521},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12793487310409546},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-004-1101-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1101-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1547668367","https://openalex.org/W1586795290","https://openalex.org/W1977014689","https://openalex.org/W1995302928","https://openalex.org/W2055147909","https://openalex.org/W2072698009","https://openalex.org/W2099435097"],"related_works":["https://openalex.org/W113718658","https://openalex.org/W2350914983","https://openalex.org/W4302417997","https://openalex.org/W2375623303","https://openalex.org/W2348486108","https://openalex.org/W2380307509","https://openalex.org/W2381084059","https://openalex.org/W2055147909","https://openalex.org/W1965735113","https://openalex.org/W2124089227"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}