Sciweavers

24 search results - page 1 / 5
» Fast Simulation of Laplacian Growth
Sort
View
CGA
2007
13 years 10 months ago
Fast Simulation of Laplacian Growth
— Laplacian instability is the physical mechanism that drives pattern formation in many disparate natural phenomena. However, current algorithms for simulating this instability a...
Theodore Kim, Jason Sewall, Avneesh Sud, Ming C. L...
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 11 months ago
Fast simulation of large-scale growth models
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
Tobias Friedrich, Lionel Levine
WSCG
2003
143views more  WSCG 2003»
14 years 3 days ago
Fast Algorithm for Stochastic Tree Computation
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which ...
Meng-Zhen Kang, Philippe de Reffye, Jean Fran&cced...
CGF
2005
136views more  CGF 2005»
13 years 10 months ago
Practical CFD Simulations on Programmable Graphics Hardware using SMAC
The explosive growth in integration technology and the parallel nature of rasterization-based graphics APIs changed the panorama of consumer-level graphics: today, GPUs are cheap,...
Carlos Eduardo Scheidegger, João Luiz Dihl ...
WONS
2005
IEEE
14 years 4 months ago
Fast Handoff process in Micro Mobile MPLS protocol for Micro-Mobility Management in Next Generation Networks
The rapid growth of wireless networks and services, integrated with the next-generation mobile communication systems, has led to designing efficient handoff protocols to handle m...
Rami Langar, Gwendal Le Grand, Samir Tohmé