{"id":"https://openalex.org/W1846361160","doi":"https://doi.org/10.20382/jocg.v1i1a7","title":"Computing the maximum detour of a plane geometric graph in subquadratic time","display_name":"Computing the maximum detour of a plane geometric graph in subquadratic time","publication_year":2009,"publication_date":"2009-07-06","ids":{"openalex":"https://openalex.org/W1846361160","doi":"https://doi.org/10.20382/jocg.v1i1a7","mag":"1846361160"},"language":"en","primary_location":{"id":"pmh:oai:journals.carleton.ca/jocg:article/6","is_oa":false,"landing_page_url":"http://jocg.org/index.php/jocg/article/view/6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Journal of Computational Geometry; Vol 1, No 1 (2010); 101\u00e2\u0080\u0093122","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://jocg.org/index.php/jocg/article/view/2974","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Wulff-Nilsen, Christian","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen O, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen O, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077977985"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.08090523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T12176","display_name":"Optimization and Packing Problems","score":0.982699990272522,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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.8713856935501099},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7204848527908325},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6650664806365967},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5768380761146545},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5734568238258362},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5709822773933411},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.530924379825592},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4823576807975769},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.46878138184547424},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.44209024310112},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.439414918422699},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4199659526348114},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3362604081630707},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1677038073539734},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15637129545211792},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12743410468101501},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.113837331533432},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05230256915092468}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8713856935501099},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7204848527908325},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6650664806365967},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5768380761146545},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5734568238258362},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5709822773933411},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.530924379825592},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4823576807975769},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.46878138184547424},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.44209024310112},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.439414918422699},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4199659526348114},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3362604081630707},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1677038073539734},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15637129545211792},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12743410468101501},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.113837331533432},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05230256915092468}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:journals.carleton.ca/jocg:article/6","is_oa":false,"landing_page_url":"http://jocg.org/index.php/jocg/article/view/6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Journal of Computational Geometry; Vol 1, No 1 (2010); 101\u00e2\u0080\u0093122","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ojs.library.carleton.ca:article/2974","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/2974","pdf_url":"https://jocg.org/index.php/jocg/article/view/2974","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry; Vol. 1 No. 1 (2010); 101\u2013122","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:be0d1e84dcce4ae1bd033c1908adc3b6","is_oa":true,"landing_page_url":"https://doaj.org/article/be0d1e84dcce4ae1bd033c1908adc3b6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry, Vol 1, Iss 1 (2010)","raw_type":"article"},{"id":"doi:10.20382/jocg.v1i1a7","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v1i1a7","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/2974","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/2974","pdf_url":"https://jocg.org/index.php/jocg/article/view/2974","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry; Vol. 1 No. 1 (2010); 101\u2013122","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1846361160.pdf","grobid_xml":"https://content.openalex.org/works/W1846361160.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1505970908","https://openalex.org/W1524692559","https://openalex.org/W1552092932","https://openalex.org/W1555007779","https://openalex.org/W1979503961","https://openalex.org/W1979836315","https://openalex.org/W1986084080","https://openalex.org/W2002871084","https://openalex.org/W2028747718","https://openalex.org/W2029448190","https://openalex.org/W2038643780","https://openalex.org/W2068790848","https://openalex.org/W2076014803","https://openalex.org/W2078443814","https://openalex.org/W2087083200","https://openalex.org/W2120424341","https://openalex.org/W2148386043","https://openalex.org/W2320799707"],"related_works":["https://openalex.org/W4301463689","https://openalex.org/W2605313623","https://openalex.org/W2952055179","https://openalex.org/W4302786124","https://openalex.org/W3198523758","https://openalex.org/W2133160845","https://openalex.org/W4287180630","https://openalex.org/W1787126581","https://openalex.org/W2800485060","https://openalex.org/W4302768721"],"abstract_inverted_index":{"Let":[0],"G":[1,47,59,98],"be":[2,106],"a":[3,11],"plane":[4],"geometric":[5],"graph":[6],"where":[7,76],"each":[8],"edge":[9],"is":[10,78],"line":[12],"segment.":[13],"We":[14,83,93],"consider":[15],"the":[16,20,27,49,52,61,79],"problem":[17,71],"of":[18,23,32,41,46,48,81],"computing":[19],"maximum":[21,28,103],"detour":[22,104],"G,":[24],"defined":[25],"as":[26,36,38],"over":[29],"all":[30],"pairs":[31],"distinct":[33],"points":[34,40],"(vertices":[35],"well":[37],"interior":[39],"edges)":[42],"p":[43,55],"and":[44,56,60],"q":[45,57],"ratio":[50],"between":[51,54],"distance":[53,63],"in":[58,108],"Euclidean":[62],"||pq||2.":[64],"The":[65],"fastest":[66],"known":[67],"algorithm":[68],"for":[69],"this":[70],"has":[72,99],"\u0398(n2)":[73],"running":[74,91],"time":[75],"n":[77],"number":[80],"vertices.":[82],"show":[84,95],"how":[85],"to":[86],"obtain":[87],"O(n3/2(log":[88],"n)3)":[89,110],"expected":[90,111],"time.":[92,112],"also":[94],"that":[96],"if":[97],"bounded":[100],"treewidth,":[101],"its":[102],"can":[105],"computed":[107],"O(n(log":[109]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}