{"id":"https://openalex.org/W4385261075","doi":"https://doi.org/10.1145/3592136","title":"Shortest Path to Boundary for Self-Intersecting Meshes","display_name":"Shortest Path to Boundary for Self-Intersecting Meshes","publication_year":2023,"publication_date":"2023-07-26","ids":{"openalex":"https://openalex.org/W4385261075","doi":"https://doi.org/10.1145/3592136"},"language":"en","primary_location":{"id":"doi:10.1145/3592136","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3592136","pdf_url":null,"source":{"id":"https://openalex.org/S185367456","display_name":"ACM Transactions on Graphics","issn_l":"0730-0301","issn":["0730-0301","1557-7368"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Graphics","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/A5064471160","display_name":"Anka He Chen","orcid":"https://orcid.org/0000-0002-5819-3453"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"He Chen","raw_affiliation_strings":["Kahlert School of Computing, University of Utah, Salt Lake City, UT, United States of America"],"affiliations":[{"raw_affiliation_string":"Kahlert School of Computing, University of Utah, Salt Lake City, UT, United States of America","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007298266","display_name":"E. Arrieta D\u00edaz","orcid":"https://orcid.org/0009-0002-9493-1684"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elie Diaz","raw_affiliation_strings":["Kahlert School of Computing, University of Utah, Salt Lake City, UT, United States of America"],"affiliations":[{"raw_affiliation_string":"Kahlert School of Computing, University of Utah, Salt Lake City, UT, United States of America","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004638951","display_name":"Cem Yuksel","orcid":"https://orcid.org/0000-0002-0122-4159"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cem Yuksel","raw_affiliation_strings":["Kahlert School of Computing, University of Utah, Salt Lake City, UT, United States of America","Roblox, San Mateo, CA, United States of America","Kahlert School of Computing, University of Utah, Salt Lake City, UT, United States of America Roblox, San Mateo, CA, United States of America"],"affiliations":[{"raw_affiliation_string":"Kahlert School of Computing, University of Utah, Salt Lake City, UT, United States of America","institution_ids":["https://openalex.org/I223532165"]},{"raw_affiliation_string":"Roblox, San Mateo, CA, United States of America","institution_ids":[]},{"raw_affiliation_string":"Kahlert School of Computing, University of Utah, Salt Lake City, UT, United States of America Roblox, San Mateo, CA, United States of America","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064471160"],"corresponding_institution_ids":["https://openalex.org/I223532165"],"apc_list":null,"apc_paid":null,"fwci":5.4154,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.96565532,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"42","issue":"4","first_page":"1","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9979000091552734,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11799","display_name":"Adhesion, Friction, and Surface Interactions","score":0.9768999814987183,"subfield":{"id":"https://openalex.org/subfields/2211","display_name":"Mechanics of Materials"},"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/polygon-mesh","display_name":"Polygon mesh","score":0.7523195743560791},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7081418037414551},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6978551149368286},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.6071721315383911},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.5461408495903015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.52213054895401},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4907930791378021},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4489143490791321},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.43209171295166016},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.41697633266448975},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3439788818359375},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.283286452293396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24113932251930237},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2332654893398285},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.19224593043327332},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.1320614218711853},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09023129940032959},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07510438561439514}],"concepts":[{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.7523195743560791},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7081418037414551},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6978551149368286},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.6071721315383911},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.5461408495903015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.52213054895401},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4907930791378021},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4489143490791321},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.43209171295166016},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.41697633266448975},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3439788818359375},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.283286452293396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24113932251930237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2332654893398285},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.19224593043327332},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.1320614218711853},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09023129940032959},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07510438561439514},{"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/3592136","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3592136","pdf_url":null,"source":{"id":"https://openalex.org/S185367456","display_name":"ACM Transactions on Graphics","issn_l":"0730-0301","issn":["0730-0301","1557-7368"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Graphics","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":45,"referenced_works":["https://openalex.org/W1566989922","https://openalex.org/W1986737903","https://openalex.org/W1989871863","https://openalex.org/W1999447019","https://openalex.org/W2021587133","https://openalex.org/W2024243735","https://openalex.org/W2044413732","https://openalex.org/W2048637195","https://openalex.org/W2048955023","https://openalex.org/W2065283065","https://openalex.org/W2071005771","https://openalex.org/W2074537686","https://openalex.org/W2082211440","https://openalex.org/W2084126027","https://openalex.org/W2103262115","https://openalex.org/W2108567935","https://openalex.org/W2118625698","https://openalex.org/W2132836675","https://openalex.org/W2138722056","https://openalex.org/W2148360093","https://openalex.org/W2150193232","https://openalex.org/W2152776872","https://openalex.org/W2159622977","https://openalex.org/W2163637712","https://openalex.org/W2166197075","https://openalex.org/W2234650683","https://openalex.org/W2530006557","https://openalex.org/W2593556077","https://openalex.org/W2739235713","https://openalex.org/W2903365351","https://openalex.org/W2910139901","https://openalex.org/W2920946798","https://openalex.org/W3035776964","https://openalex.org/W3048889784","https://openalex.org/W3089354495","https://openalex.org/W3184236041","https://openalex.org/W3202938794","https://openalex.org/W3211982974","https://openalex.org/W3214816887","https://openalex.org/W4235375376","https://openalex.org/W4236440330","https://openalex.org/W4248724333","https://openalex.org/W4254440941","https://openalex.org/W4286611167","https://openalex.org/W4286611172"],"related_works":["https://openalex.org/W2383278621","https://openalex.org/W2337996606","https://openalex.org/W1973167937","https://openalex.org/W3206897836","https://openalex.org/W2685059401","https://openalex.org/W1970871823","https://openalex.org/W2391412785","https://openalex.org/W2063723151","https://openalex.org/W2033496159","https://openalex.org/W4385261075"],"abstract_inverted_index":{"We":[0,27],"introduce":[1],"a":[2,15,18,29,41,86,102],"method":[3,53,95],"for":[4,36,44,58],"efficiently":[5],"computing":[6,45],"the":[7,12,23,46],"exact":[8],"shortest":[9,33,48],"path":[10],"to":[11],"boundary":[13,34,49],"of":[14,25,32,89],"mesh":[16],"from":[17],"given":[19],"internal":[20],"point":[21],"in":[22],"presence":[24],"self-intersections.":[26],"provide":[28,73],"formal":[30],"definition":[31],"paths":[35],"self-intersecting":[37],"objects":[38],"and":[39,60],"present":[40],"robust":[42],"algorithm":[43],"actual":[47],"path.":[50],"The":[51],"resulting":[52],"offers":[54],"an":[55],"effective":[56],"solution":[57],"collision":[59,77],"self-collision":[61,83],"handling":[62],"while":[63],"simulating":[64],"deformable":[65],"volumetric":[66],"objects,":[67],"using":[68],"fast":[69],"simulation":[70],"techniques":[71],"that":[72,93],"no":[74],"guarantees":[75],"on":[76],"resolution.":[78],"Our":[79],"evaluation":[80],"includes":[81],"complex":[82],"scenarios":[84],"with":[85],"large":[87],"number":[88],"active":[90],"contacts,":[91],"showing":[92],"our":[94],"can":[96],"successfully":[97],"handle":[98],"them":[99],"by":[100],"introducing":[101],"relatively":[103],"minor":[104],"computational":[105],"overhead.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}