{"id":"https://openalex.org/W2005622716","doi":"https://doi.org/10.1145/2159365.2159424","title":"Using navigation meshes for collision detection","display_name":"Using navigation meshes for collision detection","publication_year":2011,"publication_date":"2011-06-29","ids":{"openalex":"https://openalex.org/W2005622716","doi":"https://doi.org/10.1145/2159365.2159424","mag":"2005622716"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/2159365.2159424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5007514244","display_name":"D. Hunter Hale","orcid":null},"institutions":[{"id":"https://openalex.org/I102149020","display_name":"University of North Carolina at Charlotte","ror":"https://ror.org/04dawnj30","country_code":"US","type":"funder","lineage":["https://openalex.org/I102149020"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Hunter Hale","raw_affiliation_strings":["University of North Carolina at Charlotte, Charlotte, NC"],"affiliations":[{"raw_affiliation_string":"University of North Carolina at Charlotte, Charlotte, NC","institution_ids":["https://openalex.org/I102149020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058143432","display_name":"G. Michael Youngblood","orcid":"https://orcid.org/0000-0001-9490-0015"},"institutions":[{"id":"https://openalex.org/I102149020","display_name":"University of North Carolina at Charlotte","ror":"https://ror.org/04dawnj30","country_code":"US","type":"funder","lineage":["https://openalex.org/I102149020"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Michael Youngblood","raw_affiliation_strings":["University of North Carolina at Charlotte, Charlotte, NC"],"affiliations":[{"raw_affiliation_string":"University of North Carolina at Charlotte, Charlotte, NC","institution_ids":["https://openalex.org/I102149020"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":65},"biblio":{"volume":null,"issue":null,"first_page":"316","last_page":"318"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9986,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9986,"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.995,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.981,"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/space-partitioning","display_name":"Space partitioning","score":0.53030276}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.759603},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6994926},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.69677556},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.6924176},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6603724},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.60620683},{"id":"https://openalex.org/C13670688","wikidata":"https://www.wikidata.org/wiki/Q3500548","display_name":"Space partitioning","level":2,"score":0.53030276},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.46302265},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.46082178},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42390442},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.42104936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29417104},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.12687749},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12205091},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/2159365.2159424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":3,"referenced_works":["https://openalex.org/W1590464470","https://openalex.org/W2125313965","https://openalex.org/W88679629"],"related_works":["https://openalex.org/W93624718","https://openalex.org/W4387251676","https://openalex.org/W4385261619","https://openalex.org/W2365690707","https://openalex.org/W2155672182","https://openalex.org/W2144265691","https://openalex.org/W2133402426","https://openalex.org/W2064670891","https://openalex.org/W1605991620","https://openalex.org/W113683524"],"abstract_inverted_index":{"Traditionally,":[0],"tree-based":[1,44],"spatial":[2,14,45,92,108,149,157,170,219],"data":[3,46,58,79,88,150,171],"structures":[4,11,47,80,172],"such":[5,12],"as":[6,13,136],"k-d":[7,153,196],"trees":[8],"or":[9],"hash-based":[10],"hashing":[15,220],"are":[16,25,68,81],"used":[17,26,146],"to":[18,40,141,165,173,195],"accelerate":[19],"collision":[20,65,96,138,187,216,222],"detection,":[21],"and":[22,64,75,98,144,155],"navigation":[23,63,134,213],"meshes":[24],"for":[27,60,94,102],"agent":[28,62],"path":[29,103],"planning.":[30,104],"In":[31,198],"this":[32],"paper,":[33],"we":[34],"present":[35,125,205],"a":[36,56,86,133,137,166,175,182],"series":[37],"of":[38,54,73,128,148,177,203],"algorithms":[39],"replace":[41],"the":[42,49,71,126,152,156,201,207,212],"traditional":[43],"with":[48],"graph-based":[50],"navigation-mesh.":[51],"The":[52],"advantages":[53],"using":[55,106],"single":[57,87],"structure":[59,89],"both":[61,91],"detection":[66,97,139,188,217,223],"acceleration":[67],"two-fold.":[69],"First,":[70],"costs":[72],"constructing":[74],"maintaining":[76],"two":[77,142],"unique":[78],"cut":[82],"in":[83,186,193,206],"half":[84],"if":[85],"provides":[90],"groupings":[93],"rapid":[95],"search":[99],"space":[100],"reduction":[101],"Second,":[105],"one":[107],"structure,":[109],"development":[110],"time":[111,189],"can":[112],"be":[113],"shorter":[114],"and,":[115],"at":[116],"runtime,":[117],"there":[118],"is":[119],"generally":[120],"less":[121],"memory":[122],"overhead.":[123],"We":[124,160],"results":[127,180],"an":[129],"experiment":[130],"that":[131],"compares":[132],"mesh":[135,214],"accelerator":[140],"popular":[143],"commonly":[145],"forms":[147],"structures,":[151],"tree":[154],"hash":[158],"map.":[159],"also":[161],"compare":[162],"its":[163],"performance":[164],"world":[167,208],"without":[168],"any":[169],"provide":[174],"baseline":[176],"performance.":[178],"Our":[179],"show":[181],"fifty":[183],"percent":[184],"decrease":[185],"between":[190],"dynamic":[191],"objects":[192,204],"comparison":[194],"trees.":[197],"addition,":[199],"until":[200],"number":[202],"exceeds":[209],"three":[210],"thousand":[211],"accelerated":[215,221],"outperforms":[218],"across":[224],"all":[225],"tests.":[226]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2005622716","counts_by_year":[],"updated_date":"2025-01-24T06:07:57.253107","created_date":"2016-06-24"}