Marcelo Kallmann
Supplemental Material
- Amato, N. M., Goodrich, M. T., and Ramos, E. A. 2000. Linear-time triangulation of a simple polygon made easier via randomization. In In Proceedings of the 16th Annual ACM Symposium of Computational Geometry, 201--212. Google Scholar
Digital Library
- Arikan, O., and Forsyth, D. A. 2002. Synthesizing constrained motions from examples. Proceedings of SIGGRAPH 21, 3, 483--490. Google ScholarDigital Library
- Bhattacharya, P., and Gavrilova, M. 2008. Roadmap-based path planning - using the voronoi diagram for a clearance-based shortest path. Robotics Automation Magazine, IEEE 15, 2 (june), 58--66.Google ScholarCross Ref
- Chazelle, B. 1982. A theorem on polygon cutting with applications. In SFCS '82: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 339--349. Google ScholarDigital Library
- Chazelle, B. 1991. Triangulating a simple polygon in linear time. Discrete Computational Geometry 6, 5 (Aug.), 485--524. Google ScholarDigital Library
- Chew, L. P. 1985. Planning the shortest path for a disc in o(n2logn) time. In Proceedings of the ACM Symposium on Computational Geometry. Google ScholarDigital Library
- De Berg, M., Cheong, O., and van Kreveld, M. 2008. Computational geometry: algorithms and applications. Springer. Google ScholarDigital Library
- Demyen, D., and Buro, M. 2006. Efficient triangulation-based pathfinding. In AAAI'06: Proceedings of the 21st national conference on Artificial intelligence, AAAI Press, 942--947. Google ScholarDigital Library
- Devillers, O., and Pion, S. 2003. Efficient exact geometric predicates for delaunay triangulations. In Proceedings of the 5th Workshop Algorithm Engineering and Experiments, 37--44.Google Scholar
- Garcia, F., Kapadia, M., and Badler, N. I. 2014. Gpu-based dynamic search on adaptive resolution grids. In Proceedings of the IEEE International Conference on Robtics and Automation, IEEE, ICRA.Google Scholar
- Geraerts, R. 2010. Planning short paths with clearance using explicit corridors. In ICRA'10: Proceedings of the IEEE International Conference on Robotics and Automation.Google ScholarCross Ref
- Gochev, K., Cohen, B. J., Butzke, J., Safonova, A., and Likhachev, M. 2011. Path planning with adaptive dimensionality. In SOCS.Google Scholar
- Hart, P., Nilsson, N., and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics, IEEE Transactions on 4, 2, 100--107.Google Scholar
- Hershberger, J., and Snoeyink, J. 1994. Computing minimum length paths of a given homotopy class. Computational Geometry Theory and Application 4, 2, 63--97. Google ScholarDigital Library
- Hershberger, J., and Suri, S. 1997. An optimal algorithm for euclidean shortest paths in the plane. SIAM Journal on Computing 28, 2215--2256. Google ScholarDigital Library
- Hjelle, O., and Dæhlen, M. 2006. Triangulations and Applications (Mathematics and Visualization). Springer-Verlag New York, Inc., Secaucus, NJ, USA. Google ScholarDigital Library
- Hoff III, K. E., Culver, T., Keyser, J., Lin, M., and Manocha, D. 2000. Fast computation of generalized voronoi diagrams using graphics hardware. In ACM Symposium on Computational Geometry. Google ScholarDigital Library
- Huang, T., Kapadia, M., Badler, N. I., and Kallmann, M. 2014. Path planning for coherent and persistent groups. In Proceedings of the IEEE International Conference on Robtics and Automation, IEEE, ICRA '14.Google Scholar
- Jorgensen, C.-J., and Lamarche, F. 2011. From geometry to spatial reasoning: automatic structuring of 3d virtual environments. In Proceedings of the 4th international conference on Motion in Games (MIG), Springer-Verlag, Berlin, Heidelberg, 353--364. Google ScholarDigital Library
- Kallmann, M. 2010. Navigation queries from triangular meshes. In The Third International Conference on Motion in Games (MIG). Google ScholarDigital Library
- Kallmann, M. 2010. Shortest paths with arbitrary clearance from navigation meshes. In Proceedings of the Eurographics / SIGGRAPH Symposium on Computer Animation (SCA). Google ScholarDigital Library
- Kallmann, M. 2014. Dynamic and robust local clearance triangulations. ACM Transactions on Graphics 33, 5.Google ScholarDigital Library
- Kapadia, M., and Badler, N. I. 2013. Navigation and steering for autonomous virtual humans. Wiley Interdisciplinary Reviews: Cognitive Science.Google Scholar
- Kapadia, M., Singh, S., Hewlett, W., and Faloutsos, P. 2009. Egocentric affordance fields in pedestrian steering. In Proceedings of the 2009 symposium on Interactive 3D graphics and games, ACM, New York, NY, USA, I3D '09, 215--223. Google ScholarDigital Library
- Kapadia, M., Singh, S., Reinman, G., and Faloutsos, P. 2011. A behavior-authoring framework for multiactor simulations. Computer Graphics and Applications, IEEE 31, 6 (nov.-dec.), 45--55. Google ScholarDigital Library
- Kapadia, M., Singh, S., Hewlett, W., Reinman, G., and Faloutsos, P. 2012. Parallelized egocentric fields for autonomous navigation. The Visual Computer 28, 12, 1209--1227.Google ScholarCross Ref
- Kapadia, M., Beacco, A., Garcia, F., Reddy, V., Pelechano, N., and Badler, N. I. 2013. Multi-domain real-time planning in dynamic environments. In Proceedings of the 12th ACM SIGGRAPH/Eurographics Symposium on Computer Animation, ACM, New York, NY, USA, SCA '13, 115--124. Google ScholarDigital Library
- Kapadia, M., Ninomiya, K., Shoulson, A., Garcia, F., and Badler, N. 2013. Constraint-aware navigation in dynamic environments. In Proceedings of Motion on Games, ACM, New York, NY, USA, MIG '13, 89:111--89:120. Google ScholarDigital Library
- Kapadia, M., Marshak, N., and Badler, N. I. 2014. ADAPT: The agent development and prototyping testbed. IEEE Transactions on Visualization and Computer Graphics 99, 1.Google Scholar
- Koenig, S., and Likhachev, M. 2002. D* Lite. In National Conf. on AI, AAAI, 476--483. Google ScholarDigital Library
- Kovar, L., Gleicher, M., and Pighin, F. H. 2002. Motion graphs. Proceedings of SIGGRAPH 21, 3, 473--482. Google ScholarDigital Library
- Lamarche, F., and Donikian, S. 2004. Crowd of virtual humans: a new approach for real time navigation in complex and structured environments. Computer Graphics Forum 23, 3, 509--518.Google ScholarCross Ref
- Lamarche, F. 2009. Topoplan: a topological path planner for real time human navigation under floor and ceiling constraints. Computer Graphics Forum 28, 2, 649--658.Google ScholarCross Ref
- Lee, D. T., and Preparata, F. P. 1984. Euclidean shortest paths in the presence of rectilinear barriers. Networks 3, 14, 393--410.Google ScholarCross Ref
- Likhachev, M., Gordon, G. J., and Thrun, S. 2003. ARA*: Anytime A* with Provable Bounds on Sub-Optimality. In NIPS.Google Scholar
- Likhachev, M., Ferguson, D. I., Gordon, G. J., Stentz, A., and Thrun, S. 2005. Anytime Dynamic A*: An Anytime, Replanning Algorithm. In ICAPS, 262--271.Google Scholar
- Liu, Y. H., and Arimoto, S. 1995. Finding the shortest path of a disk among polygonal obstacles using a radius-independent graph. IEEE Transactions on Robotics and Automation 11, 5, 682--691.Google ScholarCross Ref
- Lozano-pérez, T., and Wesley, M. A. 1979. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of ACM 22, 10, 560--570. Google ScholarDigital Library
- Mahmudi, M., and Kallmann, M. 2012. Precomputed motion maps for unstructured motion capture. In Eurographics/SIGGRAPH Symposium on Computer Animation (SCA). Google ScholarDigital Library
- Mahmudi, M., and Kallmann, M. 2013. Analyzing locomotion synthesis with feature-based motion graphs. IEEE Transactions on Visualization and Computer Graphics 19, 5, 774--786. Google ScholarDigital Library
- Mitchell, J. S. B. 1991. A new algorithm for shortest paths among obstacles in the plane. Annals of Mathematics and Artificial Intelligence 3, 83--105.Google ScholarCross Ref
- Mitchell, J. S. B. 1993. Shortest paths among obstacles in the plane. In Proceedings of the ninth annual symposium on computational geometry (SoCG), ACM, New York, NY, USA, 308--317. Google ScholarDigital Library
- Mubbasir Kapadia, Francisco Garcia, C. D. B., and Badler, N. I. 2013. Dynamic search on the gpu. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, IEEE, IROS '13.Google Scholar
- Nilsson, N. 1969. A mobile automaton: an application of artificial intelligence techniques. In In Proceedings of the 1969 International Joint Conference on Artificial Intelligence (IJCAI), 509--520. Google ScholarDigital Library
- Oliva, R., and Pelechano, N. 2013. A generalized exact arbitrary clearance technique for navigation meshes. In In Proceedings of the ACM SIGGRAPH conference on Motion in Games (MIG). Google ScholarDigital Library
- Oliva, R., and Pelechano, N. 2013. Neogen: Near optimal generator of navigation meshes for 3d multi-layered environments. Computer & Graphics 37, 5, 403--412. Google ScholarDigital Library
- Recast, 2014. Recast navigation mesh. https://github.com/memononen/recastnavigation.Google Scholar
- Shewchuk, J. R. 1996. Triangle: Engineering a 2d quality mesh generator and delaunay triangulator. In Applied Computational Geometry: Towards Geometric Engineering, M. C. Lin and D. Manocha, Eds., vol. 1148 of Lecture Notes in Computer Science. Springer-Verlag, May, 203--222. From the First ACM Workshop on Applied Computational Geometry. Google ScholarDigital Library
- Shewchuk, J. R. 1997. Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete & Computational Geometry 18, 3 (Oct.), 305--363.Google Scholar
- Shoulson, A., Gilbert, M. L., Kapadia, M., and Badler, N. I. 2013. An event-centric planning approach for dynamic real-time narrative. In Proceedings of Motion on Games, ACM, New York, NY, USA, MIG '13, 99:121--99:130. Google ScholarDigital Library
- Shoulson, A., Marshak, N., Kapadia, M., and Badler, N. I. 2013. Adapt: the agent development and prototyping testbed. In Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, ACM, New York, NY, USA, I3D '13, 9--18. Google ScholarDigital Library
- Singh, S., Kapadia, M., Reinman, G., and Faloutsos, P. 2011. Footstep navigation for dynamic crowds. Computer Animation and Virtual Worlds 22, 2--3, 151--158. Google ScholarDigital Library
- The CGAL Project. 2014. CGAL User and Reference Manual, 4.4 ed. CGAL Editorial Board. http://doc.cgal.org/4.4/Manual/packages.html.Google Scholar
- Tripath Toolkit, 2010. Triangulation and path planning toolkit. http://graphics.ucmerced.edu/software/tripath/.Google Scholar
- van Toll, W. G., IV, A. F. C., and Geraerts, R. 2011. Navigation meshes for realistic multi-layered environments. In In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 3526--3532.Google Scholar
- van Toll, W. G., IV, A. F. C., and Geraerts, R. 2012. A navigation mesh for dynamic environments. Computer Animation and Virtual Worlds (CAVW) 23, 6, 535--546. Google ScholarDigital Library
- Wein, R., van den Berg, J., and Halperin, D. 2007. The visibility-voronoi complex and its applications. Computational Geometry: Theory and Applications 36, 1, 66--78. Google ScholarDigital Library
Index Terms
- Navigation meshes and real-time dynamic planning for virtual worlds
Recommendations
6DoF navigation in virtual worlds: comparison of joystick-based and head-controlled paradigms
VRST '13: Proceedings of the 19th ACM Symposium on Virtual Reality Software and Technology6DoF navigation in a virtual world can usually be implemented by two types of navigation techniques: joystick-based input devices and steering metaphors based on movements of the user's body, e.g. head-controlled paradigms. These two different types of ...
Traversable interfaces between real and virtual worlds
CHI '00: Proceedings of the SIGCHI conference on Human Factors in Computing SystemsTraversable interfaces establish the illusion that virtual and physical worlds are joined together and that users can physically cross from one to the other. Our design for a traversable interface combines work on tele-embodiment, mixed reality ...
Comments