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

Size: px
Start display at page:

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

Transcription

1 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

2 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)

3 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

4 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

5 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

6 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

7 Comparison of Grid Types Grid vs Hexagonal vs D/V

8 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), [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: , 2000.

9 Voronoi-like Examples

10 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

11 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

12 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)

13 Interactive Example

14 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

15 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): , 1981.

16 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

17 2D Voronoi Cells

18 3D Voronoi Cells

19 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

20 2D Voronoi Cells Key: Lumen LEC MEC Triangulation

21 3D Voronoi Cells

22 3D Voronoi Cells with Triangulation

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

24 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

25 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

26 Questions or Comments?

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

Tiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research Tiling Three-Dimensional Space with Simplices Shankar Krishnan AT&T Labs - Research What is a Tiling? Partition of an infinite space into pieces having a finite number of distinct shapes usually Euclidean

More information

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

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 Qualitative Spatial Relations using Arrangements for Complex Images M. Burge and W. Burger Johannes Kepler University, Department of Systems Science Computer Vision Laboratory, A-4040 Linz, Austria burge@cast.uni-linz.ac.at

More information

Tight Cocone DIEGO SALUME SEPTEMBER 18, 2013

Tight Cocone DIEGO SALUME SEPTEMBER 18, 2013 Tight Cocone DIEGO SALUME SEPTEMBER 18, 2013 Summary Problem: The Cocone algorithm produces surfaces with holes and artifacts in undersampled areas in the data. Solution: Extend the Cocone algorithm to

More information

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

13.472J/1.128J/2.158J/16.940J COMPUTATIONAL GEOMETRY 13.472J/1.128J/2.158J/16.940J COMPUTATIONAL GEOMETRY Lecture 23 Dr. W. Cho Prof. N. M. Patrikalakis Copyright c 2003 Massachusetts Institute of Technology Contents 23 F.E. and B.E. Meshing Algorithms 2

More information

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

Voronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams in the Plane Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams As important as convex hulls Captures the neighborhood (proximity) information of geometric objects

More information

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

Module 4: Index Structures Lecture 16: Voronoi Diagrams and Tries. The Lecture Contains: Voronoi diagrams. Tries. Index structures The Lecture Contains: Voronoi diagrams Tries Delaunay triangulation Algorithms Extensions Index structures 1-dimensional index structures Memory-based index structures Disk-based index structures Classification

More information

Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass

Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian

More information

Lecture 2 Unstructured Mesh Generation

Lecture 2 Unstructured Mesh Generation Lecture 2 Unstructured Mesh Generation MIT 16.930 Advanced Topics in Numerical Methods for Partial Differential Equations Per-Olof Persson (persson@mit.edu) February 13, 2006 1 Mesh Generation Given a

More information

Topological Rewriting & Patch Transformations

Topological Rewriting & Patch Transformations Topological Rewriting & Patch Transformations Antoine Spicher www.spatial-computing.org/mgs SUPMECA June 2015 Outline MGS: a Formal Introduction Patch Transformations Differential Operators An Integrative

More information

Outline of the presentation

Outline of the presentation Surface Reconstruction Petra Surynková Charles University in Prague Faculty of Mathematics and Physics petra.surynkova@mff.cuni.cz Outline of the presentation My work up to now Surfaces of Building Practice

More information

Joint Advanced Student School 2007 Martin Dummer

Joint Advanced Student School 2007 Martin Dummer Sierpiński-Curves Joint Advanced Student School 2007 Martin Dummer Statement of the Problem What is the best way to store a triangle mesh efficiently in memory? The following points are desired : Easy

More information

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

Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Preliminaries Recall: Given a smooth function f:r R, the function

More information

What is visualization? Why is it important?

What is visualization? Why is it important? What is visualization? Why is it important? What does visualization do? What is the difference between scientific data and information data Visualization Pipeline Visualization Pipeline Overview Data acquisition

More information

Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware

Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware paper by Kennet E. Hoff et al. (University of North Carolina at Chapel Hill) presented by Daniel Emmenegger GDV-Seminar ETH Zürich,

More information

Course 16 Geometric Data Structures for Computer Graphics. Voronoi Diagrams

Course 16 Geometric Data Structures for Computer Graphics. Voronoi Diagrams Course 16 Geometric Data Structures for Computer Graphics Voronoi Diagrams Dr. Elmar Langetepe Institut für Informatik I Universität Bonn Geometric Data Structures for CG July 27 th Voronoi Diagrams San

