A Cell-centered, Agent-based Method that utilizes a Delaunay and Voronoi Environment in 2- and 3-Dimensions

Similar documents
Tiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research

Figure 1: An Area Voronoi Diagram of a typical GIS Scene generated from the ISPRS Working group III/3 Avenches data set. 2 ARRANGEMENTS 2.1 Voronoi Di

Tight Cocone DIEGO SALUME SEPTEMBER 18, 2013

13.472J/1.128J/2.158J/16.940J COMPUTATIONAL GEOMETRY

Voronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text

Module 4: Index Structures Lecture 16: Voronoi Diagrams and Tries. The Lecture Contains: Voronoi diagrams. Tries. Index structures

Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass

Lecture 2 Unstructured Mesh Generation

Topological Rewriting & Patch Transformations

Outline of the presentation

Joint Advanced Student School 2007 Martin Dummer

Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]

What is visualization? Why is it important?

Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware

Course 16 Geometric Data Structures for Computer Graphics. Voronoi Diagrams

Maps as Numbers: Data Models

A complete methodology for the implementation of XFEM models. Team: - Carlos Hernán Villanueva - Kai Yu

Parallel dynamic and kinetic regular triangulation in three dimensions

Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations

Lifting Transform, Voronoi, Delaunay, Convex Hulls

Volume Illumination and Segmentation

CELLULAR AUTOMATA IN MATHEMATICAL MODELING JOSH KANTOR. 1. History

Shading. Introduction to Computer Graphics Torsten Möller. Machiraju/Zhang/Möller/Fuhrmann

Generation of Hulls Encompassing Neuronal Pathways Based on Tetrahedralization and 3D Alpha Shapes

CAD & Computational Geometry Course plan

Recover from non-flippable configurations in parallel approaches to three dimensional kinetic regular triangulations

Surface Simplification Using Quadric Error Metrics

Programmable Pattern-Formation and Scale-Independence

Using High Performance Computing To Model Cellular Embryogenesis

Spectral Surface Reconstruction from Noisy Point Clouds

THE METHODS OF TRIANGULATION

Contours & Implicit Modelling 1

Definitions. Topology/Geometry of Geodesics. Joseph D. Clinton. SNEC June Magnus J. Wenninger

3. Voronoi Diagrams. 3.1 Definitions & Basic Properties. Examples :

AMCS / CS 247 Scientific Visualization Lecture 4: Data Representation, Pt. 1. Markus Hadwiger, KAUST

Lecture 11 Combinatorial Planning: In the Plane

Lecture Tessellations, fractals, projection. Amit Zoran. Advanced Topics in Digital Design

Homework for CS 594. Wasp Nest Building and Discrete Stigmergy. Adaptive Function of Nests. Structure of Some Wasp Nests

A Data Dependent Triangulation for Vector Fields

We can use square dot paper to draw each view (top, front, and sides) of the three dimensional objects:

COMPUTING CONSTRAINED DELAUNAY

Unit 9, Lesson 1: What Influences Temperature?

Overview of Unstructured Mesh Generation Methods

Geometric Computation: Introduction

3D Volume Mesh Generation of Human Organs Using Surface Geometries Created from the Visible Human Data Set

LATEST TRENDS on APPLIED MATHEMATICS, SIMULATION, MODELLING

Class #2. Data Models: maps as models of reality, geographical and attribute measurement & vector and raster (and other) data structures

Maps as Numbers: Data Models

Voronoi Diagram. Xiao-Ming Fu

Isosurface Rendering. CSC 7443: Scientific Information Visualization

Week 8 Voronoi Diagrams

Streaming Construction of Delaunay Triangulations

Foundations of Multidimensional and Metric Data Structures

Navigation and Metric Path Planning

Displacement Methods based on Field Analysis

Obtaining the H and T Honeycomb from a Cross-Section of the 16-cell Honeycomb

Translating the Architectural Complexity of the Colon or Polyp into a Sinusoid Wave for Classification via the Fast Fourier Transform

Constrained Delaunay Triangulations (CDT)

Lecture 6: GIS Spatial Analysis. GE 118: INTRODUCTION TO GIS Engr. Meriam M. Santillan Caraga State University

Modeling Robot Path Planning with CD++

Voronoi diagrams and applications

Tessellations. Irena Swanson Reed College, Portland, Oregon. MathPath, Lewis & Clark College, Portland, Oregon, 24 July 2018

