{"id":"https://openalex.org/W2126716943","doi":"https://doi.org/10.1142/s0218195908002581","title":"FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM","display_name":"FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2126716943","doi":"https://doi.org/10.1142/s0218195908002581","mag":"2126716943"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195908002581","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195908002581","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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/A5046295690","display_name":"Magdalene Grantson Borgelt","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"MAGDALENE GRANTSON BORGELT","raw_affiliation_strings":["Department of Information and Computing Sciences, PO Box 80.007, 3508 TA Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, PO Box 80.007, 3508 TA Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109526047","display_name":"Christian Borgelt","orcid":null},"institutions":[{"id":"https://openalex.org/I4210118569","display_name":"European Centre for Soft Computing","ror":"https://ror.org/02b1fy379","country_code":"ES","type":"facility","lineage":["https://openalex.org/I4210118569"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"CHRISTIAN BORGELT","raw_affiliation_strings":["European Center for Soft Computing, c/ Gonzalo Guti\u00e9rrez Quir\u00f3s s/n, 33600 Mieres, Spain"],"affiliations":[{"raw_affiliation_string":"European Center for Soft Computing, c/ Gonzalo Guti\u00e9rrez Quir\u00f3s s/n, 33600 Mieres, Spain","institution_ids":["https://openalex.org/I4210118569"]}]},{"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, 221 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046295690"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":1.486,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.87381014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"18","issue":"03","first_page":"185","last_page":"220"},"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.9991999864578247,"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.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9847000241279602,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9693999886512756,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.6551869511604309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6366507411003113},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6177939176559448},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5303849577903748},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.5207781195640564},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.479618638753891},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.46610933542251587},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.43099939823150635},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.42406585812568665},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41268569231033325},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4011170268058777},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3703172206878662},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.2145576775074005},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.14723625779151917},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.12451907992362976}],"concepts":[{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.6551869511604309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6366507411003113},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6177939176559448},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5303849577903748},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.5207781195640564},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.479618638753891},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.46610933542251587},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.43099939823150635},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.42406585812568665},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41268569231033325},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4011170268058777},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3703172206878662},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.2145576775074005},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.14723625779151917},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.12451907992362976},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0218195908002581","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195908002581","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},{"id":"pmh:oai:lup.lub.lu.se:428efced-2903-4f93-9654-a65473b04f26","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/1254955","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0218-1959","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W85147590","https://openalex.org/W1496528426","https://openalex.org/W1526955206","https://openalex.org/W1536704310","https://openalex.org/W1547668367","https://openalex.org/W1788673054","https://openalex.org/W1964316024","https://openalex.org/W1974079807","https://openalex.org/W1982691959","https://openalex.org/W1983006110","https://openalex.org/W1988781483","https://openalex.org/W1994135781","https://openalex.org/W2011039300","https://openalex.org/W2044096159","https://openalex.org/W2047330017","https://openalex.org/W2053335419","https://openalex.org/W2068320309","https://openalex.org/W2072698009","https://openalex.org/W2075616065","https://openalex.org/W2078177956","https://openalex.org/W2083525325","https://openalex.org/W2089506206","https://openalex.org/W2110610374","https://openalex.org/W2124205318","https://openalex.org/W2157350199","https://openalex.org/W2407641981","https://openalex.org/W2585222901","https://openalex.org/W2590130176","https://openalex.org/W2752885492","https://openalex.org/W2888871578","https://openalex.org/W2913688336","https://openalex.org/W3145128584","https://openalex.org/W3160897418","https://openalex.org/W4256149448","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2374493932","https://openalex.org/W2369500278","https://openalex.org/W2070754066","https://openalex.org/W2608536130","https://openalex.org/W2152688962","https://openalex.org/W2102467404","https://openalex.org/W2359682335","https://openalex.org/W2352073446","https://openalex.org/W1587445384","https://openalex.org/W573959945"],"abstract_inverted_index":{"We":[0],"discuss":[1],"and":[2,26,78,107,133,159],"compare":[3],"four":[4,43,119,155],"fixed":[5],"parameter":[6],"algorithms":[7,44,87,98,120,156],"for":[8,36],"finding":[9],"the":[10,24,30,47,84,95,111,126],"minimum":[11],"weight":[12],"triangulation":[13],"of":[14,39,59,83,91,118,147,162],"a":[15,37,57,138,144],"simple":[16,68],"polygon":[17],"with":[18,167],"(n":[19],"\u2013":[20],"k)":[21],"vertices":[22,28],"on":[23,46,66],"perimeter":[25],"k":[27],"in":[29,101,157],"interior":[31],"(hole":[32],"vertices),":[33],"that":[34],"is,":[35],"total":[38],"n":[40],"vertices.":[41],"All":[42],"rely":[45],"same":[48],"abstract":[49],"divide-and-conquer":[50],"scheme,":[51],"which":[52,72],"is":[53],"made":[54],"efficient":[55],"by":[56],"variant":[58],"dynamic":[60],"programming.":[61],"They":[62],"are":[63],"essentially":[64],"based":[65],"two":[67,86,97],"observations":[69],"about":[70],"triangulations,":[71],"give":[73],"rise":[74],"to":[75,103,109,123,136],"triangle":[76],"splits":[77],"paths":[79],"splits.":[80],"While":[81],"each":[82],"first":[85],"uses":[88],"only":[89],"one":[90],"these":[92,148],"split":[93],"types,":[94],"last":[96],"combine":[99],"them":[100],"order":[102],"achieve":[104,137],"certain":[105],"improvements":[106],"thus":[108,134],"reduce":[110],"time":[112],"complexity.":[113],"By":[114],"discussing":[115],"this":[116,168],"sequence":[117],"we":[121,152,164],"try":[122],"bring":[124],"out":[125,166],"core":[127],"ideas":[128],"as":[129,131,141,143],"clearly":[130],"possible":[132],"strive":[135],"deeper":[139],"understanding":[140],"well":[142],"simpler":[145],"specification":[146],"approaches.":[149],"In":[150],"addition,":[151],"implemented":[153],"all":[154],"Java":[158],"report":[160],"results":[161],"experiments":[163],"carried":[165],"implementation.":[169]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}