{"id":"https://openalex.org/W2565105896","doi":"https://doi.org/10.1145/2948628.2948640","title":"Efficient collision culling by a succinct bi-dimensional sweep and Prune algorithm","display_name":"Efficient collision culling by a succinct bi-dimensional sweep and Prune algorithm","publication_year":2016,"publication_date":"2016-04-27","ids":{"openalex":"https://openalex.org/W2565105896","doi":"https://doi.org/10.1145/2948628.2948640","mag":"2565105896"},"language":"en","primary_location":{"id":"doi:10.1145/2948628.2948640","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2948628.2948640","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd Spring Conference on Computer Graphics","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/A5007292971","display_name":"Gabriele Capannini","orcid":"https://orcid.org/0000-0002-2558-5354"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Gabriele Capannini","raw_affiliation_strings":["M\u00e4lardalen University, Sweden"],"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen University, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012819592","display_name":"Thomas Larsson","orcid":"https://orcid.org/0000-0002-1550-0994"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Thomas Larsson","raw_affiliation_strings":["M\u00e4lardalen University, Sweden"],"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen University, Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007292971"],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":0.7769,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73812862,"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":"25","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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.9889000058174133,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9860000014305115,"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/computer-science","display_name":"Computer science","score":0.7066313028335571},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6047837734222412},{"id":"https://openalex.org/keywords/false-positive-paradox","display_name":"False positive paradox","score":0.6009508371353149},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5820618867874146},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5454646944999695},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4863182008266449},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.4839377999305725},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.43964844942092896},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4214981198310852},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2889396548271179},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18384963274002075},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13102996349334717}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7066313028335571},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6047837734222412},{"id":"https://openalex.org/C64869954","wikidata":"https://www.wikidata.org/wiki/Q1859747","display_name":"False positive paradox","level":2,"score":0.6009508371353149},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5820618867874146},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5454646944999695},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4863182008266449},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.4839377999305725},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.43964844942092896},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4214981198310852},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2889396548271179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18384963274002075},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13102996349334717},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2948628.2948640","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2948628.2948640","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd Spring Conference on Computer Graphics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W11688937","https://openalex.org/W100509257","https://openalex.org/W127947978","https://openalex.org/W241655456","https://openalex.org/W599341852","https://openalex.org/W1497695555","https://openalex.org/W1497953515","https://openalex.org/W1986345666","https://openalex.org/W1991912971","https://openalex.org/W2005102720","https://openalex.org/W2021332852","https://openalex.org/W2055354539","https://openalex.org/W2083222410","https://openalex.org/W2086940379","https://openalex.org/W2094539937","https://openalex.org/W2102587756","https://openalex.org/W2125142700","https://openalex.org/W2127794343","https://openalex.org/W2136014417","https://openalex.org/W2136675308","https://openalex.org/W2153989016","https://openalex.org/W2165558283","https://openalex.org/W2205345940","https://openalex.org/W2243938989","https://openalex.org/W2245064587","https://openalex.org/W2911302472","https://openalex.org/W2913400639","https://openalex.org/W3041834803","https://openalex.org/W4376597589"],"related_works":["https://openalex.org/W3138645172","https://openalex.org/W2148917807","https://openalex.org/W3215492696","https://openalex.org/W2257960210","https://openalex.org/W2028510469","https://openalex.org/W913501818","https://openalex.org/W2021628292","https://openalex.org/W4379525781","https://openalex.org/W1987135480","https://openalex.org/W2155672182"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"improved":[3],"variant":[4],"of":[5,67,101,133,135],"the":[6,60,65,73,99,108],"broad":[7],"phase":[8],"collision-detection":[9],"algorithm":[10,26,94,124],"called":[11],"Sweep":[12],"and":[13,34,53,113],"Prune":[14],"(SaP)":[15],"for":[16,80],"large":[17],"datasets":[18],"in":[19,115,129,138],"three-dimensional":[20],"environments.":[21],"Unlike":[22],"previous":[23],"solutions,":[24],"our":[25,93,123],"performs":[27],"a":[28,32,35,44,77,102,116],"stepwise":[29],"sweep":[30],"over":[31],"primary":[33],"secondary":[36],"axis,":[37],"which":[38,75,106],"makes":[39],"it":[40,46,54],"inherently":[41],"bi-dimensional.":[42],"As":[43],"result,":[45],"gracefully":[47],"handles":[48],"even":[49,137],"challenging":[50],"high-density":[51],"scenarios,":[52],"is":[55,76],"much":[56],"less":[57],"sensitive":[58],"to":[59,110],"interval":[61],"clustering":[62],"problem,":[63],"where":[64],"number":[66],"false":[68],"positives":[69],"grows":[70],"superlinearly":[71],"along":[72],"axes,":[74],"characterizing":[78],"problem":[79],"traditional":[81],"SaP":[82],"methods":[83],"that":[84,122],"by":[85,98],"dimensional":[86],"reduction":[87],"essentially":[88],"are":[89],"one-dimensional":[90],"approaches.":[91],"Furthermore,":[92],"gains":[95],"additional":[96],"performance":[97],"use":[100],"succinct":[103],"data":[104],"structure,":[105],"allows":[107],"objects":[109],"be":[111],"represented":[112],"accessed":[114],"cache-friendly":[117],"way.":[118],"Experimental":[119],"results":[120],"confirm":[121],"maintains":[125],"attractive":[126],"query":[127],"times":[128],"simulations":[130],"with":[131],"hundreds":[132],"thousands":[134],"bodies,":[136],"stress-test":[139],"scenarios.":[140]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}