loading...
Algorithms for Generating Motion Trajectories Described by Prepositions
Philadelphia, Pennsylvania May 03-May 05
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CA.2000.889029Computer Animation 2000 (CA'00)
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yilun Dianna Xu, University of Pennsylvania
Norman I. Badler, University of Pennsylvania
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 neighbor, and next-to. All algorithms are defined by or derived from standard computational geometry concepts.
Citation:
Yilun Dianna Xu, Norman I. Badler, "Algorithms for Generating Motion Trajectories Described by Prepositions," ca, pp.30, Computer Animation 2000 (CA'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.