ACM Home Page
Please provide us with feedback. Feedback
Algorithmic issues in modeling motion
Full text PdfPdf (205 KB)
Source ACM Computing Surveys (CSUR) archive
Volume 34 ,  Issue 4  (December 2002) table of contents
Pages: 550 - 572  
Year of Publication: 2002
ISSN:0360-0300
Authors
Pankaj K. Agarwal  Duke University
Leonidas J. Guibas  Stanford University
Herbert Edelsbrunner  Duke University
Jeff Erickson  University of Illinois, Urbana-Champaign
Michael Isard  Compaq Research Labs
Sariel Har-Peled  University of Illinois, Urbana-Champaign
John Hershberger  Mentor Graphics
Christian Jensen  University of Aalborg
Lydia Kavraki  Rice University
Patrice Koehl  Stanford University
Ming Lin  University of North Carolina, Chapel Hill
Dinesh Manocha  University of North Carolina, Chapel Hill
Dimitris Metaxas  University of Pennsylvania
Brian Mirtich  MERL
David Mount  University of Maryland
S. Muthukrishnan  AT&T
Dinesh Pai  University of British Columbia
Elisha Sacks  Purdue University
Jack Snoeyink  University of North Carolina, Chapel Hill
Subhash Suri  University of California, Santa Barbara
Ouri Wolefson  University of Chicago
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 39,   Downloads (12 Months): 269,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/592642.592647
What is a DOI?

ABSTRACT

This article is a survey of research areas in which motion plays a pivotal role. The aim of the article is to review current approaches to modeling motion together with related data structures and algorithms, and to summarize the challenges that lie ahead in producing a more unified theory of motion representation that would be useful across several disciplines.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Agarwal, P. K., Basch, J., Guibas, L. J., Hershberger, J., and Zhang, L. 2000. Deformable free space tiling for kinetic collision detection. In Proc. 4th Workshop Algorithmic Found. Robot., to appear.
 
3
Agarwal, P. K. and Erickson, J. 1999. Geometric range searching and its relatives. In Advances in Discrete and Computational Geometry, B. Chazelle, J. E. Goodman, and R. Pollack, eds. Contemporary Mathematics, vol. 223. American Mathematical Society, R.I., pp. 1--56.
 
4
 
5
 
6
Agarwal, P. K. and Procopiuc, C. M. 2002. Advances in indexing mobile objects. IEEE Bull. Data Eng. 25, 25--34.
 
7
Agarwal, P. K. and Sharir, M. 2000. Arrangements and their applications. In Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, Eds. Elsevier Science Publishers B.V. North-Holland, Amsterdam, The Netherlands, pp. 49--119.
 
8
Alm, E. and Baker, D. 1999. Prediction of protein-folding mechanisms from free-energy landscapes derived from native structures. Proc. Nat. Acad. Sci. USA, 96, 11305--11310.
 
9
Amadei, A., Linssen, B. M., and Berendsen, H. J. C. 1993. Essential dynamics of protein. Proteins: Structure, Function, and Genetics 17, 412--425.
10
11
 
12
Apaydin, M., Singh, A., Brutlag, D., and Latombe, J. 2001. Capturing molecular energy landscapes with probabilistic conformational roadmaps. In Proceedings of the IEEE Conference on Robotics and Automation.
 
13
Arulampalam, S., Maskell, S., Gordon, N., and Clapp, T. 2002. A tutorial on particle filters for on-line non-linear/non-gaussian bayesian tracking. IEEE Trans. Sig. Proc. 50, 174--188.
 
14
Atallah, M. J. 1985. Some dynamic computational geometry problems. Comput. Math. Appl. 11, 1171--1181.
15
16
 
17
 
18
 
19
Bern, M. and Plassmann, P. 2000. Mesh generation. In Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, Eds. Elsevier Science Publishers, B. V. North-Holland, Amsterdam, The Netherlands, 291--332.
 
20
 
21
 
22
 
23
Bonnet, P., Gehrke, J. E., and Seshadri, P. 2000. Querying the physical world. IEEE Pers. Commun. 7, 10--15.
 
24
25
26
 
27
Brown, J., Sorkin, S., Bruyns, C., Latombe, J.-C., Montgomery, K., and Stephanides, M. 2001. Real-time simulation of deformable objects: Tools and application. Proc. Comput. Animat.
 
28
Bryant, R., Edelsbrunner, H., Koehl, P., and Levitt, M. 2000. Inclusion-exclusion formulas for the area derivative of a space-filling diagram. manuscript.
 
29
 
30
Cheng, H.-L., Dey, T. K., Edelsbrunner, H., and Sullivan, J. 2001. Dynamic skin triangulation. Disc. Comput. Geom. 25, 525--568.
 
31
 
32
Cockburn, B., Karniadakis, G., and Shu, C. W. 2000. Discontinuous Galerkin Methods: Theory, Computation and Applications. Springer-Verlag, New York.
33
 
34
 
35
Dill, K. A., Bromberg, S., Yue, K. Z., and Fiebig, K. M. 1995. Principles of protein folding. a perspective from simple exact models. Protein Sci. 4, 561--602.
 
36
 
37
Erickson, J., Guoy, D., Sullivan, J. M., and Üngör, A. 2002. Building space-time meshies over arbitrary spatial domains. In Proceedings of the 11th International Meshing Roundtable, 391--402.
 
38
Gao, J., Guibas, L., Hershberger, J., Zhang, L., and Zhu, A. 2001. Discrete mobile centers. Manuscript.
39
 
