{"id":"https://openalex.org/W1660493427","doi":"https://doi.org/10.1142/s1793830910000644","title":"FR\u00c9CHET DISTANCE PROBLEMS IN WEIGHTED REGIONS","display_name":"FR\u00c9CHET DISTANCE PROBLEMS IN WEIGHTED REGIONS","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W1660493427","doi":"https://doi.org/10.1142/s1793830910000644","mag":"1660493427"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830910000644","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000644","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and 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/A5062379532","display_name":"Yam Ki Cheung","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"YAM KI CHEUNG","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078438902","display_name":"Ovidiu Daescu","orcid":"https://orcid.org/0000-0002-0278-4174"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"OVIDIU DAESCU","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062379532"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":0.7243,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.77724853,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"02","issue":"02","first_page":"161","last_page":"179"},"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.9998999834060669,"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.9998999834060669,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9955999851226807,"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/T11106","display_name":"Data Management and Algorithms","score":0.9807999730110168,"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/line-segment","display_name":"Line segment","score":0.6848886013031006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6619979739189148},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6114814281463623},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5734323263168335},{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.5428724884986877},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5324376821517944},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5080709457397461},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.505608320236206},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.306264191865921},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22173506021499634},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10396254062652588},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.10101261734962463}],"concepts":[{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.6848886013031006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6619979739189148},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6114814281463623},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5734323263168335},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.5428724884986877},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5324376821517944},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5080709457397461},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.505608320236206},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.306264191865921},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22173506021499634},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10396254062652588},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.10101261734962463},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830910000644","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000644","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W299328272","https://openalex.org/W1507556857","https://openalex.org/W1571394941","https://openalex.org/W1989723858","https://openalex.org/W2028769163","https://openalex.org/W2084404970","https://openalex.org/W2112346596","https://openalex.org/W2124299914","https://openalex.org/W4229917934"],"related_works":["https://openalex.org/W2384806462","https://openalex.org/W4389950792","https://openalex.org/W2375549870","https://openalex.org/W4376632515","https://openalex.org/W2963303948","https://openalex.org/W2569145132","https://openalex.org/W2061353171","https://openalex.org/W4290885807","https://openalex.org/W2950871975","https://openalex.org/W2103498863"],"abstract_inverted_index":{"We":[0,73],"discuss":[1],"two":[2,20,40,70,80],"versions":[3],"of":[4,26,45,65],"the":[5,14,17,23,27,31,34,37,43,46,50,66,76],"Fr\u00e9chet":[6,67,77],"distance":[7,18,38,68,78],"problem":[8],"in":[9,86],"weighted":[10,24,91],"planar":[11],"subdivisions.":[12],"In":[13,33,52],"first":[15],"one,":[16,36],"between":[19,39,49,69,79],"points":[21,41],"is":[22,42],"length":[25,44],"line":[28],"segment":[29],"joining":[30],"points.":[32,51],"second":[35],"shortest":[47],"path":[48],"both":[53],"cases,":[54],"we":[55],"give":[56],"algorithms":[57],"for":[58],"finding":[59],"a":[60,96],"(1":[61,97],"+":[62,98],"\u220a)-factor":[63,99],"approximation":[64,100],"polygonal":[71,81],"curves.":[72],"also":[74],"consider":[75],"curves":[82],"among":[83],"polyhedral":[84],"obstacles":[85],"[Formula:":[87],"see":[88],"text]":[89],"(1/\u221e":[90],"region":[92],"problem)":[93],"and":[94],"present":[95],"algorithm.":[101]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}