VoroCrust: Simultaneous Surface Reconstruction and Volume Meshing with Voronoi cells

Size: px
Start display at page:

Download "VoroCrust: Simultaneous Surface Reconstruction and Volume Meshing with Voronoi cells"

Transcription

1 VoroCrust: Simultaneous Surface Reconstruction and Volume Meshing with Voronoi cells Scott A. Mitchell (speaker), joint work with Ahmed H. Mahmoud, Ahmad A. Rushdi, Scott A. Mitchell, Ahmad Abdelkader Abdelrazek, Chandrajit L. Bajaj, John D. Owens, Mohamed S. Ebeida Polytopal Element Methods in Mathematics and Engineering Atlanta, Georgia 28 Oct 2015, 10:55-11:20am (25 minutes)

2 Summary VoroCrust is meshing for polytopal cells talk has no finite element content, just geometry Output Produces 3D Voronoi cells convex planar facets no sharp dihedral angles good aspect ratio Surface (boundary) mesh is reconstructed (naturally, without clipping, snapping or cleanup) by the boundary between inside and outside 3D cells planar convex 2D surface facets convex 3D cells adjacent to boundary not cells clipped by the boundary Open quality goals no small edges, no sharp edge angles, no small area faces... did other workshop talks describe what was needed in a mesh?

3 VoroCrust ALGORITHM OVERVIEW Sandia National Laboratories

4 VoroCrust Primal-Dual-Primal Dance Input: domain with boundary (3D algorithm, illustrated in 2D) Theory for smooth manifolds Practical rules for sharp features

5 Primal-Dual-Primal Dance Create well-spaced sample points Required properties Weighted Voronoi balls cover bdy Spheres have uncovered interior and exterior point: north and south poles Sufficient for uncovered poles local feature size lfs spacing and no ball center inside another ball

6 Primal-Dual-Primal Dance Spheres Intersect at two points = unweighted seeds pairs red = exterior blue = interior Ideal: both intersection points lie outside all other balls Want seeds sufficient to reconstruct surface surface mesh nodes are Voronoi vertices surface mesh edges are Voronoi edges surface mesh triangles are Voronoi facets

7 Primal-Dual-Primal Dance Build unweighted Voronoi diagram of seeds. Boundary between interior and exterior cells = surface mesh, it reconstructs surface Properties surface mesh nodes are Voronoi vertices surface mesh edges are Voronoi edges surface mesh triangles are Voronoi facets

8 Mesh Quality Enhancement Freedom: Additional seeds outside balls. Achieve aspect ratio bound. Additional goals: lattice points for a hex-dominant mesh

9 Enhancement Freedom: Additional seeds outside balls. Achieve aspect ratio bound. Additional goals: lattice points for a hex-dominant mesh

10 Examples

11 Examples Wall of Hampton Inn Atlanta, GA

12 Armadillo

13 hex-dominant mesh is trivial extention interior seeds = lattice points (centers of hexes) Armadillo

14 Dragon

15 Bunny size graded mesh

16 Built-in Robustness No parameterization, complicated topology? Easy, overlap and coverage tests are purely local, sphere radius Not water tight? Easy, sample spheres fill the gaps

17 Fertility

18 Theory Why does this work?

19 Intersections and Duality s2 p2 c12 e12 p1 s1 c23 s3 e23 G e13 p3 c13 p2 G p1 G p3 Intersection point pairs 2D: 2 circles two points 3D: 3 spheres two points Intersection points on Voronoi edge dual to triangle Three overlapping spheres = wdel triangle, negative circumradius

20 Intersections and Duality Multiple seeds on a sphere surface, none inside a sphere Sphere center is equidistant to all these seeds and none are closer = definition of a Voronoi vertex G G Surface mesh is set of Voronoi facets that happen to be triangles

21 Naïve Mirroring/Ghosting Placing seeds exactly on spheres is important Bad normals result from mirrored pairs without cospherical seeds around surface points.

22 Challenge half-covered guide pairs Problem One intersection point is covered, other is uncovered It happens for sliver tetrahedra (3D) four points nearly cocircular and coplanar Solution It s not that bad Consequences Extra surface vertex New triangles, interpolating a sliver tetrahedra Surface mesh still provably close to input manifold normals?

