Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

120
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
120
Parallel Processing01:20

Parallel Processing

356
The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
356
Fast Fourier Transform01:10

Fast Fourier Transform

529
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
529
Virtual Work for a System of Connected Rigid Bodies01:06

Virtual Work for a System of Connected Rigid Bodies

501
Virtual work is a powerful method used to solve problems involving several connected rigid bodies. When the system is in equilibrium, virtual work is zero. This allows the calculation of the resulting forces when a system undergoes a virtual displacement. When attempting to analyze such a system, first, use a free-body diagram, where an independent coordinate represents the configuration of the links, and mark its deflected position resulting from the positive virtual displacement.
Next,...
501
Accelerating Fluids01:17

Accelerating Fluids

1.6K
When a fluid is in constant acceleration, the pressure and buoyant force equations are modified. Suppose a beaker is placed in an elevator accelerating upward with a constant acceleration, a. In the beaker, assume there is a thin cylinder of height h with an infinitesimal cross-sectional area, ΔS.
The motion of the liquid within this infinitesimal cylinder is considered to obtain the pressure difference. Three vertical forces act on this liquid:
1.6K
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

336
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
336

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

pGPUMCD: an efficient GPU-based Monte Carlo code for accurate proton dose calculations.

Physics in medicine and biology·2019
Same author

Fast GPU-based Monte Carlo simulations for LDR prostate brachytherapy.

Physics in medicine and biology·2015
Same author

A study of potential numerical pitfalls in GPU-based Monte Carlo dose calculation.

Physics in medicine and biology·2015
Same journal

Truss structure optimization via hierarchical tree search.

Advanced modeling and simulation in engineering sciences·2026
Same journal

Data-driven non-intrusive reduced order modelling of selective laser melting additive manufacturing process using proper orthogonal decomposition and convolutional autoencoder.

Advanced modeling and simulation in engineering sciences·2025
Same journal

Response estimation and system identification of dynamical systems via physics-informed neural networks.

Advanced modeling and simulation in engineering sciences·2025
Same journal

A segregated reduced-order model of a pressure-based solver for turbulent compressible flows.

Advanced modeling and simulation in engineering sciences·2025
Same journal

Discovering non-associated pressure-sensitive plasticity models with EUCLID.

Advanced modeling and simulation in engineering sciences·2025
Same journal

Data-driven material modeling based on the Constitutive Relation Error.

Advanced modeling and simulation in engineering sciences·2024
See all related articles

Related Experiment Video

Updated: Oct 13, 2025

Rapid in-silico Battery Electrolyte Electrochemical Reaction Generation using 3T-VASP Multi-Scale Energy Minimization
05:37

Rapid in-silico Battery Electrolyte Electrochemical Reaction Generation using 3T-VASP Multi-Scale Energy Minimization

Published on: August 22, 2025

233

GPU-friendly data structures for real time simulation.

Vincent Magnoux1, Benoît Ozell1

  • 1Department of Computer Engineering and Software Engineering, Polytechnique Montréal, Chemin de Polytechnique, Montréal, Canada.

Advanced Modeling and Simulation in Engineering Sciences
|November 15, 2021
PubMed
Summary
This summary is machine-generated.

This study introduces a new graph data structure for virtual surgery simulators, improving computational speed by 10x. This innovation enables faster, more realistic surgical training simulations with virtual organ cutting.

Keywords:
Cutting simulationGPU computingPhysically-based simulationSurgery simulation

More Related Videos

A Protocol for Real-time 3D Single Particle Tracking
10:16

A Protocol for Real-time 3D Single Particle Tracking

Published on: January 3, 2018

15.1K
Creating a Structurally Realistic Finite Element Geometric Model of a Cardiomyocyte to Study the Role of Cellular Architecture in Cardiomyocyte Systems Biology
08:54

Creating a Structurally Realistic Finite Element Geometric Model of a Cardiomyocyte to Study the Role of Cellular Architecture in Cardiomyocyte Systems Biology

Published on: April 18, 2018

9.8K

Related Experiment Videos

Last Updated: Oct 13, 2025

Rapid in-silico Battery Electrolyte Electrochemical Reaction Generation using 3T-VASP Multi-Scale Energy Minimization
05:37

Rapid in-silico Battery Electrolyte Electrochemical Reaction Generation using 3T-VASP Multi-Scale Energy Minimization

Published on: August 22, 2025

233
A Protocol for Real-time 3D Single Particle Tracking
10:16

A Protocol for Real-time 3D Single Particle Tracking

Published on: January 3, 2018

15.1K
Creating a Structurally Realistic Finite Element Geometric Model of a Cardiomyocyte to Study the Role of Cellular Architecture in Cardiomyocyte Systems Biology
08:54

Creating a Structurally Realistic Finite Element Geometric Model of a Cardiomyocyte to Study the Role of Cellular Architecture in Cardiomyocyte Systems Biology

Published on: April 18, 2018

9.8K

Area of Science:

  • Computer graphics
  • Medical simulation
  • Computational geometry

Background:

  • Virtual surgery simulators require high computational performance for realistic interactions.
  • Simulating organ cutting in virtual surgery increases computational complexity.
  • Graphics Processing Units (GPUs) offer performance improvements but pose data structure challenges.

Purpose of the Study:

  • To propose a novel graph data structure for efficient physically based simulation on GPUs.
  • To enhance the performance of virtual surgery simulators, particularly for tasks involving organ cutting.
  • To enable interactive simulation of complex deformable objects.

Main Methods:

  • Developed a new graph data structure that aligns nodes in memory for independent local modifications.
  • Implemented the data structure for a meshless simulation method on GPUs.
  • Grouped memory transfers to optimize updates during simulated organ cutting.

Main Results:

  • Achieved a 10-fold increase in computation time compared to CPU implementations.
  • Reduced data transferred for graph updates by 80-90% through batched transfers.
  • Demonstrated the ability to simulate complex, cuttable models at interactive rates.

Conclusions:

  • The proposed graph data structure significantly enhances GPU-based simulation performance for virtual surgery.
  • The method allows for efficient handling of dynamic changes like organ cutting.
  • This facilitates the development of more realistic and responsive surgical training tools.