{"id":"https://openalex.org/W2047182622","doi":"https://doi.org/10.1016/s0304-3975(02)00431-0","title":"Computing farthest neighbors on a convex polytope","display_name":"Computing farthest neighbors on a convex polytope","publication_year":2003,"publication_date":"2003-02-12","ids":{"openalex":"https://openalex.org/W2047182622","doi":"https://doi.org/10.1016/s0304-3975(02)00431-0","mag":"2047182622"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(02)00431-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(02)00431-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5091366247","display_name":"Otfried Cheong","orcid":"https://orcid.org/0000-0003-4467-7075"},"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":"Otfried Cheong","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University, Utrecht, Netherlands"],"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042351684","display_name":"Chan-Su Shin","orcid":"https://orcid.org/0000-0003-3073-6863"},"institutions":[{"id":"https://openalex.org/I83436808","display_name":"Hankuk University of Foreign Studies","ror":"https://ror.org/051q2m369","country_code":"KR","type":"education","lineage":["https://openalex.org/I83436808"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Chan-Su Shin","raw_affiliation_strings":["School of Electronics and Information Engineering, Hankuk University of Foreign Studies, 449-791 Wangsan-ri, Mohyeon-myeon, Yongin-Shi, Gyeonggi-do, South Korea","School of Electronic and Information Engineering, Hankuk University of Foreign Studies, 449-791, Wangsan-ri, Mohyeon-myeon, Yongin-Shi, Gyeonggi-do, South Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Electronics and Information Engineering, Hankuk University of Foreign Studies, 449-791 Wangsan-ri, Mohyeon-myeon, Yongin-Shi, Gyeonggi-do, South Korea","institution_ids":["https://openalex.org/I83436808"]},{"raw_affiliation_string":"School of Electronic and Information Engineering, Hankuk University of Foreign Studies, 449-791, Wangsan-ri, Mohyeon-myeon, Yongin-Shi, Gyeonggi-do, South Korea#TAB#","institution_ids":["https://openalex.org/I83436808"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019937157","display_name":"Antoine Vigneron","orcid":"https://orcid.org/0000-0003-3586-3431"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Antoine Vigneron","raw_affiliation_strings":["Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China","Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China","institution_ids":["https://openalex.org/I200769079"]},{"raw_affiliation_string":"Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China#TAB#","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091366247"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.005,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.79949979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"296","issue":"1","first_page":"47","last_page":"58"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"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/combinatorics","display_name":"Combinatorics","score":0.8449425101280212},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.7670599222183228},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7210788726806641},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6535290479660034},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.6337164640426636},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.597914457321167},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.5183907151222229},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5150901675224304},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.48324522376060486},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.4376547336578369},{"id":"https://openalex.org/keywords/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.43249428272247314},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4267256259918213},{"id":"https://openalex.org/keywords/diagram","display_name":"Diagram","score":0.42609116435050964},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.37959736585617065},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.13664278388023376},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12467914819717407}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8449425101280212},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.7670599222183228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7210788726806641},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6535290479660034},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6337164640426636},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.597914457321167},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.5183907151222229},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5150901675224304},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.48324522376060486},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.4376547336578369},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.43249428272247314},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4267256259918213},{"id":"https://openalex.org/C186399060","wikidata":"https://www.wikidata.org/wiki/Q959962","display_name":"Diagram","level":2,"score":0.42609116435050964},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.37959736585617065},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.13664278388023376},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12467914819717407},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/s0304-3975(02)00431-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(02)00431-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/07a11c12-e7d7-4190-bc5b-25c0ec7c1457","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/07a11c12-e7d7-4190-bc5b-25c0ec7c1457","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cheong, O, Shin, C S & Vigneron, A 2003, 'Computing farthest neighbors on a convex polytope', Theoretical Computer Science, vol. 296, no. 1, pp. 47-58. https://doi.org/10.1016/S0304-3975(02)00431-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:koasas.kaist.ac.kr:10203/309","is_oa":false,"landing_page_url":"http://hdl.handle.net/10203/309","pdf_url":null,"source":{"id":"https://openalex.org/S4306402435","display_name":"KAIST Institutional Repository (KAIST)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157485424","host_organization_name":"Korea Advanced Institute of Science and Technology","host_organization_lineage":["https://openalex.org/I157485424"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:scholarworks.unist.ac.kr:201301/19961","is_oa":false,"landing_page_url":"http://www.sciencedirect.com/science/article/pii/S0304397502004310","pdf_url":null,"source":{"id":"https://openalex.org/S4306401118","display_name":"Scholarworks@UNIST (Ulsan National Institute of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I48566637","host_organization_name":"Ulsan National Institute of Science and Technology","host_organization_lineage":["https://openalex.org/I48566637"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"ARTICLE"},{"id":"pmh:tue:oai:pure.tue.nl:publications/07a11c12-e7d7-4190-bc5b-25c0ec7c1457","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/07a11c12-e7d7-4190-bc5b-25c0ec7c1457","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 296(1), 47 - 58. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1593563200","https://openalex.org/W1966689742","https://openalex.org/W1981826635","https://openalex.org/W1993216012","https://openalex.org/W2005314985","https://openalex.org/W2058432138","https://openalex.org/W2083706317","https://openalex.org/W2158944832","https://openalex.org/W3138944346","https://openalex.org/W4230101685","https://openalex.org/W4254977685"],"related_works":["https://openalex.org/W1758159897","https://openalex.org/W981962503","https://openalex.org/W2358001426","https://openalex.org/W2363904277","https://openalex.org/W2439874932","https://openalex.org/W2375652826","https://openalex.org/W2383394746","https://openalex.org/W2048874717","https://openalex.org/W2128601753","https://openalex.org/W2153504150"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}