Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding
Sign Up to like & getrecommendations! Published in 2019 at "Numerical Functional Analysis and Optimization"
DOI: 10.1080/01630563.2019.1566927
Abstract: Abstract We present an efficient algorithm for finding the shortest path joining two points in a sequence of triangles in three-dimensional space using the concept of funnels associated with common edges along the sequence of… read more here.
Keywords: finding shortest; triangles planar; sequence triangles; shortest paths ... See more keywords
Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
Sign Up to like & getrecommendations! Published in 2018 at "Optimization"
DOI: 10.1080/02331934.2017.1387260
Abstract: Abstract We present an efficient algorithm for finding the shortest path joining two points in a sequence of triangles in three-dimensional space without planar unfolding. The concept of a funnel associated with a common edge… read more here.
Keywords: method orienting; finding shortest; orienting curves; shortest path ... See more keywords