Cantitate/Preț
Produs

Geometric and Discrete Path Planning for Interactive Virtual Worlds: Synthesis Lectures on Visual Computing: Computer Graphics, Animation, Computational Photography and Imaging

Autor Marcelo Kallmann, Mubbasir Kapadia
en Limba Engleză Paperback – 28 ian 2016
Path planning and navigation are indispensable components for controlling autonomous agents in interactive virtual worlds. Given the growing demands on the size and complexity of modern virtual worlds, a number of new techniques have been developed for achieving intelligent navigation for the next generation of interactive multi-agent simulations. This book reviews the evolution of several related techniques, starting from classical planning and computational geometry techniques and then gradually moving toward more advanced topics with focus on recent developments from the work of the authors. The covered topics range from discrete search and geometric representations to planning under different types of constraints and harnessing the power of graphics hardware in order to address Euclidean shortest paths and discrete search for multiple agents under limited time budgets. The use of planning algorithms beyond path planning is also discussed in the areas of crowd animation and whole-body motion planning for virtual characters.
Citește tot Restrânge

Din seria Synthesis Lectures on Visual Computing: Computer Graphics, Animation, Computational Photography and Imaging

Preț: 38281 lei

Nou

Puncte Express: 574

Preț estimativ în valută:
7332 7554$ 6142£

Carte tipărită la comandă

Livrare economică 22 februarie-08 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031014604
ISBN-10: 303101460X
Ilustrații: XIX, 181 p.
Dimensiuni: 191 x 235 mm
Greutate: 0.36 kg
Editura: Springer International Publishing
Colecția Springer
Seria Synthesis Lectures on Visual Computing: Computer Graphics, Animation, Computational Photography and Imaging

Locul publicării:Cham, Switzerland

Cuprins

Preface.- Acknowledgments.- Basic Approaches for World Representation.- Discrete Search Algorithms.- Euclidean Shortest Paths.- Navigation Meshes and Geometric Structures with Clearance.- Extending Basic Search Techniques.- Constraint-Aware Navigation.- Anytime Dynamic Search on the GPU.- Dynamic Planning of Footstep Trajectories for Crowd Simulation.- Planning using Multiple Domains of Control.- Motion Planning for Character Motion Synthesis.- Epilogue.- Bibliography.- Authors' Biographies .

Notă biografică

Marcelo Kallmann is Founding Faculty and Associate Professor of Computer Science at the School of Engineering of the University of California, Merced. He holds a Ph.D. from the Swiss Federal Institute of Technology in Lausanne (EPFL), was Research Faculty at the University of Southern California (USC), and a scientist at the USC Institute for Creative Technologies (ICT) before moving to UC Merced in 2005. His areas of research include computer animation, virtual reality, and motion planning. At UC Merced, he established and leads the computer graphics research group. His research work has been supported by several awards from the US National Science Foundation, and his work on triangulations for path planning runs inside The Sims 4, the latest installment of one of the best-selling video game series of all time.Mubbasir Kapadia is an Assistant Professor in the Computer Science Department at Rutgers University. Previously, he was an Associate Research Scientist at Disney Research Zurich. He was a postdoctoral researcher and Assistant Director at the Center for Human Modeling and Simulation at University of Pennsylvania, under the directorship of Prof. Norman I. Badler. He was the project lead on the United States Army Research Laboratory (ARL) funded project Robotics Collaborative Technology Alliance (RCTA). He received his Ph.D. in computer science at University of California, Los Angeles under the advisement of Professor Petros Faloutsos. He is the co-author of the book Virtual Crowds: Steps Toward Behavioral Realism, Morgan & Claypool Publishers, 2015.