TY - GEN
T1 - On approximate geodesic-distance queries amid deforming point clouds
AU - Agarwal, Pankaj K.
AU - Efrat, Alon
AU - Sharathkumar, R.
AU - Yu, Hai
PY - 2010/3/29
Y1 - 2010/3/29
N2 - We propose data structures for answering a geodesic-distance query between two query points in a two-dimensional or three-dimensional dynamic environment, in which obstacles are deforming continuously. Each obstacle in the environment is modeled as the convex hull of a continuously deforming point cloud. The key to our approach is to avoid maintaining the convex hull of each point cloud explicitly but still able to retain sufficient geometric information to estimate geodesic distances in the free space.
AB - We propose data structures for answering a geodesic-distance query between two query points in a two-dimensional or three-dimensional dynamic environment, in which obstacles are deforming continuously. Each obstacle in the environment is modeled as the convex hull of a continuously deforming point cloud. The key to our approach is to avoid maintaining the convex hull of each point cloud explicitly but still able to retain sufficient geometric information to estimate geodesic distances in the free space.
UR - http://www.scopus.com/inward/record.url?scp=77949799210&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77949799210&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-00312-7_22
DO - 10.1007/978-3-642-00312-7_22
M3 - Conference contribution
AN - SCOPUS:77949799210
SN - 9783642003110
T3 - Springer Tracts in Advanced Robotics
SP - 351
EP - 365
BT - Algorithmic Foundations of Robotics VIII - Selected Contributions of the Eighth International Workshop on the Algorithmic Foundations of Robotics
T2 - 8th International Workshop on the Algorithmic Foundations of Robotics, WAFR
Y2 - 7 December 2008 through 9 December 2008
ER -