23 vs. Filtering Some reconstruction techniques select 2 triangles of sliver p2 p2 upper pair p4 3 f1 2 f23 4 p3 p4 3 f1 2 f134 p1 p3 p1 lower pair p2 p4 f123 f134 light = triangle seen from below dark = triangle seen from above p1 p3

24 Sliver Tetrahedra G4 234 G3 124 p2 G 234 G 124 s2 s1 f13 s3 s4 G 2 g 1 g 2 f34 p4 f14 f24 3 f2 n f 12 p3 G1 123 c34 G2 134 p1 G3 124 G 1 p2 G4 234 f34 f13 G 134 G 123 p1 f14 n f23 p4f24 f12 G1 123 G2 134 p3

25 Sliver Tetrahedra p3 G3 124 surface mesh = four green triangles p2 f 14 G1 123 n f24 G f1g f2 p4 p1 G3 124 p2 G4 234 f34 f13 p1 f14 n f23 p4f24 f12 G1 123 G2 134 p3

26 images courtesy Nina Amenta, power crust author Power crust VoroCrust vs. famous power crust algorithm [1998] 1000 Google Scholar citations (6 papers) Densely sample boundary. (Same lfs density. vs. need sample weights = balls covering boundary.) Far unweighted Voronoi vertices lie near medial axis. (vs. close points from weighted Voronoi edges near surface.) Both have sliver issues, but they re different issues. VoroCrust allows additional seeds and a well-shaped mesh. Use as weighted seeds. (vs. unweighted seeds) Select weighted Delaunay triangles for mesh and surface reconstruction. (vs. Voronoi cells)

27 Challenge Problem: Theory was for smooth manifolds What about sharp CAD models? Solution: Careful placement at sharp features, akin to Delaunay based methods

28 Sharp Features ideal is to share overlaps ignoring sharp features results in bad sphere overlaps small spheres can avoid overlaps

29 Conclusion VoroCrust Robust polyhedral meshing with true Voronoi cells has arrived ideal polytopal mesh with convex cells, planar facets no clipping good aspect ratio provable surface convergence Status paper nearly complete reimplementing production software Open mesh quality short edges, sharp edge angles, small area faces mesh quality needed for polytopal elements? seeds interior to the volume, want surface ones too? (bad surface normals in pathological cases?)

30 backup slides

31 Primal-Dual-Primal dance red: 58, 218, 75, 329, 53, 432, 74, 509.5, 204, 718, 268, 69 blue 122, 218, 105, 329, 129, 430, 112, 509, 203, 564, 269, 58 tweaked: red: 58, 218, 75, 329, 53, 432, 74, 509.5, 204, 718, 268, 699, blue: 122, 218, 105, 329, 129, 430, 112, 509, 203, 564, 269, 588

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

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

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

Computational Geometry

