Marcelo Kallmann

Marcelo Kallmann

Auto-generated profile, based on publicly available information

Marcelo Kallmann

Amazon Robotics, Amazon, North Reading, MA, USA

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 June 2007 in Computer Animation and Virtual Worlds
Verified
Journal Article
Closed access
PDF file
MKMarcelo Kallmann
Marcelo Kallmann

1 January 2010
Verified
Book Chapter
Closed access
PDF file
YHYazhou Huang
Yazhou Huang
MKMarcelo Kallmann
Marcelo Kallmann

1 April 2015
Verified
Book Chapter
Closed access
PDF file
MKMarcelo Kallmann
Marcelo Kallmann
CCCarlo Camporesi
Carlo Camporesi
JHJay Han
Jay Han

24 July 2016
Verified
Conference Paper
Open access
MKMarcelo Kallmann
Marcelo Kallmann
MKMubbasir Kapadia
Mubbasir Kapadia
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 course reviews the evolution of the several related techniques, from classical planning algorithms and computational geometry techniques to 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.

4 February 2019 in Computer Animation and Virtual Worlds
Verified
Journal Article
Closed access
PDF file
OOOktar Ozgen
Oktar Ozgen
MKMarcelo Kallmann
Marcelo Kallmann
EBEric Brown
Eric Brown

11 March 2019 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
RFRenato Farias
Renato Farias
MKMarcelo Kallmann
Marcelo Kallmann
We introduce a new method for computing optimal path maps on the GPU using OpenGL shaders. Our method explores GPU rasterization as a way to propagate optimal costs on a polygonal 2D environment, producing optimal path maps which can efficiently be queried at run-time. Our method is implemented entirely with GPU shaders, does not require pre-computation, addresses optimal path maps with multiple points and line segments as sources, and introduces a new optimal path map concept not addressed before: maps with weights at vertices representing possible changes in traversal speed. The produced maps offer new capabilities not explored by previous navigation representations and at the same time address paths with global optimality, a characteristic which has been mostly neglected in animated virtual environments. The proposed path maps partition the input environment into the regions sharing a same parent point along the shortest path to the closest source, taking into account possible speed changes at vertices. The proposed approach is particularly suitable for the animation of multiple agents moving toward the entrances or exits of a virtual environment, a situation which is efficiently represented with the proposed path maps.