More information

Maps as Numbers: Data Models

Maps as Numbers: Data Models Maps as Numbers: Data Models vertices E Reality S E S arcs S E Conceptual Models nodes E Logical Models S Start node E End node S Physical Models 1 The Task An accurate, registered, digital map that can

More information

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

A complete methodology for the implementation of XFEM models. Team: - Carlos Hernán Villanueva - Kai Yu A complete methodology for the implementation of XFEM models Team: - Carlos Hernán Villanueva - Kai Yu Problem Statement QUAD4 DISCONTINUITY Problem Statement Traditional FEM Mesh generates discrete representation

More information

Parallel dynamic and kinetic regular triangulation in three dimensions

Parallel dynamic and kinetic regular triangulation in three dimensions Computer Physics Communications 172 (2005) 86 108 www.vier.com/locate/cpc Parallel dynamic and kinetic regular triangulation in three dimensions Tilo Beyer a,b,d,e,, Gernot Schaller b, Andreas Deutsch

More information

Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations

Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations Emma Twersky May 2017 Abstract This paper is an exploration into centroidal Voronoi tessellations, or CVTs. A centroidal

More information

Lifting Transform, Voronoi, Delaunay, Convex Hulls

Lifting Transform, Voronoi, Delaunay, Convex Hulls Lifting Transform, Voronoi, Delaunay, Convex Hulls Subhash Suri Department of Computer Science University of California Santa Barbara, CA 93106 1 Lifting Transform (A combination of Pless notes and my

More information

Volume Illumination and Segmentation

Volume Illumination and Segmentation Volume Illumination and Segmentation Computer Animation and Visualisation Lecture 13 Institute for Perception, Action & Behaviour School of Informatics Overview Volume illumination Segmentation Volume

More information

CELLULAR AUTOMATA IN MATHEMATICAL MODELING JOSH KANTOR. 1. History

CELLULAR AUTOMATA IN MATHEMATICAL MODELING JOSH KANTOR. 1. History CELLULAR AUTOMATA IN MATHEMATICAL MODELING JOSH KANTOR 1. History Cellular automata were initially conceived of in 1948 by John von Neumann who was searching for ways of modeling evolution. He was trying

More information

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

Shading. Introduction to Computer Graphics Torsten Möller. Machiraju/Zhang/Möller/Fuhrmann Shading Introduction to Computer Graphics Torsten Möller Machiraju/Zhang/Möller/Fuhrmann Reading Chapter 5.5 - Angel Chapter 6.3 - Hughes, van Dam, et al Machiraju/Zhang/Möller/Fuhrmann 2 Shading Illumination

More information

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

Generation of Hulls Encompassing Neuronal Pathways Based on Tetrahedralization and 3D Alpha Shapes Generation of Hulls Encompassing Neuronal Pathways Based on Tetrahedralization and 3D Alpha Shapes Dorit Merhof 1,2, Martin Meister 1, Ezgi Bingöl 1, Peter Hastreiter 1,2, Christopher Nimsky 2,3, Günther

More information

CAD & Computational Geometry Course plan

CAD & Computational Geometry Course plan Course plan Introduction Segment-Segment intersections Polygon Triangulation Intro to Voronoï Diagrams & Geometric Search Sweeping algorithm for Voronoï Diagrams 1 Voronoi Diagrams Voronoi Diagrams or

More information

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

Recover from non-flippable configurations in parallel approaches to three dimensional kinetic regular triangulations Recover from non-flippable configurations in parallel approaches to three dimensional kinetic regular triangulations TILO YR and MIHL MYR-HRMNN Frankfurt Institute for dvanced Studies (FIS) Johann Wolfgang

More information

Surface Simplification Using Quadric Error Metrics

Surface Simplification Using Quadric Error Metrics Surface Simplification Using Quadric Error Metrics Authors: Michael Garland & Paul Heckbert Presented by: Niu Xiaozhen Disclaimer: Some slides are modified from original slides, which were designed by

More information

Programmable Pattern-Formation and Scale-Independence

Programmable Pattern-Formation and Scale-Independence Programmable Pattern-Formation and Scale-Independence Radhika Nagpal PostDoctoral Lecturer, MIT Artificial Intelligence Lab radhi@ai.mit.edu This paper presents a programming language for pattern-formation

More information

Using High Performance Computing To Model Cellular Embryogenesis

Using High Performance Computing To Model Cellular Embryogenesis Using High Performance Computing To Model Cellular Embryogenesis C. Elegans RepastHPC Simulation Manual Written By: Gerard Vanloo Last Updated: August 7, 2015 1 Table of Contents Abstract and Overview

More information

Spectral Surface Reconstruction from Noisy Point Clouds

Spectral Surface Reconstruction from Noisy Point Clouds Spectral Surface Reconstruction from Noisy Point Clouds 1. Briefly summarize the paper s contributions. Does it address a new problem? Does it present a new approach? Does it show new types of results?

More information

THE METHODS OF TRIANGULATION

THE METHODS OF TRIANGULATION THE METHODS OF TRIANGULATION Abstract M. Varshosaz, Assistant Professor, Faculty of Geodesy & Geomatics Eng., K.N. Toosi University of Technology K.N. Toosi University of Technology, Vali_Asr St, Tehran,

More information

Contours & Implicit Modelling 1

Contours & Implicit Modelling 1 Contouring & Implicit Modelling Visualisation Lecture 8 Institute for Perception, Action & Behaviour School of Informatics Contours & Implicit Modelling 1 Brief Recap Contouring Implicit Functions lecture

More information

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

Definitions. Topology/Geometry of Geodesics. Joseph D. Clinton. SNEC June Magnus J. Wenninger Topology/Geometry of Geodesics Joseph D. Clinton SNEC-04 28-29 June 2003 Magnus J. Wenninger Introduction Definitions Topology Goldberg s polyhedra Classes of Geodesic polyhedra Triangular tessellations

More information

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

3. Voronoi Diagrams. 3.1 Definitions & Basic Properties. Examples : 3. Voronoi Diagrams Examples : 1. Fire Observation Towers Imagine a vast forest containing a number of fire observation towers. Each ranger is responsible for extinguishing any fire closer to her tower

More information

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

AMCS / CS 247 Scientific Visualization Lecture 4: Data Representation, Pt. 1. Markus Hadwiger, KAUST AMCS / CS 247 Scientific Visualization Lecture 4: Data Representation, Pt. 1 Markus Hadwiger, KAUST Reading Assignment #2 (until Sep 1) Read (required): Data Visualization book, finish Chapter 2 Data Visualization

More information

Lecture 11 Combinatorial Planning: In the Plane

Lecture 11 Combinatorial Planning: In the Plane CS 460/560 Introduction to Computational Robotics Fall 2017, Rutgers University Lecture 11 Combinatorial Planning: In the Plane Instructor: Jingjin Yu Outline Convex shapes, revisited Combinatorial planning

More information

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

Lecture Tessellations, fractals, projection. Amit Zoran. Advanced Topics in Digital Design Lecture Tessellations, fractals, projection Amit Zoran Advanced Topics in Digital Design 67682 The Rachel and Selim Benin School of Computer Science and Engineering The Hebrew University of Jerusalem,

More information

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

Homework for CS 594. Wasp Nest Building and Discrete Stigmergy. Adaptive Function of Nests. Structure of Some Wasp Nests Homework for CS 594 See: cs.utk.edu/~mclennan/classes/420/handouts /Homework-594-1.pdf or look under Projects and Assignments Due Sept. 29 Required for CS 594 students Extra-credit for CS 420 students

More information

A Data Dependent Triangulation for Vector Fields

A Data Dependent Triangulation for Vector Fields A Data Dependent Triangulation for Vector Fields Gerik Scheuermann Hans Hagen Institut for Computer Graphics and CAGD Department of Computer Science University of Kaiserslautern, Postfach 3049, D-67653

More information

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

We can use square dot paper to draw each view (top, front, and sides) of the three dimensional objects: Unit Eight Geometry Name: 8.1 Sketching Views of Objects When a photo of an object is not available, the object may be drawn on triangular dot paper. This is called isometric paper. Isometric means equal

More information

COMPUTING CONSTRAINED DELAUNAY

COMPUTING CONSTRAINED DELAUNAY COMPUTING CONSTRAINED DELAUNAY TRIANGULATIONS IN THE PLANE By Samuel Peterson, University of Minnesota Undergraduate The Goal The Problem The Algorithms The Implementation Applications Acknowledgments

More information

Unit 9, Lesson 1: What Influences Temperature?

Unit 9, Lesson 1: What Influences Temperature? Unit 9, Lesson 1: What Influences Temperature? Let s see if we can predict the weather. 1.1: Temperature Changes What factors or variables can influence the outside temperature? Make a list of different

More information

Overview of Unstructured Mesh Generation Methods

Overview of Unstructured Mesh Generation Methods Overview of Unstructured Mesh Generation Methods Structured Meshes local mesh points and cells do not depend on their position but are defined by a general rule. Lead to very efficient algorithms and storage.

More information

Geometric Computation: Introduction

Geometric Computation: Introduction : Introduction Piotr Indyk Welcome to 6.838! Overview and goals Course Information Syllabus 2D Convex hull Signup sheet Geometric computation occurs everywhere: Geographic Information Systems (GIS): nearest

More information

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

3D Volume Mesh Generation of Human Organs Using Surface Geometries Created from the Visible Human Data Set 3D Volume Mesh Generation of Human Organs Using Surface Geometries Created from the Visible Human Data Set John M. Sullivan, Jr., Ziji Wu, and Anand Kulkarni Worcester Polytechnic Institute Worcester,

More information

LATEST TRENDS on APPLIED MATHEMATICS, SIMULATION, MODELLING

LATEST TRENDS on APPLIED MATHEMATICS, SIMULATION, MODELLING 3D surface reconstruction of objects by using stereoscopic viewing Baki Koyuncu, Kurtuluş Küllü bkoyuncu@ankara.edu.tr kkullu@eng.ankara.edu.tr Computer Engineering Department, Ankara University, Ankara,

More information

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

Class #2. Data Models: maps as models of reality, geographical and attribute measurement & vector and raster (and other) data structures Class #2 Data Models: maps as models of reality, geographical and attribute measurement & vector and raster (and other) data structures Role of a Data Model Levels of Data Model Abstraction GIS as Digital

More information

Maps as Numbers: Data Models

Maps as Numbers: Data Models Maps as Numbers: Data Models vertices nodes tart node nd node arcs Reality Conceptual Models The Task An accurate, registered, digital map that can be queried and analyzed Translate: Real World Locations,

More information

Voronoi Diagram. Xiao-Ming Fu

Voronoi Diagram. Xiao-Ming Fu Voronoi Diagram Xiao-Ming Fu Outlines Introduction Post Office Problem Voronoi Diagram Duality: Delaunay triangulation Centroidal Voronoi tessellations (CVT) Definition Applications Algorithms Outlines

More information

Isosurface Rendering. CSC 7443: Scientific Information Visualization

Isosurface Rendering. CSC 7443: Scientific Information Visualization Isosurface Rendering What is Isosurfacing? An isosurface is the 3D surface representing the locations of a constant scalar value within a volume A surface with the same scalar field value Isosurfaces form

More information

Week 8 Voronoi Diagrams

Week 8 Voronoi Diagrams 1 Week 8 Voronoi Diagrams 2 Voronoi Diagram Very important problem in Comp. Geo. Discussed back in 1850 by Dirichlet Published in a paper by Voronoi in 1908 3 Voronoi Diagram Fire observation towers: an

More information

Streaming Construction of Delaunay Triangulations

Streaming Construction of Delaunay Triangulations Streaming Construction of Delaunay Triangulations Jonathan Shewchuk University of California at Berkeley Joint work with Martin Isenburg, Yuanxin Liu, & Jack Snoeyink Streaming Construction of Delaunay

More information

Foundations of Multidimensional and Metric Data Structures

Foundations of Multidimensional and Metric Data Structures Foundations of Multidimensional and Metric Data Structures Hanan Samet University of Maryland, College Park ELSEVIER AMSTERDAM BOSTON HEIDELBERG LONDON NEW YORK OXFORD PARIS SAN DIEGO SAN FRANCISCO SINGAPORE

More information

Navigation and Metric Path Planning

Navigation and Metric Path Planning Navigation and Metric Path Planning October 4, 2011 Minerva tour guide robot (CMU): Gave tours in Smithsonian s National Museum of History Example of Minerva s occupancy map used for navigation Objectives

More information

Displacement Methods based on Field Analysis

Displacement Methods based on Field Analysis Displacement Methods based on Field Analysis Tinghua Ai Laboratory of Digital Mapping and Land Information Application Engineering Wuhan University, P. R. China aith@wuhan.cngb.com Peter van Oosterom Section

More information

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

Obtaining the H and T Honeycomb from a Cross-Section of the 16-cell Honeycomb Bridges 2017 Conference Proceedings Obtaining the H and T Honeycomb from a Cross-Section of the 16-cell Honeycomb Hideki Tsuiki Graduate School of Human and Environmental Studies, Kyoto University Yoshida-Nihonmatsu,

More information

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

Translating the Architectural Complexity of the Colon or Polyp into a Sinusoid Wave for Classification via the Fast Fourier Transform Translating the rchitectural omplexity of the olon or Polyp into a Sinusoid Wave for lassification via the Fast Fourier Transform David H. Nguyen, PhD Principal Investigator Tissue Spatial Geometrics Lab

More information

Constrained Delaunay Triangulations (CDT)

Constrained Delaunay Triangulations (CDT) Constrained Delaunay Triangulations (CDT) Recall: Definition 1 (Constrained triangulation). A triangulation with prespecified edges or breaklines between nodes. Motivation: Geological faults in oil recovery

More information

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

Lecture 6: GIS Spatial Analysis. GE 118: INTRODUCTION TO GIS Engr. Meriam M. Santillan Caraga State University Lecture 6: GIS Spatial Analysis GE 118: INTRODUCTION TO GIS Engr. Meriam M. Santillan Caraga State University 1 Spatial Data It can be most simply defined as information that describes the distribution

More information

Modeling Robot Path Planning with CD++

Modeling Robot Path Planning with CD++ Modeling Robot Path Planning with CD++ Gabriel Wainer Department of Systems and Computer Engineering. Carleton University. 1125 Colonel By Dr. Ottawa, Ontario, Canada. gwainer@sce.carleton.ca Abstract.

More information

Voronoi diagrams and applications

Voronoi diagrams and applications Voronoi diagrams and applications Prof. Ramin Zabih http://cs100r.cs.cornell.edu Administrivia Last quiz: Thursday 11/15 Prelim 3: Thursday 11/29 (last lecture) A6 is due Friday 11/30 (LDOC) Final projects

More information

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

Tessellations. Irena Swanson Reed College, Portland, Oregon. MathPath, Lewis & Clark College, Portland, Oregon, 24 July 2018 Tessellations Irena Swanson Reed College, Portland, Oregon MathPath, Lewis & Clark College, Portland, Oregon, 24 July 2018 What is a tessellation? A tiling or a tessellation of the plane is a covering

More information

Computational Geometry

Computational Geometry Lecture 12: Lecture 12: Motivation: Terrains by interpolation To build a model of the terrain surface, we can start with a number of sample points where we know the height. Lecture 12: Motivation: Terrains

More information

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

ECE276B: Planning & Learning in Robotics Lecture 5: Configuration Space ECE276B: Planning & Learning in Robotics Lecture 5: Configuration Space Lecturer: Nikolay Atanasov: natanasov@ucsd.edu Teaching Assistants: Tianyu Wang: tiw161@eng.ucsd.edu Yongxi Lu: yol070@eng.ucsd.edu

More information

Study on Delaunay Triangulation with the Islets Constraints

Study on Delaunay Triangulation with the Islets Constraints Intelligent Information Management, 2010, 2, 375-379 doi:10.4236/iim.2010.26045 Published Online June 2010 (http://www.scirp.org/journal/iim) Study on Delaunay Triangulation with the Islets Constraints

More information

CS 4620 Midterm 1. Tuesday 22 October minutes

CS 4620 Midterm 1. Tuesday 22 October minutes CS 4620 Midterm 1 Tuesday 22 October 2013 90 minutes Problem 1: Transformations (20 pts) Consider the affine transformation on R 3 defined in homogeneous coordinates by the matrix: 1 M = 1 0 0 2 0 1 0

More information

Quickstart for Web and Tablet App

Quickstart for Web and Tablet App Quickstart for Web and Tablet App What is GeoGebra? Dynamic Mathematic Software in one easy-to-use package For learning and teaching at all levels of education Joins interactive 2D and 3D geometry, algebra,

More information

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

Voronoi Diagrams. A Voronoi diagram records everything one would ever want to know about proximity to a set of points Voronoi Diagrams Voronoi Diagrams A Voronoi diagram records everything one would ever want to know about proximity to a set of points Who is closest to whom? Who is furthest? We will start with a series

More information

Using Semi-Regular 4 8 Meshes for Subdivision Surfaces

Using Semi-Regular 4 8 Meshes for Subdivision Surfaces Using Semi-Regular 8 Meshes for Subdivision Surfaces Luiz Velho IMPA Instituto de Matemática Pura e Aplicada Abstract. Semi-regular 8 meshes are refinable triangulated quadrangulations. They provide a

More information

Simple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements

Simple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements Simple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements Peter Fleischmann, Robert Kosik, Bernhard Haindl, and Siegfried Selberherr Institute for Microelectronics, TU Vienna, Gu6hausstrafie

More information

Practical Linear Algebra: A Geometry Toolbox

Practical Linear Algebra: A Geometry Toolbox Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 17: Breaking It Up: Triangles Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/pla

More information

What can we represent as a Surface?

What can we represent as a Surface? Geography 38/42:376 GIS II Topic 7: Surface Representation and Analysis (Chang: Chapters 13 & 15) DeMers: Chapter 10 What can we represent as a Surface? Surfaces can be used to represent: Continuously

More information

Visualization of cross sectional data for morphogenetic studies

Visualization of cross sectional data for morphogenetic studies Visualization of cross sectional data for morphogenetic studies G. Brunnett, M. Vančo, Ch. Haller, S. Washausen, H.-J. Kuhn, W. Knabe Abstract: We report on a visualization system that has been implemented

More information

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

CMSC 425: Lecture 9 Geometric Data Structures for Games: Geometric Graphs Thursday, Feb 21, 2013 CMSC 425: Lecture 9 Geometric Data Structures for Games: Geometric Graphs Thursday, Feb 21, 2013 Reading: Today s materials is presented in part in Computational Geometry: Algorithms and Applications (3rd

More information

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

High-Dimensional Computational Geometry. Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018 High-Dimensional Computational Geometry Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018 Outline 3-D vector geometry High-D hyperplane intersections Convex hull & its extension to 3

More information

Topological Issues in Hexahedral Meshing

Topological Issues in Hexahedral Meshing Topological Issues in Hexahedral Meshing David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science Outline I. What is meshing? Problem statement Types of mesh Quality issues

More information

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

Geometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Copyright 2010 Gotsman, Pauly Page 1 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies

More information

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

Contents of Lecture. Surface (Terrain) Data Models. Terrain Surface Representation. Sampling in Surface Model DEM Lecture 13: Advanced Data Models: Terrain mapping and Analysis Contents of Lecture Surface Data Models DEM GRID Model TIN Model Visibility Analysis Geography 373 Spring, 2006 Changjoo Kim 11/29/2006 1

More information

Chapter 7 Spatial Operation

Chapter 7 Spatial Operation 7.1 Introduction Chapter 7 Spatial Operation Q: What is spatial operation? A: Spatial operation is computational manipulation of spatial objects that deepen our understanding of spatial phenomena. In spatial

More information

Grid Computing Systems: A Survey and Taxonomy

Grid Computing Systems: A Survey and Taxonomy Grid Computing Systems: A Survey and Taxonomy Material for this lecture from: A Survey and Taxonomy of Resource Management Systems for Grid Computing Systems, K. Krauter, R. Buyya, M. Maheswaran, CS Technical

More information

A Voronoi-Based Hybrid Meshing Method

A Voronoi-Based Hybrid Meshing Method A Voronoi-Based Hybrid Meshing Method Jeanne Pellerin, Lévy Bruno, Guillaume Caumon To cite this version: Jeanne Pellerin, Lévy Bruno, Guillaume Caumon. A Voronoi-Based Hybrid Meshing Method. 2012. hal-00770939

More information

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

Correctness. The Powercrust Algorithm for Surface Reconstruction. Correctness. Correctness. Delaunay Triangulation. Tools - Voronoi Diagram Correctness The Powercrust Algorithm for Surface Reconstruction Nina Amenta Sunghee Choi Ravi Kolluri University of Texas at Austin Boundary of a solid Close to original surface Homeomorphic to original

More information

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

Physically-Based Modeling and Animation. University of Missouri at Columbia Overview of Geometric Modeling Overview 3D Shape Primitives: Points Vertices. Curves Lines, polylines, curves. Surfaces Triangle meshes, splines, subdivision surfaces, implicit surfaces, particles. Solids

More information

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem Chapter 8 Voronoi Diagrams 8.1 Post Oce Problem Suppose there are n post oces p 1,... p n in a city. Someone who is located at a position q within the city would like to know which post oce is closest

More information

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.

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. Common Core Standard: 8.G.3 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. Deyo Title: IM8 Ch. 6.2.1 What

More information

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

form_script.workshop Turing proposed the idea that two or more re- In today s project we are building on the repel Alan Turing, 1952, The Chemical Basis of Morphogenesis, phil. Trans R Soc B, 237 37-72 (transactions of the royal society) Turing proposed the idea that two or more re- acting chemicals in a diffusion

More information

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

Improving perception of intersecting 2D scalar fields. Mark Robinson Advisor: Dr. Kay Robbins Improving perception of intersecting 2D scalar fields Mark Robinson Advisor: Dr. Kay Robbins Outline of Presentation 1. Definition 2. 2D, 3D visualization techniques 3. Description of stratification 4.

More information

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

Scientific Computing WS 2018/2019. Lecture 12. Jürgen Fuhrmann Lecture 12 Slide 1 Scientific Computing WS 2018/2019 Lecture 12 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 12 Slide 1 Recap For more discussion of mesh generation, see J.R. Shewchuk: Lecture Notes on Delaunay

More information

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

A Smoothing Algorithm for the Dual Marching Tetrahedra Method. Sean Johnson A Smoothing Algorithm for the Dual Marching Tetrahedra Method by Sean Johnson A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science Approved November 2011 by the

More information

Introduction to Voronoi Diagrams and Delaunay Triangulations

Introduction to Voronoi Diagrams and Delaunay Triangulations Introduction to Voronoi Diagrams and Delaunay Triangulations Solomon Boulos Introduction to Voronoi Diagrams and Delaunay Triangulations p.1 Voronoi Diagrams Voronoi region: V (p i ) = {x R n p i x p j

More information

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

Multi-View Matching & Mesh Generation. Qixing Huang Feb. 13 th 2017 Multi-View Matching & Mesh Generation Qixing Huang Feb. 13 th 2017 Geometry Reconstruction Pipeline RANSAC --- facts Sampling Feature point detection [Gelfand et al. 05, Huang et al. 06] Correspondences

More information

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

Solid Modelling. Graphics Systems / Computer Graphics and Interfaces COLLEGE OF ENGINEERING UNIVERSITY OF PORTO Solid Modelling Graphics Systems / Computer Graphics and Interfaces 1 Solid Modelling In 2D, one set 2D line segments or curves does not necessarily form a closed area. In 3D, a collection of surfaces

More information

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

CPSC 695. Methods for interpolation and analysis of continuing surfaces in GIS Dr. M. Gavrilova CPSC 695 Methods for interpolation and analysis of continuing surfaces in GIS Dr. M. Gavrilova Overview Data sampling for continuous surfaces Interpolation methods Global interpolation Local interpolation

More information

Using High Performance Computing To Model Cellular Embryogenesis

Using High Performance Computing To Model Cellular Embryogenesis Using High Performance Computing To Model Cellular Embryogenesis Kison Osborne, Gerard Vanloo (Morehouse College) Mentors: Chung Ng (Morehouse College), Kwai Wong, Ben Ramsey (University of Tennessee),

More information

DATE PERIOD. Lesson Reading Guide

DATE PERIOD. Lesson Reading Guide NAME DATE PERIOD Lesson Reading Guide Get Ready for the Lesson Read the introduction at the top of page 316 in your textbook. Write your answers below. 1. Predict the number of triangles and the sum of

More information

PLC Papers Created For:

PLC Papers Created For: PLC Papers Created For: Year 10 Topic Practice Papers: Polygons Polygons 1 Grade 4 Look at the shapes below A B C Shape A, B and C are polygons Write down the mathematical name for each of the polygons

More information

CS S Lecture February 13, 2017

CS S Lecture February 13, 2017 CS 6301.008.18S Lecture February 13, 2017 Main topics are #Voronoi-diagrams, #Fortune. Quick Note about Planar Point Location Last week, I started giving a difficult analysis of the planar point location

More information

Quickstart for Desktop Version

Quickstart for Desktop Version Quickstart for Desktop Version What is GeoGebra? Dynamic Mathematics Software in one easy-to-use package For learning and teaching at all levels of education Joins interactive 2D and 3D geometry, algebra,

More information

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

Planning Techniques for Robotics Planning Representations: Skeletonization- and Grid-based Graphs 16-350 Planning Techniques for Robotics Planning Representations: Skeletonization- and Grid-based Graphs Maxim Likhachev Robotics Institute 2D Planning for Omnidirectional Point Robot Planning for omnidirectional

More information

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

EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation

More information