{"id":"https://openalex.org/W2951530714","doi":"https://doi.org/10.1007/s00454-019-00110-0","title":"$$L_1$$ Geodesic Farthest Neighbors in a Simple Polygon and Related Problems","display_name":"$$L_1$$ Geodesic Farthest Neighbors in a Simple Polygon and Related Problems","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2951530714","doi":"https://doi.org/10.1007/s00454-019-00110-0","mag":"2951530714"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-019-00110-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00454-019-00110-0","pdf_url":null,"source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","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/A5067613275","display_name":"Sang Won Bae","orcid":"https://orcid.org/0000-0002-8802-4247"},"institutions":[{"id":"https://openalex.org/I28615091","display_name":"Kyonggi University","ror":"https://ror.org/032xf8h46","country_code":"KR","type":"education","lineage":["https://openalex.org/I28615091"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sang Won Bae","raw_affiliation_strings":["Division of Computer Science and Engineering, Kyonggi University, Suwon, Korea"],"affiliations":[{"raw_affiliation_string":"Division of Computer Science and Engineering, Kyonggi University, Suwon, Korea","institution_ids":["https://openalex.org/I28615091"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067613275"],"corresponding_institution_ids":["https://openalex.org/I28615091"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.7529,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.90761458,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"62","issue":"4","first_page":"743","last_page":"774"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.989799976348877,"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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.9882000088691711,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.8965269327163696},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.814201295375824},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.6960836052894592},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6765789985656738},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.6461972594261169},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5499545335769653},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5105939507484436},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41351670026779175},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.382830947637558},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.26682960987091064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09443432092666626}],"concepts":[{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.8965269327163696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.814201295375824},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.6960836052894592},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6765789985656738},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6461972594261169},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5499545335769653},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5105939507484436},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41351670026779175},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.382830947637558},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.26682960987091064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09443432092666626},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00454-019-00110-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00454-019-00110-0","pdf_url":null,"source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2036376366","display_name":null,"funder_award_id":"2015R1D1A1A01057220","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G7953972958","display_name":null,"funder_award_id":"2018R1D1A1B07042755","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W100746185","https://openalex.org/W1610448541","https://openalex.org/W2016984768","https://openalex.org/W2034348415","https://openalex.org/W2038699153","https://openalex.org/W2046812523","https://openalex.org/W2057578919","https://openalex.org/W2081751185","https://openalex.org/W2132339863","https://openalex.org/W2139594840","https://openalex.org/W2158468450","https://openalex.org/W2294820318","https://openalex.org/W2504974170","https://openalex.org/W2911302472","https://openalex.org/W2943988667","https://openalex.org/W2945210857","https://openalex.org/W2963407686","https://openalex.org/W3041834803","https://openalex.org/W4205821313"],"related_works":["https://openalex.org/W2182952931","https://openalex.org/W2375015103","https://openalex.org/W2378120358","https://openalex.org/W2055893639","https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W1483257504","https://openalex.org/W2987051945","https://openalex.org/W53644101","https://openalex.org/W2154329468"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}