{"id":"https://openalex.org/W1995302928","doi":"https://doi.org/10.1007/pl00009216","title":"A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons","display_name":"A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons","publication_year":1998,"publication_date":"1998-07-01","ids":{"openalex":"https://openalex.org/W1995302928","doi":"https://doi.org/10.1007/pl00009216","mag":"1995302928"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009216","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009216","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/A5005407145","display_name":"Christos Levcopoulos","orcid":"https://orcid.org/0000-0003-0983-7862"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"C. Levcopoulos","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden. christos@dna.lth.se., , , , , , SE","Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden. christos@dna.lth.se., SE"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden. christos@dna.lth.se., , , , , , SE","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden. christos@dna.lth.se., SE","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009999441","display_name":"Drago Krznaric","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"D. Krznaric","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden. drago@dna.lth.se., , , , , , SE","Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden. drago@dna.lth.se., , SE"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden. drago@dna.lth.se., , , , , , SE","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden. drago@dna.lth.se., , SE","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005407145"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.21261445,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"3","first_page":"285","last_page":"311"},"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.9811999797821045,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9758999943733215,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.7965123653411865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7822423577308655},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.7543831467628479},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.736744225025177},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6427014470100403},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6252857446670532},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5964955687522888},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.5641988515853882},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5342096090316772},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.5240542888641357},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.4792056977748871},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4673972725868225},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.4362204670906067},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4324647784233093},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4141031503677368},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3596891760826111},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28935563564300537},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.21099230647087097},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13204899430274963},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1284726858139038}],"concepts":[{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.7965123653411865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7822423577308655},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.7543831467628479},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.736744225025177},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6427014470100403},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6252857446670532},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5964955687522888},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.5641988515853882},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5342096090316772},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.5240542888641357},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.4792056977748871},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4673972725868225},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.4362204670906067},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4324647784233093},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4141031503677368},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3596891760826111},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28935563564300537},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.21099230647087097},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13204899430274963},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1284726858139038},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00009216","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009216","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W16335429","https://openalex.org/W1507123436","https://openalex.org/W1977014689","https://openalex.org/W1983006110","https://openalex.org/W1988781483","https://openalex.org/W2004720635","https://openalex.org/W2053335419","https://openalex.org/W2067084940","https://openalex.org/W2072698009","https://openalex.org/W2074341520","https://openalex.org/W2074863496","https://openalex.org/W2087855749","https://openalex.org/W2116179136","https://openalex.org/W2157274506"],"related_works":["https://openalex.org/W2350914983","https://openalex.org/W2369500278","https://openalex.org/W1483219455","https://openalex.org/W2110610374","https://openalex.org/W2374493932","https://openalex.org/W4302417997","https://openalex.org/W109258179","https://openalex.org/W113718658","https://openalex.org/W1996934342","https://openalex.org/W1972369894"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}