Computational Geometry

ECE276B: Planning & Learning in Robotics Lecture 5: Configuration Space

Study on Delaunay Triangulation with the Islets Constraints

CS 4620 Midterm 1. Tuesday 22 October minutes

Quickstart for Web and Tablet App

Voronoi Diagrams. A Voronoi diagram records everything one would ever want to know about proximity to a set of points

Using Semi-Regular 4 8 Meshes for Subdivision Surfaces

Simple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements

Practical Linear Algebra: A Geometry Toolbox

What can we represent as a Surface?

Visualization of cross sectional data for morphogenetic studies

CMSC 425: Lecture 9 Geometric Data Structures for Games: Geometric Graphs Thursday, Feb 21, 2013

High-Dimensional Computational Geometry. Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018

Topological Issues in Hexahedral Meshing

Geometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data

Contents of Lecture. Surface (Terrain) Data Models. Terrain Surface Representation. Sampling in Surface Model DEM

Chapter 7 Spatial Operation

Grid Computing Systems: A Survey and Taxonomy

A Voronoi-Based Hybrid Meshing Method

Correctness. The Powercrust Algorithm for Surface Reconstruction. Correctness. Correctness. Delaunay Triangulation. Tools - Voronoi Diagram

Physically-Based Modeling and Animation. University of Missouri at Columbia

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem

Is there a different way to get the same result? Did we give enough information? How can we describe the position? CPM Materials modified by Mr.

form_script.workshop Turing proposed the idea that two or more re- In today s project we are building on the repel

Improving perception of intersecting 2D scalar fields. Mark Robinson Advisor: Dr. Kay Robbins

Scientific Computing WS 2018/2019. Lecture 12. Jürgen Fuhrmann Lecture 12 Slide 1

A Smoothing Algorithm for the Dual Marching Tetrahedra Method. Sean Johnson

Introduction to Voronoi Diagrams and Delaunay Triangulations

Multi-View Matching & Mesh Generation. Qixing Huang Feb. 13 th 2017

Solid Modelling. Graphics Systems / Computer Graphics and Interfaces COLLEGE OF ENGINEERING UNIVERSITY OF PORTO

CPSC 695. Methods for interpolation and analysis of continuing surfaces in GIS Dr. M. Gavrilova

Using High Performance Computing To Model Cellular Embryogenesis

DATE PERIOD. Lesson Reading Guide

PLC Papers Created For:

CS S Lecture February 13, 2017

Quickstart for Desktop Version

Planning Techniques for Robotics Planning Representations: Skeletonization- and Grid-based Graphs

EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines

Transcription:

A Cell-centered, Agent-based Method that utilizes a Delaunay and Voronoi Environment in 2- and 3-Dimensions Ryan C. Kennedy 1, Glen E.P. Ropella 2, C. Anthony Hunt 1 1 Department of Bioengineering and Therapeutic Sciences, University of California, San Francisco, CA 2 Tempus Dictum, Inc., Portland, OR

Background Postdoctoral Researcher, UCSF Department of Bioengineering and Therapeutic Sciences Modeling and Simulation (M&S) Student, University of Notre Dame Department of Computer Science and Engineering PhD, MS, BS Bioinformatics M&S (GIS-aware ABM)

Background Motivation Develop a method to model individual agent behavior from an agent s perspective in an off-lattice environment Use case: biological cells Goal Facilitate study of more advanced agent (cell) behavior through a dynamic off-lattice environment Deeper explanatory mechanistic insight into how mammalian cells restructure and use themselves during morphogenesis and tissue repair Ability for cells to dynamically adjust during a simulation

Cell-centered Models Numerous techniques Cellular Potts Model (CPM) Widely used to study morphogenesis and tumors Grid-based perspective Cells exist in a lattice connected by bonds largely governed by equations

Off-lattice vs Lattice Environments Lattice Discrete Less computationally expensive Examples: CPM Off-lattice Continuous More computationally expensive Calculate neighbors, update spatial representation Dynamic Examples: Vertex, force-based, subcellular element method

Why Off-lattice? Agents not limited to predefined spatial boundaries Agents can take a variety of shapes and sizes Agents can have a varying number of neighbors Can be more realistic Can come close to approximating the shape and pattern of biological cells

Comparison of Grid Types Grid vs Hexagonal vs D/V