Computational Geometry Computational Geometry 600.658 Convexity A set S is convex if for any two points p, q S the line segment pq S. S p S q Not convex Convex? Convexity A set S is convex if it is the intersection of (possibly

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

Outline. Reconstruction of 3D Meshes from Point Clouds. Motivation. Problem Statement. Applications. Challenges

Outline. Reconstruction of 3D Meshes from Point Clouds. Motivation. Problem Statement. Applications. Challenges Reconstruction of 3D Meshes from Point Clouds Ming Zhang Patrick Min cs598b, Geometric Modeling for Computer Graphics Feb. 17, 2000 Outline - problem statement - motivation - applications - challenges

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

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

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

Surface Mesh Generation

Surface Mesh Generation Surface Mesh Generation J.-F. Remacle Université catholique de Louvain September 22, 2011 0 3D Model For the description of the mesh generation process, let us consider the CAD model of a propeller presented

More information

Estimating Geometry and Topology from Voronoi Diagrams

Estimating Geometry and Topology from Voronoi Diagrams Estimating Geometry and Topology from Voronoi Diagrams Tamal K. Dey The Ohio State University Tamal Dey OSU Chicago 07 p.1/44 Voronoi diagrams Tamal Dey OSU Chicago 07 p.2/44 Voronoi diagrams Tamal Dey

More information

Some Open Problems in Graph Theory and Computational Geometry

Some Open Problems in Graph Theory and Computational Geometry Some Open Problems in Graph Theory and Computational Geometry David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science ICS 269, January 25, 2002 Two Models of Algorithms Research

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 Medial Axis of the Union of Inner Voronoi Balls in the Plane

The Medial Axis of the Union of Inner Voronoi Balls in the Plane The Medial Axis of the Union of Inner Voronoi Balls in the Plane Joachim Giesen a, Balint Miklos b,, Mark Pauly b a Max-Planck Institut für Informatik, Saarbrücken, Germany b Applied Geometry Group, ETH

More information

be a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that

be a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that ( Shelling (Bruggesser-Mani 1971) and Ranking Let be a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that. a ranking of vertices

More information

A New Voronoi-Based Surface Reconstruction Algorithm

A New Voronoi-Based Surface Reconstruction Algorithm A New Voronoi-Based Surface Reconstruction Algorithm Nina Amenta UT - Austin Marshall Bern Xerox PARC Manolis Kamvysselis M.I.T. Abstract We describe our experience with a new algorithm for the reconstruction

More information

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter

More information

Dual Interpolants for Finite Element Methods

Dual Interpolants for Finite Element Methods Dual Interpolants for Finite Element Methods Andrew Gillette joint work with Chandrajit Bajaj and Alexander Rand Department of Mathematics Institute of Computational Engineering and Sciences University

More information

Other Voronoi/Delaunay Structures

Other Voronoi/Delaunay Structures Other Voronoi/Delaunay Structures Overview Alpha hulls (a subset of Delaunay graph) Extension of Voronoi Diagrams Convex Hull What is it good for? The bounding region of a point set Not so good for describing

More information

Quadrilateral Meshing by Circle Packing

Quadrilateral Meshing by Circle Packing Quadrilateral Meshing by Circle Packing Marshall Bern 1 David Eppstein 2 Abstract We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the

More information

Computational Geometry Exercise Duality

Computational Geometry Exercise Duality Computational Geometry Exercise Duality LEHRSTUHL FÜR ALGORITHMIK I INSTITUT FÜR THEORETISCHE INFORMATIK FAKULTÄT FÜR INFORMATIK Guido Brückner 20.07.2018 1 Duality Transforms We have seen duality for

More information

Geometric Modeling in Graphics

Geometric Modeling in Graphics Geometric Modeling in Graphics Part 10: Surface reconstruction Martin Samuelčík www.sccg.sk/~samuelcik samuelcik@sccg.sk Curve, surface reconstruction Finding compact connected orientable 2-manifold surface

More information

Conforming Vector Interpolation Functions for Polyhedral Meshes

Conforming Vector Interpolation Functions for Polyhedral Meshes Conforming Vector Interpolation Functions for Polyhedral Meshes Andrew Gillette joint work with Chandrajit Bajaj and Alexander Rand Department of Mathematics Institute of Computational Engineering and

More information

An Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems

An Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems An Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems Long Chen University of California, Irvine chenlong@math.uci.edu Joint work with: Huayi Wei (Xiangtan University),

More information

Reporting Mesh Statistics

Reporting Mesh Statistics Chapter 15. Reporting Mesh Statistics The quality of a mesh is determined more effectively by looking at various statistics, such as maximum skewness, rather than just performing a visual inspection. Unlike

More information

The Ball-Pivoting Algorithm for Surface Reconstruction

The Ball-Pivoting Algorithm for Surface Reconstruction The Ball-Pivoting Algorithm for Surface Reconstruction 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

Medial Scaffolds for 3D data modelling: status and challenges. Frederic Fol Leymarie

Medial Scaffolds for 3D data modelling: status and challenges. Frederic Fol Leymarie Medial Scaffolds for 3D data modelling: status and challenges Frederic Fol Leymarie Outline Background Method and some algorithmic details Applications Shape representation: From the Medial Axis to the

More information

Möbius Transformations in Scientific Computing. David Eppstein

Möbius Transformations in Scientific Computing. David Eppstein Möbius Transformations in Scientific Computing David Eppstein Univ. of California, Irvine School of Information and Computer Science (including joint work with Marshall Bern from WADS 01 and SODA 03) Outline

More information

Shrinkwrap developments for computational electromagnetics in ICE NITe

Shrinkwrap developments for computational electromagnetics in ICE NITe Shrinkwrap developments for computational electromagnetics in ICE NITe Preparing CAD models for electromagnetic analysis remains a complex, time consuming process. Typically, the CAD model will contain

More information

COMPUTATIONAL GEOMETRY

COMPUTATIONAL GEOMETRY Thursday, September 20, 2007 (Ming C. Lin) Review on Computational Geometry & Collision Detection for Convex Polytopes COMPUTATIONAL GEOMETRY (Refer to O'Rourke's and Dutch textbook ) 1. Extreme Points

More information

Computational Geometry. Definition, Application Areas, and Course Overview

Computational Geometry. Definition, Application Areas, and Course Overview Computational Geometry Definition, Application Areas, and Course Overview Computational Geometry is a subfield of the Design and Analysis of Algorithms Computational Geometry is a subfield of the Design

More information

Optimizing triangular meshes to have the incrircle packing property

Optimizing triangular meshes to have the incrircle packing property Packing Circles and Spheres on Surfaces Ali Mahdavi-Amiri Introduction Optimizing triangular meshes to have p g g the incrircle packing property Our Motivation PYXIS project Geometry Nature Geometry Isoperimetry

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

Approximating Polygonal Objects by Deformable Smooth Surfaces

Approximating Polygonal Objects by Deformable Smooth Surfaces Approximating Polygonal Objects by Deformable Smooth Surfaces Ho-lun Cheng and Tony Tan School of Computing, National University of Singapore hcheng,tantony@comp.nus.edu.sg Abstract. We propose a method

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

Skeleton Based Solid Representation with Topology Preservation

Skeleton Based Solid Representation with Topology Preservation Skeleton Based Solid Representation with Topology Preservation Ariel Shamir The Interdisciplinary Center Shaham Amir Tel-Aviv University Corresponding author: Dr. Ariel Shamir Efi Arazi School of Computer

More information

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. Solid geometry We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. First, note that everything we have proven for the

More information

Mesh Generation. Jean-Daniel Boissonnat DataShape, INRIA

Mesh Generation. Jean-Daniel Boissonnat DataShape, INRIA Mesh Generation Jean-Daniel Boissonnat DataShape, INRIA http://www-sop.inria.fr/datashape Algorithmic Geometry Mesh generation J-D. Boissonnat 1 / 27 Meshing surfaces and 3D domains visualization and graphics

More information

version 8.5 release notes

version 8.5 release notes version 8.5 release notes build #9647 form Z pro v8.5 introduces a new suite of creative design tools to enhance form generation. These tools offer a variety of ways to create new and interesting forms

More information

GEOMETRY MODELING & GRID GENERATION

GEOMETRY MODELING & GRID GENERATION GEOMETRY MODELING & GRID GENERATION Dr.D.Prakash Senior Assistant Professor School of Mechanical Engineering SASTRA University, Thanjavur OBJECTIVE The objectives of this discussion are to relate experiences

More information

Advanced geometry tools for CEM

Advanced geometry tools for CEM Advanced geometry tools for CEM Introduction Modern aircraft designs are extremely complex CAD models. For example, a BAE Systems aircraft assembly consists of over 30,000 individual components. Since

More information

Introduction to ANSYS ICEM CFD

Introduction to ANSYS ICEM CFD Lecture 4 Volume Meshing 14. 0 Release Introduction to ANSYS ICEM CFD 1 2011 ANSYS, Inc. March 21, 2012 Introduction to Volume Meshing To automatically create 3D elements to fill volumetric domain Generally

More information

Hexahedral Mesh Generation for Volumetric Image Data

Hexahedral Mesh Generation for Volumetric Image Data Hexahedral Mesh Generation for Volumetric Image Data Jason Shepherd University of Utah March 27, 2006 Outline Hexahedral Constraints Topology Boundary Quality Zhang et al. papers Smoothing/Quality Existing

More information

A Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud

A Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud International Journal of Computer Systems (ISSN: 2394-1065), Volume 03 Issue 02, February, 2016 Available at http://www.ijcsonline.com/ A Constrained Delaunay Triangle Mesh Method for Three-Dimensional

More information

Flavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville

Flavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville Flavor of Computational Geometry Convex Hull in 2D Shireen Y. Elhabian Aly A. Farag University of Louisville February 2010 Agenda Introduction Definitions of Convexity and Convex Hulls Naïve Algorithms

More information

Provably Good Moving Least Squares

Provably Good Moving Least Squares Provably Good Moving Least Squares Ravikrishna Kolluri Computer Science Division University of California at Berkeley 1 Problem Definition Given a set of samples on a closed surface build a representation

More information

Survey of Surface Reconstruction Algorithms

Survey of Surface Reconstruction Algorithms Journal of Signal and Information Processing, 2014, 5, 63-79 Published Online August 2014 in SciRes. http://www.scirp.org/journal/jsip http://dx.doi.org/10.4236/jsip.2014.53009 Survey of Surface Reconstruction

More information

arxiv:cs/ v1 [cs.cg] 19 Aug 1999

arxiv:cs/ v1 [cs.cg] 19 Aug 1999 Quadrilateral Meshing by Circle Packing Marshall Bern David Eppstein arxiv:cs/9908016v1 [cs.cg] 19 Aug 1999 Abstract We use circle-packing methods to generate quadrilateral meshes for polygonal domains,

More information

Convex Hulls (3D) O Rourke, Chapter 4

Convex Hulls (3D) O Rourke, Chapter 4 Convex Hulls (3D) O Rourke, Chapter 4 Outline Polyhedra Polytopes Euler Characteristic (Oriented) Mesh Representation Polyhedra Definition: A polyhedron is a solid region in 3D space whose boundary is

More information

Triangle meshes I. CS 4620 Lecture 2

Triangle meshes I. CS 4620 Lecture 2 Triangle meshes I CS 4620 Lecture 2 2014 Steve Marschner 1 spheres Andrzej Barabasz approximate sphere Rineau & Yvinec CGAL manual 2014 Steve Marschner 2 finite element analysis PATRIOT Engineering 2014

More information

Discrete geometry. Lecture 2. Alexander & Michael Bronstein tosca.cs.technion.ac.il/book

Discrete geometry. Lecture 2. Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Discrete geometry Lecture 2 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 The world is continuous, but the mind is discrete

More information

A qualitative approach for medial computation

A qualitative approach for medial computation A qualitative approach for medial computation Jacklin Michael 1 Dr. M. Ramanathan 2 Prof. S. Vinothkumar 3 Dept. of Computer Science Dept. of Engineering Design Dept. of Computer Science SNS College of

More information

Dynamic Mesh Refinement

Dynamic Mesh Refinement Dynamic Mesh Refinement Benoît Hudson Joint work with Umut A. Acar, Gary Miller, Todd Phillips Why Mesh? Geometry is continuous Computers are discrete Graphics Scientific Computing Vision, AI,... Mesh

More information

Alex Li 11/20/2009. Chris Wojtan, Nils Thurey, Markus Gross, Greg Turk

Alex Li 11/20/2009. Chris Wojtan, Nils Thurey, Markus Gross, Greg Turk Alex Li 11/20/2009 Chris Wojtan, Nils Thurey, Markus Gross, Greg Turk duction Overview of Lagrangian of Topological s Altering the Topology 2 Presents a method for accurately tracking the moving surface

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

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

Simplicial Hyperbolic Surfaces

Simplicial Hyperbolic Surfaces Simplicial Hyperbolic Surfaces Talk by Ken Bromberg August 21, 2007 1-Lipschitz Surfaces- In this lecture we will discuss geometrically meaningful ways of mapping a surface S into a hyperbolic manifold

More information

Two Connections between Combinatorial and Differential Geometry

Two Connections between Combinatorial and Differential Geometry Two Connections between Combinatorial and Differential Geometry John M. Sullivan Institut für Mathematik, Technische Universität Berlin Berlin Mathematical School DFG Research Group Polyhedral Surfaces

More information

Lecture 16: Voronoi Diagrams and Fortune s Algorithm

Lecture 16: Voronoi Diagrams and Fortune s Algorithm contains q changes as a result of the ith insertion. Let P i denote this probability (where the probability is taken over random insertion orders, irrespective of the choice of q). Since q could fall through

More information

Surface reconstruction based on a dynamical system

Surface reconstruction based on a dynamical system EUROGRAPHICS 2002 / G. Drettakis and H.-P. Seidel (Guest Editors) Volume 21 (2002), Number 3 Surface reconstruction based on a dynamical system N.N. Abstract We present an efficient algorithm that computes

More information

Triangle meshes I. CS 4620 Lecture Steve Marschner. Cornell CS4620 Spring 2017

Triangle meshes I. CS 4620 Lecture Steve Marschner. Cornell CS4620 Spring 2017 Triangle meshes I CS 4620 Lecture 2 2017 Steve Marschner 1 spheres Andrzej Barabasz approximate sphere Rineau & Yvinec CGAL manual 2017 Steve Marschner 2 finite element analysis PATRIOT Engineering 2017

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

A THINNING ALGORITHM FOR TOPOLOGICALLY CORRECT 3D SURFACE RECONSTRUCTION

A THINNING ALGORITHM FOR TOPOLOGICALLY CORRECT 3D SURFACE RECONSTRUCTION A THINNING ALGORITHM FOR TOPOLOGICALLY CORRECT 3D SURFACE RECONSTRUCTION Leonid Tcherniavski Department of Informatics University of Hamburg tcherniavski@informatik.uni-hamburg.de ABSTRACT The existing

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

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

Section 8.3: Examining and Repairing the Input Geometry. Section 8.5: Examining the Cartesian Grid for Leakages

Section 8.3: Examining and Repairing the Input Geometry. Section 8.5: Examining the Cartesian Grid for Leakages Chapter 8. Wrapping Boundaries TGrid allows you to create a good quality boundary mesh using a bad quality surface mesh as input. This can be done using the wrapper utility in TGrid. The following sections

More information

274 Curves on Surfaces, Lecture 5

274 Curves on Surfaces, Lecture 5 274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,

More information

Glossary of dictionary terms in the AP geometry units

Glossary of dictionary terms in the AP geometry units Glossary of dictionary terms in the AP geometry units affine linear equation: an equation in which both sides are sums of terms that are either a number times y or a number times x or just a number [SlL2-D5]

More information

Rigid Ball-Polyhedra in Euclidean 3-Space

Rigid Ball-Polyhedra in Euclidean 3-Space Discrete Comput Geom (2013) 49:189 199 DOI 10.1007/s00454-012-9480-y Rigid Ball-Polyhedra in Euclidean 3-Space Károly Bezdek Márton Naszódi Received: 15 September 2011 / Revised: 30 September 2012 / Accepted:

More information

Ansoft HFSS Mesh Menu

Ansoft HFSS Mesh Menu Ansoft HFSS After you have seeded your object, you must create the finite element mesh from which the variables and values of your model will be computed. The Mesh menu allows you to: Create or delete

More information

ACTUALLY DOING IT : an Introduction to Polyhedral Computation

ACTUALLY DOING IT : an Introduction to Polyhedral Computation ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2

More information

Mesh Generation through Delaunay Refinement

Mesh Generation through Delaunay Refinement Mesh Generation through Delaunay Refinement 3D Meshes Mariette Yvinec MPRI 2009-2010, C2-14-1, Lecture 4b ENSL Winter School, january 2010 Input : C : a 2D PLC in R 3 (piecewise linear complex) Ω : a bounded

More information

The Quality Of 3D Models

The Quality Of 3D Models The Quality Of 3D Models Problems and Solutions for Applications Post-Design Fathi El-Yafi Senior Product Engineer Product Department of EXA Corporation 1 : Overview Status Problems Identified Defect Sources

More information

: Mesh Processing. Chapter 8

: Mesh Processing. Chapter 8 600.657: Mesh Processing Chapter 8 Handling Mesh Degeneracies [Botsch et al., Polygon Mesh Processing] Class of Approaches Geometric: Preserve the mesh where it s good. Volumetric: Can guarantee no self-intersection.

More information

3D Hyperbolic Tiling and Horosphere Cross Section

3D Hyperbolic Tiling and Horosphere Cross Section 3D Hyperbolic Tiling and Horosphere Cross Section Vladimir Bulatov, Shapeways Joint AMS/MAA meeting San Diego, January 10, 2018 Inversive Geometry Convenient container to work with 3 dimensional hyperbolic

More information

1 Automatic Mesh Generation

1 Automatic Mesh Generation 1 AUTOMATIC MESH GENERATION 1 1 Automatic Mesh Generation 1.1 Mesh Definition Mesh M is a discrete representation of geometric model in terms of its geometry G, topology T, and associated attributes A.

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

Natural Inclusion of Boundary Points in a Mesh

Natural Inclusion of Boundary Points in a Mesh http://people.sc.fsu.edu/ jburkardt/presentations/ new orleans 2005.pdf... John 1 Max Gunzburger 2 Hoa Nguyen 2 Yuki Saka 2 1 School of Computational Science Florida State University 2 Department of Mathematics

More information

Convex Hulls in Three Dimensions. Polyhedra

Convex Hulls in Three Dimensions. Polyhedra Convex Hulls in Three Dimensions Polyhedra Polyhedron 1.A polyhedron is the generalization of a 2- D polygon to 3-D A finite number of flat polygonal faces The boundary or surface of a polyhedron - Zero-dimensional

More information

ERC Expressive Seminar

ERC Expressive Seminar ERC Expressive Seminar March 7th - 2013 Models and Intuitive Modeling Loïc Barthe VORTEX group IRIT Université de Toulouse Plan Context and introduction Intuitive modeling Modeling with meshes only Other

More information

DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU /858B Fall 2017

DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU /858B Fall 2017 DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU 15-458/858B Fall 2017 LECTURE 2: THE SIMPLICIAL COMPLEX DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU

More information

Three-Dimensional α Shapes

Three-Dimensional α Shapes Herbert Edelsbrunner and Ernst P. Mücke ACM Tran. Graph. 13(1), 1994 20 September 2005 1 2 α-complexes Edelsbrunner s Algorithm 3 Properties Surface Reconstruction Shape Question Given a set of points,

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

Collision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering

Collision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering RBE 550 MOTION PLANNING BASED ON DR. DMITRY BERENSON S RBE 550 Collision Detection Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Euler Angle RBE

More information

Lecture 7: Mesh Quality & Advanced Topics. Introduction to ANSYS Meshing Release ANSYS, Inc. February 12, 2015

Lecture 7: Mesh Quality & Advanced Topics. Introduction to ANSYS Meshing Release ANSYS, Inc. February 12, 2015 Lecture 7: Mesh Quality & Advanced Topics 15.0 Release Introduction to ANSYS Meshing 1 2015 ANSYS, Inc. February 12, 2015 Overview In this lecture we will learn: Impact of the Mesh Quality on the Solution

More information

66 III Complexes. R p (r) }.

66 III Complexes. R p (r) }. 66 III Complexes III.4 Alpha Complexes In this section, we use a radius constraint to introduce a family of subcomplexes of the Delaunay complex. These complexes are similar to the Čech complexes but differ

