{"id":"https://openalex.org/W2085623174","doi":"https://doi.org/10.1111/1467-8659.1420105","title":"Collision Detection for Animation using Sphere\u2010Trees","display_name":"Collision Detection for Animation using Sphere\u2010Trees","publication_year":1995,"publication_date":"1995-05-01","ids":{"openalex":"https://openalex.org/W2085623174","doi":"https://doi.org/10.1111/1467-8659.1420105","mag":"2085623174"},"language":"en","primary_location":{"id":"doi:10.1111/1467-8659.1420105","is_oa":false,"landing_page_url":"https://doi.org/10.1111/1467-8659.1420105","pdf_url":null,"source":{"id":"https://openalex.org/S67831204","display_name":"Computer Graphics Forum","issn_l":"0167-7055","issn":["0167-7055","1467-8659"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Graphics Forum","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/A5109247474","display_name":"Ian Palmer","orcid":null},"institutions":[{"id":"https://openalex.org/I162608824","display_name":"University of Sussex","ror":"https://ror.org/00ayhx656","country_code":"GB","type":"education","lineage":["https://openalex.org/I162608824"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"I. J. Palmer","raw_affiliation_strings":["Centre for VLSI & Computer Graphics, School of Engineering University of Sussex, Brighton BN1 9QT, UK"],"affiliations":[{"raw_affiliation_string":"Centre for VLSI & Computer Graphics, School of Engineering University of Sussex, Brighton BN1 9QT, UK","institution_ids":["https://openalex.org/I162608824"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109845500","display_name":"R.L. Grimsdale","orcid":null},"institutions":[{"id":"https://openalex.org/I162608824","display_name":"University of Sussex","ror":"https://ror.org/00ayhx656","country_code":"GB","type":"education","lineage":["https://openalex.org/I162608824"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"R. L. Grimsdale","raw_affiliation_strings":["Centre for VLSI & Computer Graphics, School of Engineering University of Sussex, Brighton BN1 9QT, UK"],"affiliations":[{"raw_affiliation_string":"Centre for VLSI & Computer Graphics, School of Engineering University of Sussex, Brighton BN1 9QT, UK","institution_ids":["https://openalex.org/I162608824"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109247474"],"corresponding_institution_ids":["https://openalex.org/I162608824"],"apc_list":{"value":3710,"currency":"USD","value_usd":3710},"apc_paid":null,"fwci":2.9465,"has_fulltext":false,"cited_by_count":194,"citation_normalized_percentile":{"value":0.91618561,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"2","first_page":"105","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9980000257492065,"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.9980000257492065,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976999759674072,"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.9937000274658203,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.8970369100570679},{"id":"https://openalex.org/keywords/bounding-volume","display_name":"Bounding volume","score":0.76082444190979},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7314120531082153},{"id":"https://openalex.org/keywords/octree","display_name":"Octree","score":0.645513653755188},{"id":"https://openalex.org/keywords/animation","display_name":"Animation","score":0.6086976528167725},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5801859498023987},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5712955594062805},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.5307433605194092},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.5028628706932068},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.49893903732299805},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4700046181678772},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.46988916397094727},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4405583441257477},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.4371612071990967},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.4209742844104767},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.4208664298057556},{"id":"https://openalex.org/keywords/computer-animation","display_name":"Computer animation","score":0.4188842475414276},{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.41138333082199097},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.3810976445674896},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35052257776260376},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3164798617362976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2514164447784424},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.24603980779647827},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10905757546424866},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.10823529958724976}],"concepts":[{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.8970369100570679},{"id":"https://openalex.org/C184585634","wikidata":"https://www.wikidata.org/wiki/Q1434060","display_name":"Bounding volume","level":4,"score":0.76082444190979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7314120531082153},{"id":"https://openalex.org/C141297171","wikidata":"https://www.wikidata.org/wiki/Q1143237","display_name":"Octree","level":2,"score":0.645513653755188},{"id":"https://openalex.org/C502989409","wikidata":"https://www.wikidata.org/wiki/Q11425","display_name":"Animation","level":2,"score":0.6086976528167725},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5801859498023987},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5712955594062805},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.5307433605194092},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.5028628706932068},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.49893903732299805},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4700046181678772},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.46988916397094727},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4405583441257477},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4371612071990967},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.4209742844104767},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.4208664298057556},{"id":"https://openalex.org/C69369342","wikidata":"https://www.wikidata.org/wiki/Q1401416","display_name":"Computer animation","level":3,"score":0.4188842475414276},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.41138333082199097},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.3810976445674896},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35052257776260376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3164798617362976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2514164447784424},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.24603980779647827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10905757546424866},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.10823529958724976},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"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/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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.1111/1467-8659.1420105","is_oa":false,"landing_page_url":"https://doi.org/10.1111/1467-8659.1420105","pdf_url":null,"source":{"id":"https://openalex.org/S67831204","display_name":"Computer Graphics Forum","issn_l":"0167-7055","issn":["0167-7055","1467-8659"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Graphics Forum","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/W2286804175","https://openalex.org/W1967846723","https://openalex.org/W1827263124","https://openalex.org/W2963384047","https://openalex.org/W2100010316","https://openalex.org/W2372112443","https://openalex.org/W2347991277","https://openalex.org/W2155788314","https://openalex.org/W2372839449","https://openalex.org/W2384381357"],"abstract_inverted_index":{"Abstract":[0],"The":[1,22,53,68,83,106,154],"detection":[2,61],"of":[3,11,24,88,99,114,124,139,172],"collisions":[4,141],"between":[5,111],"moving":[6],"polyhedral":[7,177],"objects":[8,72,116,165],"is":[9,156],"one":[10],"the":[12,18,31,38,57,74,115,121,128],"most":[13],"computationally":[14],"intensive":[15],"tasks":[16],"in":[17,44,73],"computer":[19],"animation":[20],"process.":[21,67],"use":[23],"object\u2010oriented":[25],"techniques":[26],"to":[27,46,136],"encapsulate":[28],"data":[29,94],"within":[30,120],"objects'":[32],"structures":[33],"compounds":[34],"this":[35,167],"problem":[36],"through":[37],"requirement":[39],"for":[40,50,59,162],"inter\u2010object":[41],"message":[42],"passing":[43],"order":[45],"obtain":[47],"geometric":[48,164],"information":[49],"collision":[51,60,90],"detection.":[52],"REALISM":[54],"system":[55,155],"decreases":[56],"time":[58],"by":[62],"using":[63,77,91],"a":[64,78,92,131,145],"three":[65],"stage":[66,70,85,108],"first":[69],"identifies":[71],"same":[75],"locality":[76],"global":[79],"bounding":[80],"volume":[81],"table.":[82],"second":[84],"locates":[86],"regions":[87,138],"possible":[89],"sphere\u2010tree":[93],"structure":[95],"(a":[96],"hierarchical":[97],"tree":[98],"spheres":[100],"based":[101],"on":[102],"octree\u2010type":[103],"spatial":[104],"subdivision).":[105],"final":[107],"finds":[109],"intersections":[110],"polygonal":[112],"faces":[113],"that":[117],"are":[118],"contained":[119],"intersecting":[122],"pairs":[123],"leaf":[125],"nodes.":[126],"Hence":[127],"algorithm":[129],"uses":[130,144],"spherical":[132],"geometry":[133,152],"approximation":[134],"rapidly":[135],"locate":[137],"potential":[140],"and":[142,159,168],"then":[143],"local":[146],"intersection":[147,178],"test":[148],"with":[149],"actual":[150],"object":[151],"information.":[153],"therefore":[157],"fast":[158],"accurate.":[160],"Tests":[161],"various":[163],"support":[166],"show":[169],"performance":[170],"improvements":[171],"jive":[173],"times":[174],"over":[175],"traditional":[176],"tests.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}