Delaunay/Voronoi Representation Limited work has been performed in ABM cell-centered realm Meyer-Hermann group utilizes dynamic force-based models utilizing Delaunay/Voronoi (D/V) grids to study tumor spheroids [1] D/V grids to represent butterfly wing epidermis [2] [1] Schaller, G., Meyer-Hermann, M., Multicellular tumor spheroid in an off-lattice Voronoi-Delaunay cell model, Physical Review E, 71(5), 2005. [2] Honda, H., Tanemura, M., Yoshida, A., Differentiation of Wing Epidermal Scale Cells in a Butterfly Under the Lateral Inhibition Model Appearance of Large Cells in a Polygonal Pattern, Acto Biotheoretica, 48:121-136, 2000.

Voronoi-like Examples http://www.lochnesswatergardens.com/pondblog/wp-content/uploads/2012/03/dragonfly-wing-closeup.jpg http://i282.photobucket.com/albums/kk273/brucedstaylor/voronoi/voronigiraffe.jpg http://i282.photobucket.com/albums/kk273/brucedstaylor/voronoi/voronoimapleleaf2.jpg

Method Framework MASON Open-source, Java Multiagent Simulation Toolkit Distinct separation of simulation from display No built-in D/V support Visualization Toolkit (VTK) Open-source, C++ (with wrappers for other languages) Advanced system for image processing and 3D graphics Triangulation support, but no built-in support for calculating Voronoi tessellations Must build from the triangulation

Agent-Centered Model to Study the Behavior of Agents Represent the behavior of many individual agents to study the collective behavior of a system of agents Space as Delaunay and Voronoi Grids Each point exists in an area; its corresponding V-Cell encompasses all points closer to said point than any other point Abstraction from regular grids

Visualization/Terminology Voronoi-cells (V- Cells) distinguished by color V-Cell centers are the dots within each V-Cell Delaunay triangulation shown with white lines White circumcircles intersect each V-Cell center (triangles)

Interactive Example http://www.cs.cornell.edu/home/chew/delaunay.html

V-Cell Representation Method supports and arbitrary number of V- Cell types with varying behaviors V-Cell decisions influenced by neighborhood Neighbors are considered as V-Cells 1-hop away from a given V-Cell (V-Cell center to V- Cell center) Calculated from triangulation Triangulation recalculated as V-Cells move Changes V-Cell shapes

2D Process Given a set of V-Cell center points: Triangulate with VTK Calculate extent of V-Cell using VTK s circumcircle method on each triangle System adapted from Bowyer: Bowyer, A., Computing Dirichlet tessellations, The Computer Journal, 24(2):162-166, 1981.

3D Process Given a set of V-Cell center points: Generate each "face" (membrane) of the V-Cell through the triangulation (which in 3D returns tetrahedra) For a given V-Cell, find tetrahedra that share the center point and share faces with the given tetrahedron (adjacent tetrahedra- there will be 2) For an adjacent tetrahedron, calculate the circumsphere Using the circumspheres from the 2 adjacent tetrahedra and the given tetrahedron, form a triangle (what you see on the surface) Together, these triangles form the surface membrane of the cell

2D Voronoi Cells http://blog.kleinproject.org/wp-content/uploads/2012/05/voronoi.png

3D Voronoi Cells http://www-math.mit.edu/dryfluids/gallery/voronoi_huge.png

Use Case: Biological Cells Initial focus on modeling cysts and 3 main cell types: Lumen, Luminal epithelial (LEC), Myoepithelial (MEC) Several behaviors captured Behavior governed by axioms developed by domain experts Model movement, growth, division, and death in 2D and 3D Cell rotation implemented in 2D

2D Voronoi Cells Key: Lumen LEC MEC Triangulation

3D Voronoi Cells

3D Voronoi Cells with Triangulation

Demonstrations 2D Cell Movement, Division, Death 2D Cell Growth 2D Cell Rotation 3D Cell Movement, Division, Death 3D Cell Growth

Applications Cell-centered Modeling Explore the impact of cell layouts and types on cell behavior Predict the impact of a cyst on surrounding cells, modeling growing or rotating cysts Networks Nodes naturally map to V-Cell centers Model routes between agents Simulate ad-hoc cell phone networks

Summary New framework within the realm of agent-centered modeling Demonstrated basic cell behavior D/V environment a viable alternative to traditional lattice-based environments

Questions or Comments?