Sciweavers

CA
2000
IEEE

Algorithms for Generating Motion Trajectories Described by Prepositions

13 years 8 months ago
Algorithms for Generating Motion Trajectories Described by Prepositions
A list of representative directional prepositions of the English language is investigated to develop computation models that output some general motion trajectory or goal direction, given instructions involving prepositional phrases. Computation models are implemented through geometric definitions and procedures such as: centroid, quasi-centroid, convex-hull, closest, nearest-neighbour, and next-to. All algorithms are defined by or derived from standard computational geometry concepts.
Yilun Dianna Xu, Norman I. Badler
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2000
Where CA
Authors Yilun Dianna Xu, Norman I. Badler
Comments (0)