{"id":"https://openalex.org/W2160027989","doi":"https://doi.org/10.1145/1008653.1008660","title":"Time-critical collision detection using an average-case approach","display_name":"Time-critical collision detection using an average-case approach","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W2160027989","doi":"https://doi.org/10.1145/1008653.1008660","mag":"2160027989"},"language":"en","primary_location":{"id":"doi:10.1145/1008653.1008660","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1008653.1008660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM symposium on Virtual reality software and technology","raw_type":"proceedings-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/A5022024731","display_name":"Jan Klein","orcid":"https://orcid.org/0000-0001-9421-3549"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jan Klein","raw_affiliation_strings":["University of Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052869741","display_name":"Gabriel Zachmann","orcid":"https://orcid.org/0000-0001-8155-1127"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gabriel Zachmann","raw_affiliation_strings":["University of Bonn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1562,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.8864762,"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":"22","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9962000250816345,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/tree-traversal","display_name":"Tree traversal","score":0.856741189956665},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.7420514822006226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7418290972709656},{"id":"https://openalex.org/keywords/bounding-volume","display_name":"Bounding volume","score":0.6873269081115723},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6061970591545105},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5948068499565125},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5625940561294556},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5575418472290039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5416392087936401},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5012023448944092},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4886472821235657},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43827003240585327},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.421907901763916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2427143156528473},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2030002474784851},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.18053558468818665},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15998706221580505}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.856741189956665},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.7420514822006226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7418290972709656},{"id":"https://openalex.org/C184585634","wikidata":"https://www.wikidata.org/wiki/Q1434060","display_name":"Bounding volume","level":4,"score":0.6873269081115723},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6061970591545105},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5948068499565125},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5625940561294556},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5575418472290039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5416392087936401},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5012023448944092},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4886472821235657},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43827003240585327},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.421907901763916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2427143156528473},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2030002474784851},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.18053558468818665},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15998706221580505},{"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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":4,"locations":[{"id":"doi:10.1145/1008653.1008660","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1008653.1008660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM symposium on Virtual reality software and technology","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.119","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.informatik.uni-bonn.de/II/ag-klein/people/zach/papers/vrst03_print.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.9442","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.upb.de/cs/ag-madh/WWW/english/janklein/p22-klein.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.9893","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.9893","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cg.cs.uni-bonn.de/docs/publications/2003/klein-2003-time-critical.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1582233937","https://openalex.org/W1999072118","https://openalex.org/W1999250663","https://openalex.org/W2007131411","https://openalex.org/W2033849809","https://openalex.org/W2039336640","https://openalex.org/W2051494485","https://openalex.org/W2053212688","https://openalex.org/W2058598896","https://openalex.org/W2068297738","https://openalex.org/W2068416637","https://openalex.org/W2081452322","https://openalex.org/W2085623174","https://openalex.org/W2101275250","https://openalex.org/W2109817089","https://openalex.org/W2113525359","https://openalex.org/W2123703543","https://openalex.org/W2125614177","https://openalex.org/W2126539456","https://openalex.org/W2129296985","https://openalex.org/W2129511102","https://openalex.org/W2138722056","https://openalex.org/W2139302801","https://openalex.org/W2141907107","https://openalex.org/W2154886026","https://openalex.org/W2155672182","https://openalex.org/W2167879633","https://openalex.org/W2169316272","https://openalex.org/W3036105742","https://openalex.org/W4244144430","https://openalex.org/W4285719527","https://openalex.org/W6667310475"],"related_works":["https://openalex.org/W1650636191","https://openalex.org/W2171909355","https://openalex.org/W116926196","https://openalex.org/W2348314797","https://openalex.org/W1827263124","https://openalex.org/W2088590145","https://openalex.org/W2100010316","https://openalex.org/W1995373990","https://openalex.org/W2155788314","https://openalex.org/W2372839449"],"abstract_inverted_index":{"We":[0],"present":[1,160],"a":[2,31,60,102,136,166,177,181],"novel,":[3],"generic":[4],"framework":[5],"and":[6,19,70,159,163],"algorithm":[7],"for":[8],"hierarchical":[9],"collision":[10,23,57,122],"detection,":[11],"which":[12],"allows":[13],"an":[14,26,76,145],"application":[15],"to":[16,51,117,129,184],"balance":[17],"speed":[18],"quality":[20],"of":[21,34,55,66,93,96,179],"the":[22,35,43,53,56,90,94,121,172],"detection.We":[24],"pursue":[25],"average-case":[27],"approach":[28,125,154],"that":[29,73,138],"yields":[30],"numerical":[32],"measure":[33],"quality.":[36],"This":[37,81],"can":[38,49,82,126],"either":[39],"be":[40,83,127],"specified":[41],"by":[42,86],"simulation":[44],"or":[45,47,148],"interaction,":[46],"it":[48],"help":[50],"assess":[52],"result":[54],"detection":[58,123],"in":[59,101,142],"time-critical":[61],"system.Conceptually,":[62],"we":[63,108,134],"consider":[64],"sets":[65],"polygons":[67,97,119],"during":[68,120],"traversal":[69],"estimate":[71],"probabilities":[72],"there":[74],"is":[75],"intersection":[77,113],"among":[78],"these":[79],"sets.":[80],"done":[84],"efficiently":[85],"storing":[87],"characteristics":[88],"about":[89,180],"average":[91],"distribution":[92],"set":[95],"with":[98,155,165,186],"each":[99],"node":[100],"bounding":[103],"volume":[104],"hierarchy":[105],"(BVH).":[106],"Consequently,":[107],"neither":[109],"need":[110],"any":[111,118,131],"polygon":[112],"tests":[114],"nor":[115],"access":[116],"process.Our":[124],"applied":[128],"virtually":[130],"BVH.":[132],"Therefore,":[133],"call":[135],"BVH":[137],"has":[139],"been":[140],"augmented":[141],"this":[143],"way":[144],"average-distribution":[146],"tree":[147],"ADB-tree.We":[149],"have":[150],"implemented":[151],"our":[152],"new":[153],"two":[156],"basic":[157],"BVHs":[158],"performance":[161],"measurements":[162],"comparisons":[164],"very":[167],"fast":[168],"previous":[169],"algorithm,":[170],"namely":[171],"DOP-tree.":[173],"The":[174],"results":[175],"show":[176],"speedup":[178],"factor":[182],"3":[183],"6":[185],"only":[187],"approximately":[188],"4%":[189],"error.":[190]},"counts_by_year":[{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}