{"id":"https://openalex.org/W2159148319","doi":"https://doi.org/10.1142/s0218195996000034","title":"AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM","display_name":"AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM","publication_year":1996,"publication_date":"1996-03-01","ids":{"openalex":"https://openalex.org/W2159148319","doi":"https://doi.org/10.1142/s0218195996000034","mag":"2159148319"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195996000034","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195996000034","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/A5037274151","display_name":"Paul J. Heffernan","orcid":null},"institutions":[{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"PAUL J. HEFFERNAN","raw_affiliation_strings":["Department of Mathematical Sciences, Memphis State University, Memphis, Tennessee 38152, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Memphis State University, Memphis, Tennessee 38152, USA","institution_ids":["https://openalex.org/I94658018"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037274151"],"corresponding_institution_ids":["https://openalex.org/I94658018"],"apc_list":null,"apc_paid":null,"fwci":1.3898,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.84063981,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"06","issue":"01","first_page":"15","last_page":"44"},"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.9746000170707703,"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.9746000170707703,"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.9745000004768372,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/clockwise","display_name":"Clockwise","score":0.7437856793403625},{"id":"https://openalex.org/keywords/guard","display_name":"Guard (computer science)","score":0.7215537428855896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6874297857284546},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.6303807497024536},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.624089241027832},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5627153515815735},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5358926057815552},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49994397163391113},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4697589874267578},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4520998001098633},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4487912058830261},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.29041120409965515},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23911920189857483},{"id":"https://openalex.org/keywords/rotation","display_name":"Rotation (mathematics)","score":0.2241869866847992},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12846899032592773},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09671291708946228}],"concepts":[{"id":"https://openalex.org/C70026782","wikidata":"https://www.wikidata.org/wiki/Q16726164","display_name":"Clockwise","level":3,"score":0.7437856793403625},{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.7215537428855896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6874297857284546},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6303807497024536},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.624089241027832},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5627153515815735},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5358926057815552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49994397163391113},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4697589874267578},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4520998001098633},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4487912058830261},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.29041120409965515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23911920189857483},{"id":"https://openalex.org/C74050887","wikidata":"https://www.wikidata.org/wiki/Q848368","display_name":"Rotation (mathematics)","level":2,"score":0.2241869866847992},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12846899032592773},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09671291708946228},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195996000034","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195996000034","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2362403113","https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W2987051945","https://openalex.org/W53644101","https://openalex.org/W2154329468","https://openalex.org/W2389833224","https://openalex.org/W1571990143","https://openalex.org/W2372903818","https://openalex.org/W1567510565"],"abstract_inverted_index":{"In":[0,54],"this":[1],"paper":[2],"we":[3,30],"give":[4,85],"optimal":[5],"solutions":[6],"for":[7,80,90],"several":[8],"versions":[9],"of":[10,106,113,121],"the":[11,24,49,55,69,94,104,107,111,114],"two-guard":[12],"problem.":[13,97],"Given":[14],"a":[15,86,91],"simple":[16],"polygon":[17],"P":[18,37],"with":[19],"vertices":[20],"s":[21,39,65],"and":[22,44,68,117,124],"t,":[23,41],"straight":[25],"walk":[26,57,96],"problem":[27],"asks":[28],"whether":[29],"can":[31],"move":[32,61],"two":[33,115],"points":[34,50,60],"monotonically":[35],"on":[36,110],"from":[38,64,71],"to":[40,66,73],"one":[42,45,63],"clockwise":[43],"counter-clockwise,":[46],"such":[47],"that":[48],"are":[51],"always":[52],"co-visible.":[53],"counter":[56],"problem,":[58],"both":[59,81],"clockwise,":[62],"t":[67,72],"other":[70],"s.":[74],"We":[75,83,98],"provide":[76],"\u0398(n)-time":[77,87],"constructive":[78],"algorithms":[79],"problems.":[82],"also":[84],"decision":[88],"algorithm":[89],"version":[92],"called":[93],"general":[95],"obtain":[99],"our":[100],"results":[101],"by":[102,118],"examining":[103],"structure":[105],"restrictions":[108],"placed":[109],"motion":[112],"points,":[116],"employing":[119],"properties":[120],"shortest":[122,125],"paths":[123],"path":[126],"trees.":[127]},"counts_by_year":[{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}