{"id":"https://openalex.org/W1533247508","doi":"https://doi.org/10.1007/978-3-540-49382-2_21","title":"A Parallel Approximation Algorithm for Minimum Weight Triangulation","display_name":"A Parallel Approximation Algorithm for Minimum Weight Triangulation","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1533247508","doi":"https://doi.org/10.1007/978-3-540-49382-2_21","mag":"1533247508"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-49382-2_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-49382-2_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5087003217","display_name":"Joachim Gudmundsson","orcid":"https://orcid.org/0000-0002-6778-7990"},"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":"Joachim Gudmundsson","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","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":false,"raw_author_name":"Christos Levcopoulos","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087003217"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.16861122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"233","last_page":"244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9821000099182129,"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"}},"topics":[{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9821000099182129,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9793999791145325,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9702000021934509,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.9108519554138184},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.8503079414367676},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6843064427375793},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.681745171546936},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5100365281105042},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5051937699317932},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4930388629436493},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4797329008579254},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4710286259651184},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.44526076316833496},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4117332398891449},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.39341598749160767},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.29328036308288574},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14235839247703552}],"concepts":[{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.9108519554138184},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.8503079414367676},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6843064427375793},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.681745171546936},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5100365281105042},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5051937699317932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4930388629436493},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4797329008579254},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4710286259651184},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.44526076316833496},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4117332398891449},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.39341598749160767},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.29328036308288574},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14235839247703552},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-49382-2_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-49382-2_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.36.9445","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.9445","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.lth.se/~joakim/Indexkatalog/MWT.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W30059463","https://openalex.org/W175247327","https://openalex.org/W1517009731","https://openalex.org/W1608926682","https://openalex.org/W1974499054","https://openalex.org/W1977014689","https://openalex.org/W2013030397","https://openalex.org/W2017349122","https://openalex.org/W2022913729","https://openalex.org/W2035300538","https://openalex.org/W2047330017","https://openalex.org/W2067084940","https://openalex.org/W2072698009","https://openalex.org/W2075616065","https://openalex.org/W2482430348","https://openalex.org/W2561675875"],"related_works":["https://openalex.org/W2350914983","https://openalex.org/W4302417997","https://openalex.org/W113718658","https://openalex.org/W1996934342","https://openalex.org/W2343655394","https://openalex.org/W1972369894","https://openalex.org/W1998888906","https://openalex.org/W109258179","https://openalex.org/W2001351033","https://openalex.org/W1578000835"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}