More information

A Flavor of Topology. Shireen Elhabian and Aly A. Farag University of Louisville January 2010

A Flavor of Topology. Shireen Elhabian and Aly A. Farag University of Louisville January 2010 A Flavor of Topology Shireen Elhabian and Aly A. Farag University of Louisville January 2010 In 1670 s I believe that we need another analysis properly geometric or linear, which treats place directly

More information

03 - Reconstruction. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Spring 17 - Daniele Panozzo

03 - Reconstruction. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Spring 17 - Daniele Panozzo 3 - Reconstruction Acknowledgements: Olga Sorkine-Hornung Geometry Acquisition Pipeline Scanning: results in range images Registration: bring all range images to one coordinate system Stitching/ reconstruction:

More information

Computing 3D Geometry Directly From Range Images

Computing 3D Geometry Directly From Range Images Computing 3D Geometry Directly From Range Images Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories Geometry from Range Data A Classic Approach Subject Range images Range surfaces

More information

CS133 Computational Geometry

CS133 Computational Geometry CS133 Computational Geometry Voronoi Diagram Delaunay Triangulation 5/17/2018 1 Nearest Neighbor Problem Given a set of points P and a query point q, find the closest point p P to q p, r P, dist p, q dist(r,

More information

Hexahedral Meshing of Non-Linear Volumes Using Voronoi Faces and Edges

Hexahedral Meshing of Non-Linear Volumes Using Voronoi Faces and Edges Hexahedral Meshing of Non-Linear Volumes Using Voronoi Faces and Edges Alla Sheffer and Michel Bercovier Institute of Computer Science, The Hebrew University, Jerusalem 91904, Israel. sheffa berco @cs.huji.ac.il.

More information

Final Project, Digital Geometry Processing

Final Project, Digital Geometry Processing Final Project, Digital Geometry Processing Shayan Hoshyari Student #: 81382153 December 2016 Introduction In this project an adaptive surface remesher has been developed based on the paper [1]. An algorithm

More information

Surface Reconstruction with MLS

Surface Reconstruction with MLS Surface Reconstruction with MLS Tobias Martin CS7960, Spring 2006, Feb 23 Literature An Adaptive MLS Surface for Reconstruction with Guarantees, T. K. Dey and J. Sun A Sampling Theorem for MLS Surfaces,

More information

CS 468 (Spring 2013) Discrete Differential Geometry

CS 468 (Spring 2013) Discrete Differential Geometry CS 468 (Spring 2013) Discrete Differential Geometry 1 Math Review Lecture 14 15 May 2013 Discrete Exterior Calculus Lecturer: Justin Solomon Scribe: Cassidy Saenz Before we dive into Discrete Exterior

More information

Deforming meshes that split and merge

Deforming meshes that split and merge Deforming meshes that split and merge Chris Wojtan Nils Th urey Markus Gross Greg Turk Chris Wojtan, Nils Thurey, Markus Gross, Greg Turk Introduction ž Presents a method for accurately tracking the moving

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

Voronoi diagram and Delaunay triangulation

Voronoi diagram and Delaunay triangulation Voronoi diagram and Delaunay triangulation Ioannis Emiris & Vissarion Fisikopoulos Dept. of Informatics & Telecommunications, University of Athens Computational Geometry, spring 2015 Outline 1 Voronoi

More information

MATERIAL FOR A MASTERCLASS ON HYPERBOLIC GEOMETRY. Timeline. 10 minutes Exercise session: Introducing curved spaces

MATERIAL FOR A MASTERCLASS ON HYPERBOLIC GEOMETRY. Timeline. 10 minutes Exercise session: Introducing curved spaces MATERIAL FOR A MASTERCLASS ON HYPERBOLIC GEOMETRY Timeline 10 minutes Introduction and History 10 minutes Exercise session: Introducing curved spaces 5 minutes Talk: spherical lines and polygons 15 minutes

More information

Hyperbolic Structures from Ideal Triangulations

Hyperbolic Structures from Ideal Triangulations Hyperbolic Structures from Ideal Triangulations Craig Hodgson University of Melbourne Geometric structures on 3-manifolds Thurston s idea: We would like to find geometric structures (or metrics) on 3-manifolds

More information

Voronoi Diagrams, Delaunay Triangulations and Polytopes

Voronoi Diagrams, Delaunay Triangulations and Polytopes Voronoi Diagrams, Delaunay Triangulations and Polytopes Jean-Daniel Boissonnat MPRI, Lecture 2 Computational Geometry Learning Voronoi, Delaunay & Polytopes MPRI, Lecture 2 1 / 43 Voronoi diagrams in nature

More information