{"id":"https://openalex.org/W1507123436","doi":"https://doi.org/10.1007/3-540-61422-2_140","title":"A fast heuristic for approximating the minimum weight triangulation","display_name":"A fast heuristic for approximating the minimum weight triangulation","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1507123436","doi":"https://doi.org/10.1007/3-540-61422-2_140","mag":"1507123436"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-61422-2_140","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61422-2_140","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":"conference-paper","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":false,"raw_author_name":"Christos Levcopoulos","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden","Lund Univ.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ.#TAB#","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":"Drago Krznaric","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden","Lund Univ.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Lund Univ.#TAB#","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.361,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5274463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"296","last_page":"308"},"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9940999746322632,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9876000285148621,"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/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.9370468854904175},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.819991946220398},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6604945063591003},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6197311282157898},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.5066321492195129},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4967973530292511},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.48230624198913574},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.4816359579563141},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4719737470149994},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.44775646924972534},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4456065893173218},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.43562811613082886},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4262143075466156},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4200974702835083},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4136184751987457},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37081485986709595},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.36490598320961},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3510802984237671},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34815824031829834},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32152408361434937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22792384028434753},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1491476595401764}],"concepts":[{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.9370468854904175},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.819991946220398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6604945063591003},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6197311282157898},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.5066321492195129},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4967973530292511},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.48230624198913574},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.4816359579563141},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4719737470149994},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.44775646924972534},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4456065893173218},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.43562811613082886},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4262143075466156},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4200974702835083},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4136184751987457},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37081485986709595},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.36490598320961},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3510802984237671},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34815824031829834},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32152408361434937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22792384028434753},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1491476595401764},{"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/3-540-61422-2_140","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61422-2_140","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W30059463","https://openalex.org/W146193993","https://openalex.org/W175247327","https://openalex.org/W1491725382","https://openalex.org/W1497536023","https://openalex.org/W1589303579","https://openalex.org/W1985165973","https://openalex.org/W1988781483","https://openalex.org/W1994135781","https://openalex.org/W2004720635","https://openalex.org/W2004807868","https://openalex.org/W2005314985","https://openalex.org/W2010685496","https://openalex.org/W2011766923","https://openalex.org/W2041437464","https://openalex.org/W2050417465","https://openalex.org/W2053335419","https://openalex.org/W2070754066","https://openalex.org/W2072698009","https://openalex.org/W2075616065","https://openalex.org/W2157274506","https://openalex.org/W2219094305","https://openalex.org/W2911302472","https://openalex.org/W6635000225","https://openalex.org/W6647620968","https://openalex.org/W6660736670"],"related_works":["https://openalex.org/W2350914983","https://openalex.org/W109258179","https://openalex.org/W4302417997","https://openalex.org/W1996934342","https://openalex.org/W113718658","https://openalex.org/W2001351033","https://openalex.org/W2028864160","https://openalex.org/W1483219455","https://openalex.org/W2006234047","https://openalex.org/W1578000835"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}