{"id":"https://openalex.org/W2098251197","doi":"https://doi.org/10.1109/robot.2002.1013463","title":"Implicit convex-hull distance of finite-screw-swept volumes","display_name":"Implicit convex-hull distance of finite-screw-swept volumes","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2098251197","doi":"https://doi.org/10.1109/robot.2002.1013463","mag":"2098251197"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2002.1013463","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2002.1013463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)","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/A5109890051","display_name":"Patrick Xavier","orcid":null},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]},{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"P.G. Xavier","raw_affiliation_strings":["Intelligent Systems Principles, Sandia National Laboratories, Albuquerque, NM, USA","Intelligent Syst. Principles, Sandia Nat. Labs., Albuquerque, NM, USA"],"affiliations":[{"raw_affiliation_string":"Intelligent Systems Principles, Sandia National Laboratories, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I4210104735"]},{"raw_affiliation_string":"Intelligent Syst. Principles, Sandia Nat. Labs., Albuquerque, NM, USA","institution_ids":["https://openalex.org/I192454743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109890051"],"corresponding_institution_ids":["https://openalex.org/I192454743","https://openalex.org/I4210104735"],"apc_list":null,"apc_paid":null,"fwci":0.5338,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.68021214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"847","last_page":"854"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9988999962806702,"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.9979000091552734,"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.8104057908058167},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7593542337417603},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.7288868427276611},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.6478484869003296},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5370155572891235},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5340261459350586},{"id":"https://openalex.org/keywords/interference","display_name":"Interference (communication)","score":0.5052517056465149},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.49760034680366516},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4443328380584717},{"id":"https://openalex.org/keywords/finite-volume-method","display_name":"Finite volume method","score":0.4337017834186554},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.4286806285381317},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4105187952518463},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.3732125759124756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36398792266845703},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.3409213423728943},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.32140928506851196},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27489718794822693},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.2028489112854004},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.18956971168518066},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.15700095891952515},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15367835760116577},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.0944254994392395}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8104057908058167},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7593542337417603},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.7288868427276611},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.6478484869003296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5370155572891235},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5340261459350586},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.5052517056465149},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.49760034680366516},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4443328380584717},{"id":"https://openalex.org/C50478463","wikidata":"https://www.wikidata.org/wiki/Q1401936","display_name":"Finite volume method","level":2,"score":0.4337017834186554},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.4286806285381317},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4105187952518463},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.3732125759124756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36398792266845703},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.3409213423728943},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.32140928506851196},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27489718794822693},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2028489112854004},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.18956971168518066},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.15700095891952515},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15367835760116577},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0944254994392395},{"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/C57879066","wikidata":"https://www.wikidata.org/wiki/Q41217","display_name":"Mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robot.2002.1013463","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2002.1013463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W50977431","https://openalex.org/W1560606789","https://openalex.org/W1594366634","https://openalex.org/W1916827705","https://openalex.org/W1966634937","https://openalex.org/W1999250663","https://openalex.org/W1999447019","https://openalex.org/W2002665784","https://openalex.org/W2045471590","https://openalex.org/W2065283065","https://openalex.org/W2067089692","https://openalex.org/W2089835609","https://openalex.org/W2094539937","https://openalex.org/W2109267424","https://openalex.org/W2113525359","https://openalex.org/W2122796818","https://openalex.org/W2126539456","https://openalex.org/W2139062144","https://openalex.org/W2154782499","https://openalex.org/W2156565283","https://openalex.org/W2162866400","https://openalex.org/W2163228497","https://openalex.org/W2163998405","https://openalex.org/W2166316739","https://openalex.org/W2168117509","https://openalex.org/W2169556977","https://openalex.org/W2610489397","https://openalex.org/W3028243704","https://openalex.org/W4385490503","https://openalex.org/W6602108367","https://openalex.org/W6633408264","https://openalex.org/W6635482708","https://openalex.org/W6685028319","https://openalex.org/W6855232588"],"related_works":["https://openalex.org/W1650636191","https://openalex.org/W2383422787","https://openalex.org/W2088590145","https://openalex.org/W2098081711","https://openalex.org/W4248823117","https://openalex.org/W2030718493","https://openalex.org/W2056091804","https://openalex.org/W2348314797","https://openalex.org/W2103429114","https://openalex.org/W2469464399"],"abstract_inverted_index":{"The":[0],"need":[1],"for":[2,26,38,47,53],"collision":[3,13,100],"detection":[4,28,46,77],"arises":[5],"in":[6],"several":[7],"robotics":[8],"areas,":[9],"including":[10],"motion-planning,":[11],"online":[12],"avoidance,":[14],"and":[15,44,50,66,75,99,106],"simulation.":[16],"At":[17],"the":[18,63,79,83,110,125],"heart":[19],"of":[20,82],"most":[21],"current":[22],"methods":[23],"are":[24,103],"algorithms":[25,68],"interference":[27,45,76],"and/or":[29],"distance":[30,42,73,98],"computation.":[31],"We":[32],"presented":[33],"(1997)":[34],"an":[35],"implemented":[36],"technique":[37],"doing":[39],"exact":[40,71],"numerical":[41,72],"computation":[43,74],"translationally-swept":[48],"bodies":[49,54],"approximate":[51],"techniques":[52],"swept":[55,85],"under":[56,90],"finite":[57,91],"screw":[58,92],"motion.":[59],"Here,":[60],"we":[61],"extend":[62,124],"enhanced":[64],"GJK":[65],"Gilbert-Foo,":[67],"to":[69,123,127],"obtain":[70],"between":[78],"convex":[80,88],"hulls":[81],"volumes":[84],"by":[86],"two":[87],"polyhedra":[89],"motions.":[93],"This":[94],"algorithm":[95],"enables":[96],"conservative":[97],"computations":[101],"that":[102],"both":[104],"tighter":[105],"more":[107],"efficient":[108],"than":[109],"previous":[111],"result.":[112],"It":[113],"has":[114],"been":[115],"integrated":[116],"into":[117],"a":[118],"bounding-volume":[119],"hierarchy":[120],"distance/interference":[121],"code":[122],"result":[126],"facetted":[128],"non-convex":[129],"rigid":[130],"bodies.":[131]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
