{"id":"https://openalex.org/W2126453466","doi":"https://doi.org/10.1109/iros.2000.895202","title":"Fast convex minimization to detect collisions between polyhedra","display_name":"Fast convex minimization to detect collisions between polyhedra","publication_year":2002,"publication_date":"2002-11-08","ids":{"openalex":"https://openalex.org/W2126453466","doi":"https://doi.org/10.1109/iros.2000.895202","mag":"2126453466"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2000.895202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2000.895202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113)","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/A5051013397","display_name":"Claudio Mirolo","orcid":"https://orcid.org/0000-0002-1462-8304"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"C. Mirolo","raw_affiliation_strings":["Dip. di Matematica e lnformatica, University di Udine, Udine, Italy"],"affiliations":[{"raw_affiliation_string":"Dip. di Matematica e lnformatica, University di Udine, Udine, Italy","institution_ids":["https://openalex.org/I129043915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063926989","display_name":"Enrico Pagello","orcid":"https://orcid.org/0000-0002-8152-0707"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"E. Pagello","raw_affiliation_strings":["Dip. di Elettronica e Informatica, University di Padova and Ist. Ladseb C. N. R. di Padova, Padova, Italy"],"affiliations":[{"raw_affiliation_string":"Dip. di Elettronica e Informatica, University di Padova and Ist. Ladseb C. N. R. di Padova, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051013397"],"corresponding_institution_ids":["https://openalex.org/I129043915"],"apc_list":null,"apc_paid":null,"fwci":0.4651,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.64129124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"1605","last_page":"1610"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9991999864578247,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/polyhedron","display_name":"Polyhedron","score":0.8508269190788269},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.6163090467453003},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.5862610340118408},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5623544454574585},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5409600734710693},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4919695556163788},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4876948297023773},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4505305290222168},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.43601831793785095},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.42899876832962036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4099779427051544},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.3856489360332489},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36580485105514526},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.36487191915512085},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3273544907569885},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.17767319083213806}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8508269190788269},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.6163090467453003},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.5862610340118408},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5623544454574585},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5409600734710693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4919695556163788},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4876948297023773},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4505305290222168},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.43601831793785095},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.42899876832962036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4099779427051544},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3856489360332489},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36580485105514526},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.36487191915512085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3273544907569885},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.17767319083213806},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2000.895202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2000.895202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113)","raw_type":"proceedings-article"},{"id":"pmh:oai:air.uniud.it:11390/679615","is_oa":false,"landing_page_url":"http://hdl.handle.net/11390/679615","pdf_url":null,"source":{"id":"https://openalex.org/S4306401163","display_name":"Institutional Research Information System (University of Udine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129043915","host_organization_name":"University of Udine","host_organization_lineage":["https://openalex.org/I129043915"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W50977431","https://openalex.org/W1763430070","https://openalex.org/W1779023127","https://openalex.org/W1804610413","https://openalex.org/W1923168392","https://openalex.org/W1996036165","https://openalex.org/W2026762793","https://openalex.org/W2086914763","https://openalex.org/W2094539937","https://openalex.org/W2110350654","https://openalex.org/W2125006627","https://openalex.org/W2139062144","https://openalex.org/W2139839984","https://openalex.org/W2144505279","https://openalex.org/W2147438862","https://openalex.org/W2154782499","https://openalex.org/W2158405241","https://openalex.org/W2161269358","https://openalex.org/W2161514005","https://openalex.org/W2162866400","https://openalex.org/W2162954521","https://openalex.org/W2163228497","https://openalex.org/W2166316739","https://openalex.org/W3141422811","https://openalex.org/W6602108367","https://openalex.org/W6638003708","https://openalex.org/W6640015562","https://openalex.org/W6680373910"],"related_works":["https://openalex.org/W2383422787","https://openalex.org/W4248823117","https://openalex.org/W2334849780","https://openalex.org/W2004058166","https://openalex.org/W2030718493","https://openalex.org/W2018708907","https://openalex.org/W2103429114","https://openalex.org/W2005538657","https://openalex.org/W1584292662","https://openalex.org/W2088151573"],"abstract_inverted_index":{"The":[0],"subject":[1],"of":[2,12,25,41,46,53,99,110,124,127,156],"the":[3,23,26,54,84,90,96,102,111,122,128,131,136,139,148,152],"paper":[4],"is":[5,22,34,71,95,104,114,135],"a":[6,47,106,154],"fast":[7],"algorithm":[8],"for":[9,30,39,138],"detecting":[10],"collisions":[11],"two":[13,31],"convex":[14,32,49],"polyhedra":[15],"translating":[16],"in":[17,79,83,89,130,163],"space.":[18],"A":[19],"major":[20],"feature":[21],"novelty":[24],"approach:":[27],"collision":[28,37],"detection":[29,38],"bodies":[33],"reduced":[35],"to":[36,73,117],"pairs":[40],"planar":[42],"sections":[43],"and":[44,86,161],"minimization":[45],"bivariate":[48],"function;":[50],"furthermore,":[51],"most":[52],"subproblems":[55],"are":[56,159],"solved":[57],"using":[58],"two-dimensional":[59],"geometry.":[60],"As":[61],"proved":[62],"by":[63,142],"previous":[64],"theoretical":[65],"work,":[66],"on":[67,105,121],"this":[68],"basis":[69,123],"it":[70,134],"possible":[72],"design":[74],"an":[75],"algorithm,":[76,112],"which":[77,113],"runs":[78],"O(log/sup":[80,87],"2/n)":[81],"time":[82],"average":[85],"3/n)":[88],"worst":[91],"case,":[92],"where":[93],"n":[94],"total":[97],"number":[98],"vertices.":[100],"Here":[101],"focus":[103],"more":[107],"practical":[108],"version":[109],"particularly":[115],"suited":[116],"plan":[118],"collision-free":[119],"paths":[120],"fine-grain":[125],"descriptions":[126],"objects":[129],"workspace,":[132],"as":[133],"case":[137],"systems":[140],"supported":[141],"sophisticated":[143],"geometric":[144],"modelers.":[145],"After":[146],"explaining":[147],"main":[149],"ideas":[150],"underlying":[151],"approach,":[153],"set":[155],"experimental":[157],"results":[158],"presented":[160],"discussed":[162],"some":[164],"depth.":[165]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}