On Approximate Geodesic-Distance Queries amid Deforming Point Clouds

by Pankaj K. Agarwal , Alon Efrat , R. Sharathkumar , Hai Yu

User correction supplied by mph

Datum	Value	Source
TITLE	On Approximate Geodesic-Distance Queries amid Deforming Point Clouds	user correction
AUTHOR NAME	Pankaj K. Agarwal	user correction
AUTHOR AFFIL	Department of Computer Science, Duke University.	user correction
AUTHOR NAME	Alon Efrat	user correction
AUTHOR AFFIL	Department of Computer Science, The University of Arizona.	user correction
AUTHOR NAME	R. Sharathkumar	user correction
AUTHOR AFFIL	Department of Computer Science, Duke University.	user correction
AUTHOR NAME	Hai Yu	user correction
AUTHOR AFFIL	Google Inc	user correction
AUTHOR ADDR	New York, NY.	user correction
ABSTRACT	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.	user correction
CITATIONS	18 found	ParsCit 1.0