"Fitting Behaviors to Pedestrian Simulations"

Alon Lerner - Eitan Fitusi - Yiorgos Chrysanthou - Daniel Cohen-Or

In this paper we present a data-driven approach for fitting behaviors to simulated pedestrian crowds. Our method annotates agent trajectories, generated by any crowd simulator, with action-tags. The aggregate effect of animating the agents according to the tagged trajectories enhances the impression that the agents are interacting with one another and with the environment...    

Presented in SCA 2009.

"Crowds by Example"

Alon Lerner - Yiorgos Chrysanthou - Dani Lischinski

This paper presents an example-based crowd simulation technique. Most crowd simulation techniques assume that the behavior can be defined by a restricted set of rules. This assumption limits the behavioral complexity of the simulated agents. By learning from real-world examples, our autonomous agents display complex natural behaviors that are often missing in crowd simulations.

Examples are created from tracked video segments of real pedestrian crowds. During a simulation, autonomous agents search for examples that closely match the situation that they are facing. Trajectories taken by real people in similar situations, are copied to the simulated agents, resulting in seemingly natural behaviors.

Presented in Eurographics 2007.

"Behavior-Graph for Crowd Simulation"

Alon Lerner - Eitan Fitusi - Yiorgos Chrysanthou - Daniel Cohen-Or

Siggraph 2007 poster

"Efficient Cells-and-Portals Partitioning"

Alon Lerner - Yiorgos Chrysanthou - Daniel Cohen-Or

Appeared in: Computer Animation and Virtual Worlds 2006

In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. Our cells-and-portals algorithm is designed to deal with arbitrary oriented walls ...

"Aggressive Visibility for Rendering Extremely Complex Foliage Scenes"

Daniel Cohen-Or - Erez Sayer - Alon Lerner - Yiorgos Chrysanthou - Oliver Deussen

Appeared in: Korea-Israel Bi-National Conference on Geometric Modeling and Computer Graphics

This paper introduces a method to accelerate the rendering of extremely complex scenes by representing large portions of the scene with simplified representations. The method uses aggressive visibility to tag large and mostly occluded portions of the scene as background. The background scene is rendered by low cost imposters ...

"Breaking the Walls: Scene Partitioning and Portal Creation"

Alon Lerner - Yiorgos Chrysanthou - Daniel Cohen-Or

Appeared in: Pacific Graphics 2003

In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a cells-and-portals partition, and introduce a two-pass algorithm that computes a cells-and-portals partition. The algorithm uses a simple heuristic that creates short portals as a means for generating an effective partition.

"Designing Multi-Route Synthesis in Combinatorial Chemistry"

Adi Akavia - Hanoch Senderowitz - Alon Lerner - Ron Shamir

Appeared in: Journal of Combinatorial Chemistry 2004

Solid-phase mix-and-split combinatorial synthesis is often used to produce large arrays of compounds to be tested during the various stages of the drug development process. This method can be represented by a synthesis graph in which nodes correspond to grow operations and arcs to beads transferred among the different reaction vessels ...