{"id":"https://openalex.org/W2164593186","doi":"https://doi.org/10.1109/iccta.2007.113","title":"Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems","display_name":"Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems","publication_year":2007,"publication_date":"2007-03-01","ids":{"openalex":"https://openalex.org/W2164593186","doi":"https://doi.org/10.1109/iccta.2007.113","mag":"2164593186"},"language":"en","primary_location":{"id":"doi:10.1109/iccta.2007.113","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccta.2007.113","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5049264790","display_name":"Fajie Li","orcid":null},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Fajie Li","raw_affiliation_strings":["Computer Science Department, University of Auckland, Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087111199","display_name":"Reinhard Klette","orcid":"https://orcid.org/0000-0001-8818-7145"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Reinhard Klette","raw_affiliation_strings":["Computer Science Department, University of Auckland, Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154130895"],"apc_list":null,"apc_paid":null,"fwci":2.3525,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.88116748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"19"},"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.9997000098228455,"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.9997000098228455,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9973999857902527,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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.7002049684524536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6951438188552856},{"id":"https://openalex.org/keywords/cube","display_name":"Cube (algebra)","score":0.6726925373077393},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6077359318733215},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.594419538974762},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5939924716949463},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5773638486862183},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.5272732377052307},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5194610953330994},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.494594544172287},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4925592541694641},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4610542356967926},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.4495731592178345},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42723825573921204},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.34756264090538025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3320053219795227},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19792956113815308},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18692967295646667},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12899908423423767},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09041464328765869}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7002049684524536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6951438188552856},{"id":"https://openalex.org/C53051483","wikidata":"https://www.wikidata.org/wiki/Q861555","display_name":"Cube (algebra)","level":2,"score":0.6726925373077393},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6077359318733215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.594419538974762},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5939924716949463},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5773638486862183},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.5272732377052307},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5194610953330994},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.494594544172287},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4925592541694641},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4610542356967926},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.4495731592178345},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42723825573921204},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.34756264090538025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3320053219795227},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19792956113815308},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18692967295646667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12899908423423767},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09041464328765869},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccta.2007.113","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccta.2007.113","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1559701472","https://openalex.org/W1585431169","https://openalex.org/W1974433908","https://openalex.org/W1976321729","https://openalex.org/W2002039836","https://openalex.org/W2018347014","https://openalex.org/W2024496499","https://openalex.org/W2043003284","https://openalex.org/W2046419297","https://openalex.org/W2086698318","https://openalex.org/W2097305807","https://openalex.org/W2125334953","https://openalex.org/W2132457975","https://openalex.org/W2146617971","https://openalex.org/W2170220350","https://openalex.org/W2273522701","https://openalex.org/W2413132853","https://openalex.org/W4213368447","https://openalex.org/W4285719527","https://openalex.org/W6651105054","https://openalex.org/W6715597038"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2112429204","https://openalex.org/W2347245430","https://openalex.org/W2365712669","https://openalex.org/W2167427782","https://openalex.org/W2562562750","https://openalex.org/W2156431668","https://openalex.org/W2009987517","https://openalex.org/W2377950158","https://openalex.org/W2135265145"],"abstract_inverted_index":{"This":[0],"reviewing":[1],"paper":[2,35,117],"provides":[3],"a":[4,46,86,92,99,105,109],"complete":[5],"discussion":[6],"of":[7,25,61,65,85,91,98,104,113,128],"an":[8],"algorithm":[9,40,52,67],"(called":[10],"rubberband":[11,114],"algorithm),":[12],"which":[13,53],"was":[14,41],"proposed":[15],"by":[16],"Billow":[17],"and":[18,50,141,143],"Klette":[19],"in":[20,29,31],"2000-2002":[21],"for":[22,58,131],"the":[23,55,82,96,135,144],"calculation":[24],"minimum-length":[26],"polygonal":[27],"curves":[28],"cube-curves":[30,60],"3D":[32],"space.":[33],"The":[34,116],"describes":[36],"how":[37,120],"this":[38,66],"original":[39],"transformed":[42],"afterwards,":[43],"\"step-by-step\",":[44],"into":[45],"general,":[47],"provably":[48],"correct,":[49],"time-efficient":[51],"solves":[54],"indented":[56],"task":[57],"simple":[59,87,93],"any":[62],"complexity.":[63],"Variations":[64],"are":[68],"then":[69],"used":[70],"to":[71],"solve":[72],"various":[73,124],"Euclidean":[74],"shortest":[75],"path":[76],"(ESP)":[77],"problems,":[78],"such":[79,121,133],"as":[80,134],"calculating":[81],"ESP":[83],"inside":[84,90,103],"cube":[88],"arc,":[89],"polygon,":[94],"on":[95],"surface":[97],"convex":[100],"polytope,":[101],"or":[102],"simply-connected":[106],"polyhedron,":[107],"demonstrating":[108],"general":[110],"(!)":[111],"methodology":[112],"algorithms.":[115],"also":[118],"reports":[119],"algorithms":[122,130],"improve":[123],"time":[125],"complexity":[126],"results":[127],"best":[129],"problems":[132],"touring":[136],"polygons,":[137],"parts":[138],"cutting,":[139],"safari":[140],"zookeeper,":[142],"watchman":[145],"route":[146]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}