40
 
41
 
42
43
44
45
 
46
Kavraki, L. E., Ŝvestka, P., Latombe, J.-C., and Overmars, M. H. 1996. Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Trans. Robot. Autom. 12, 566--580.
47
48
49
50
 
51
Lamiraux, F. and Kavraki, L. 2001. Planning paths for elastic objects under manipulation constraints. Int. J. Roboti. Res. 20, 188--208.
 
52
Lang, J., Pai, D. K., and Woodham, R. J. 2002. Robotic acquisition of deformable models. In Proceedings of the IEEE International Conference on Robotics and Automation. pp. 933--938.
 
53
Larson, E., Gottschalk, S., Lin, M., and Manocha, D. 2000. Fast distance queries using rectangular swept sphere volume. In Proceedings of the IEEE International Conference on Robotics and Automation, 3719--3726.
 
54
 
55
 
56
Leach, A. R. 1996. Molecular Modeling: Principles and Applications. Addison-Welsley Longman, Rssex, England.
 
57
Levitt, M., Gerstein, M., Huang, E., Subbiah, S., and Tsai, J. 1997. Protein folding: The endgame. Ann. Rev. Biochem. 66, 549--579.
 
58
Lin, M. and Gottschalk, S. 1998. Collision detection between geometric models: A survey. In Proceedings of the IMA Conference on Mathematics of Surfaces.
 
59
 
60
Longuet-Higgins, H. C. 1981. A computer algorithm for reconstructing a scene from two projections. Nature 293, 133--135.
 
61
Lotstedt, P. 1981. Coulomb friction in two-dimensional rigid body systems. ZAMM 61, 605--613.
 
62
Lowrie, R. B., Roe, P. L., and van Leer, B. 1998. Space-time methods for hyperbolic conservation laws. In Barriers and Challenges in Computational Fluid Dynamics. ICASE/LaRC Interdisciplinary Series in Science and Engineering, vol. 6. Kluwer, pp. 79--98.
 
63
64
 
65
Meyer, M., Debunne, G., Desbrun, M., and Barr, A. H. 2001. Interactive animation of cloth-like objects in virtual reality. J. Vis. Comput. Animat. 12, 1--12.
 
66
67
 
68
 
69
Onuchic, J. N., Luthey-Schulten, Z., and Wolynes, P. G. 1997. Theory of protein folding: The energy landscape perspective. Ann. Rev. Phys. Chem. 48, 545--600.
70
 
71
 
72
Richmond, J. L. and Pai, D. K. 2000. Active measurement and modeling of contact sounds. In Proceedings of the IEEE International Conference on Robotics and Automation. pp. 2146--2152.
 
73
 
74
Royer, E. and Toh, C. 1999. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Pers. Commun. 6, 46--55.
75
 
76
Schirra, S. 2000. Robustness and precision issues in geometric computation. In Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, Eds. Elsevier Science Publishers, B. V. North-Holland, Amsterdam, The Netherlands, pp. 597--632.
77
 
78
 
79
Song, G. and Amato, N. M. 2002. Using motion planning to study protein folding pathways. J. Comput. Biol. 9, 149--168.
 
80
Sorenson, H. 1985. Kalman Filtering: Theory and Applications. IEEE Press.
 
81
Tayeb, J., Ulusoy, O., and Wolfson, O. 1998. A quadtree-based dynamic attribute indexing method. Comput. J., 185--200.
 
82
Teodoro, M., Phillips, G., and Kavraki, L. 2000. Singular value decomposition of protein conformational motions: Application to HIV-1 protease. In Currents in Computational Molecular Biology. Universal Academy Press Inc., Tokyo, Japan, pp. 198--199.
 
83
 
84
Üngör, A. and Sheffer, A. 2002. Pitching tents in space-time: Mesh generation for discontinuous Galerkin method. Int. J. Found. Comput. Sci. 13, 201--222.
 
85
Üngör, A., Sheffer, A., Haber, R. B., and Teng, S.-H. 2002. Layer based solutions for constrained space-time meshing. Appl. Numer. Math., to appear.
86
 
87
Vogler, C. and Metaxas, D. 2000. A linguistics-based approach to american sign language recognition. In Proceedings of the International Conference on Gestures: Meaning and Use.
 
88
 
89
90
 
91
Yin., L., Acharya., A., Sobh, N., Haber, R. B., and Tortorelli, D. A. 2000. A space-time discontinuous Galerkin method for elastodynamic analysis. In Discontinuous Galerkin Methods: Theory, Computation and Applications, B. Cockburn, G. Karniadakis, and C. Shu, Eds. Lecture Notes in Computational Science and Engineering, vol. 11. Springer-Verlag, New York, pp. 459--464.
 
92


Collaborative Colleagues:
Pankaj K. Agarwal: colleagues
Leonidas J. Guibas: colleagues
Herbert Edelsbrunner: colleagues
Jeff Erickson: colleagues
Michael Isard: colleagues
Sariel Har-Peled: colleagues
John Hershberger: colleagues
Christian Jensen: colleagues
Lydia Kavraki: colleagues
Patrice Koehl: colleagues
Ming Lin: colleagues
Dinesh Manocha: colleagues
Dimitris Metaxas: colleagues
Brian Mirtich: colleagues
David Mount: colleagues
S. Muthukrishnan: colleagues
Dinesh Pai: colleagues
Elisha Sacks: colleagues
Jack Snoeyink: colleagues
Subhash Suri: colleagues
Ouri Wolefson: colleagues