CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 1 CS691G Computational Geometry Ileana Streinu Oliver Brock Fall 2004.

Slides:



Advertisements
Similar presentations
TEL-AVIV UNIVERSITY FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES An Algorithm for the Computation of the Metric Average of Two Simple Polygons.
Advertisements

Proximity graphs: reconstruction of curves and surfaces
Computational Geometry II Brian Chen Rice University Computer Science.
3D Graphics Rendering and Terrain Modeling
The Voronoi Diagram David Johnson. Voronoi Diagram Creates a roadmap that maximizes clearance –Can be difficult to compute –We saw an approximation in.
Computational Geometry The systematic study of algorithms and data structures for geometric objects, with a focus on exact algorithms that are asymptotically.
Department of Geoinformation Science Technische Universität Berlin WS 2006/07 Geoinformation Technology: Voronoi Diagrams Alexandra Stadler Institute for.
By Groysman Maxim. Let S be a set of sites in the plane. Each point in the plane is influenced by each point of S. We would like to decompose the plane.
Discrete Geometry Tutorial 2 1
1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.
Spatial Information Systems (SIS)
Discrete geometry Lecture 2 1 © Alexander & Michael Bronstein
2. Voronoi Diagram 2.1 Definiton Given a finite set S of points in the plane , each point X of  defines a subset S X of S consisting of the points of.
CPSC 335 Geometric Data Structures in Computer Modeling and GIS Dr. Marina L. Gavrilova Assistant Professor Dept of Comp. Science, University of Calgary,
CENG 789 – Digital Geometry Processing 01- Introduction Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
GATE D Object Representations (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager SimBT.
By Dor Lahav. Overview Straight Skeletons Convex Polygons Constrained Voronoi diagrams and Delauney triangulations.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Chapter 5: Voronoi Diagrams Wednesday,
Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware Kenneth E. Hoff III, Tim Culver, John Keyser, Ming Lin, and Dinesh Manocha University.
Protein Primer. Outline n Protein representations n Structure of Proteins Structure of Proteins –Primary: amino acid sequence –Secondary:  -helices &
Computational Geometry Algorithms Library Source: CGAL web page
UNC Chapel Hill M. C. Lin Overview of Last Lecture About Final Course Project –presentation, demo, write-up More geometric data structures –Binary Space.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
Computational Geometry
Quadtrees and Mesh Generation Student Lecture in course MATH/CSC 870 Philipp Richter Thursday, April 19 th, 2007.
Applications of Computational Geometry COSC 2126 Computational Geometry.
Voronoi Diagram A Captivating Geometrical Construct Presented by: Lamour Roberts Preceptor: Dr. Bruno Guerrieri (Associate Professor of Mathematics) Department.
Molecular Surface Abstraction Greg Cipriano Advised by Michael Gleicher and George N. Phillips Jr.
UNC Chapel Hill M. C. Lin Point Location Chapter 6 of the Textbook –Review –Algorithm Analysis –Dealing with Degeneracies.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
1 Computer Graphics Week13 –Shading Models. Shading Models Flat Shading Model: In this technique, each surface is assumed to have one normal vector (usually.
Stony Brook University
Technology and Historical Overview. Introduction to 3d Computer Graphics  3D computer graphics is the science, study, and method of projecting a mathematical.
ADA: 14. Intro to CG1 Objective o give a non-technical overview of Computational geometry, concentrating on its main application areas Algorithm.
Voronoi diagrams and applications Prof. Ramin Zabih
Computational Geometry The systematic study of algorithms and data structures for geometric objects, with a focus on exact algorithms that are asymptotically.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
Analyzing the Simplicial Decomposition of Spatial Protein Structures Rafael Ördög, Zoltán Szabadka, Vince Grolmusz.
UNC Chapel Hill M. C. Lin COMP290-72: Computational Geometry and Applications Tues/Thurs 2:00pm - 3:15pm (SN 325) Ming C. Lin
TEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES An Algorithm for the Computation of the Metric.
Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
Voronoi Diagram (Supplemental)
112/5/ :54 Graphics II Image Based Rendering Session 11.
Computational Geometry The systematic study of algorithms and data structures for geometric objects, with a focus on exact algorithms that are asymptotically.
Computational Geometry Piyush Kumar (Lecture 1: Introduction) Welcome to CIS5930.
In the name of God Computer Graphics Bastanfard. Curve Function(2) Other method is approximate it using a poly-line. Just locate a set of points along.
3D Object Representations 2011, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Image-Based Rendering Geometry and light interaction may be difficult and expensive to model –Think of how hard radiosity is –Imagine the complexity of.
11/01/2010 Segmentation of SES for Protein Structure Analysis Virginio Cantoni, Riccardo Gatti, Luca Lombardi University of Pavia, dept. of Computer Engineering.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
COMPUTATIONAL GEOMETRY INTRODUCTION AND CONVEX HULLS ZAHRA NILFOROUSHAN ELECTRICAL & COMPUTER ENGINEERING DEPARTMENT, FACULTY OF ENGINEERING, KHARAZMI.
VORONOI DIAGRAMS BY KATHARINE TISCHER Coordinating Seminar Spring 2013.
Computational Geometry Piyush Kumar (Lecture 1: Introduction) Welcome to CIS5930.
Data Structure & Algorithm 13 – Computational Geometry JJCAO.
Research Overview III Jack Snoeyink UNC Chapel Hill.
Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/9/08
Bounding Volume Hierarchies and Spatial Partitioning
Kenneth E. Hoff III, Tim Culver, John Keyser,
Image Morphing © Zooface Many slides from Alexei Efros, Berkeley.
Bounding Volume Hierarchies and Spatial Partitioning
3D Graphics Rendering PPT By Ricardo Veguilla.
3D Object Representations
Predicting ligand binding sites on protein surface
Computational Geometry
Triangulation- 2D & 3D Sriram Sethuraman
Presentation transcript:

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 1 CS691G Computational Geometry Ileana Streinu Oliver Brock Fall 2004

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 2 Computational Geometry The study of algorithms for combinatorial, topological, and metric problems concerning sets of points, typically in Euclidean space. Representative areas of research include geometric search, convexity, proximity, intersection, and linear programming. Online Computing Dictionary

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 3 Discrete Geometry Packing Covering Tiling

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 4 Computational Geometry Previously: design and analysis of geometric algorithms Overlapping and merging with discrete geometry Now: study of geometrical problems from a computational point of view Handbook of Discrete and Computational Geometry

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 5 Goals Theoretical background –algorithms –data structures –analysis Practical experience –programming experience –CGAL –Cinderella

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 6 Administrative Things Prerequisites: mathematical maturity, exposure to: algorithms, complexity, programming Grade: homeworks (33%), in-class presentation (33%), final project (33%) Late Policy: get permission prior to due date Web Site (from my home page)

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 7 Connection to Applications Video Games Voronoi Diagrams Computer Graphics Folding

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 8 Video Games

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 9 What we saw… Walking through large model Collisions Dynamic simulation (Compare with automated movie generation)

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 10 What to look for… Algorithms Complexity Data structures Geometric primitives

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 11 Proximity Queries

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 12 Dynamic Simulation

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 13 Dynamic Simulation

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 14 Multi-Player Games

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 15 Multi-Player Games Some players might be computer generated (animations) Distributed state representation

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 16 Motion Planning

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 17 Kinetic Data Structures

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 18 The Post Office Problem Which is the closest post office to every house? (Don Knuth) Given n sites in the plane Subdivision of plane based on proximity Georgy Voronoi

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 19 Voronoi Diagram See Applet

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 20 Shape Recognition in Computer Vision

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 21 Uses for Voronoi Diagram Anthropology and Archeology -- Identify the parts of a region under the influence of different neolithic clans, chiefdoms, ceremonial centers, or hill forts. Astronomy -- Identify clusters of stars and clusters of galaxies (Here we saw what may be the earliest picture of a Voronoi diagram, drawn by Descartes in 1644, where the regions described the regions of gravitational influence of the sun and other stars.) Biology, Ecology, Forestry -- Model and analyze plant competition ("Area potentially available to a tree", "Plant polygons") Cartography -- Piece together satellite photographs into large "mosaic" maps Crystallography and Chemistry -- Study chemical properties of metallic sodium ("Wigner-Seitz regions"); Modelling alloy structures as sphere packings ("Domain of an atom") Finite Element Analysis -- Generating finite element meshes which avoid small angles Geography -- Analyzing patterns of urban settlements Geology -- Estimation of ore reserves in a deposit using information obtained from bore holes; modelling crack patterns in basalt due to contraction on cooling Geometric Modeling -- Finding "good" triangulations of 3D surfaces Marketing -- Model market of US metropolitan areas; market area extending down to individual retail stores Mathematics -- Study of positive definite quadratic forms ("Dirichlet tesselation", "Voronoi diagram") Metallurgy -- Modelling "grain growth" in metal films Meteorology -- Estimate regional rainfall averages, given data at discrete rain gauges ("Thiessen polygons") Pattern Recognition -- Find simple descriptors for shapes that extract 1D characterizations from 2D shapes ("Medial axis" or "skeleton" of a contour) Physiology -- Analysis of capillary distribution in cross-sections of muscle tissue to compute oxygen transport ("Capillary domains") Robotics -- Path planning in the presence of obstacles Statistics and Data Analysis -- Analyze statistical clustering ("Natural neighbors" interpolation) Zoology -- Model and analyze the territories of animals

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 22 Facts about Voronoi A site has an unbounded region if and only if it lies on the convex hull of all sites All Voronoi regions are convex Dual of Delaunay triangulation Questions: How fast can it be constructed? How many vertices does it have? What is the complexity of each cell?

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 23 Applications Graphics: –Realistic Rendering –Radiosity Computation –Morphing Computational Biology: –Molecular Visualization –Protein Folding –Ligand Docking Computer Vision: –Reconstructing a 3d model from images

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 24 Graphics: –Realistic Rendering –Radiosity Computation –Morphing Computational Biology: –Molecular Visualization –Protein Folding –Ligand Docking Computer Vision: –Reconstructing a 3d model from images Applications

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 25 Left: picture Right: computer rendering

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 26 Right: computer rendering

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 27

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 28

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 29 Graphics: –Realistic RenderingRealisticRendering –Radiosity Computation –Morphing Computational Biology: –Molecular Visualization –Protein Folding –Ligand Docking Computer Vision: –Reconstructing a 3d model from images Applications Graphics concepts: Light source Shadow, penumbra Occluder Culling Geometric keywords: Visibility edges/regions High-dimensional polytope

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 30 Graphics: –Realistic rendering –Radiosity ComputationRadiosity Computation –Morphing Computational Biology: –Molecular Visualization –Protein Folding –Ligand Docking Computer Vision: –Reconstructing a 3d model from images Applications Graphics concepts: Scene Radiosity Form factor Geometric keywords: Visibility edges/regions Visibility complex: high- dimensional topological space Duality point-line

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 31 Applications Graphics: –Realistic Rendering –Radiosity Computation –MorphingMorphing Computational Biology: –Molecular Visualization –Protein Folding –Ligand Docking Computer Vision: –Reconstructing a 3d model from images Video

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 32

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 33 Graphics: –Realistic Rendering –Radiosity Computation –Morphing Computational Biology: –Molecular VisualizationMolecular Visualization –Protein Folding –Ligand Docking Computer Vision: –Reconstructing a 3d model from images Applications Biology concepts: Atom, molecule, molecular surface Van der Waals radii Geometric keywords: Alpha-hull (convex hull) Topology of surface Dynamic changes

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 34

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 35 Graphics: –Realistic Rendering –Radiosity Computation –Morphing Computational Biology: –Molecular Visualization –Protein Structure Prediction and Protein Folding –Ligand Docking Computer Vision: –Reconstructing a 3d model from images Applications

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 36 Proteins on computers Where we see structure, shape, connections, regions The computer sees only coordinates For example, this PXR protein & ligand is in the Protein Data Bank as…

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 37 ATOM 2395 O HOH ATOM 2396 O HOH ATOM 2397 O HOH ATOM 2398 O HOH ATOM 2399 O HOH ATOM 2400 O HOH ATOM 2401 O HOH ATOM 2402 O HOH ATOM 2403 O HOH ATOM 2404 O HOH ATOM 2405 O HOH ATOM 2406 O HOH END 2380 lines later… REMARK Written by O version REMARK Sun Jan 21 15:24: CRYST ORIGX ORIGX ORIGX SCALE SCALE SCALE ATOM 1 C GLY ATOM 2 O GLY ATOM 3 N GLY ATOM 4 CA GLY ATOM 5 N LEU ATOM 6 CA LEU ATOM 7 CB LEU ATOM 8 CG LEU ATOM 9 CD1 LEU ATOM 10 CD2 LEU ATOM 11 C LEU ATOM 12 O LEU ATOM 13 N THR ATOM 14 CA THR

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 38 Protein ATOM 1 C GLY ATOM 2 O GLY ATOM 3 N GLY ATOM 4 CA GLY ATOM 5 N LEU ATOM 6 CA LEU ATOM 7 CB LEU ATOM 8 CG LEU ATOM 9 CD1 LEU ATOM 10 CD2 LEU Sequence Structure

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 39 Protein GLY LEU THR Sequence Structure a sentence written over a 20-letter alphabet Sequence: Structure: GLY LEU THR LEU GLY ….. Geometry = coordinates for all the atoms

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 40 Graphics: –Realistic Rendering –Radiosity Computation –Morphing Computational Biology: –Molecular Visualization –Protein Structure Prediction and Protein FoldingFolding –Ligand Docking Computer Vision: –Reconstructing a 3d model from images Applications

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 41 Protein Folding Predict: Structure from Sequence From Vijay Pande’s page at Stanford

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 42

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 43 Graphics: –Realistic Rendering –Radiosity Computation –Morphing Computational Biology: –Molecular Visualization –Protein Structure Prediction and Protein FoldingFolding –Ligand Docking Computer Vision: –Reconstructing a 3d model from images Applications Polygon folding : Creases Boundary of polygon matched with itself Origami (paper) folding Linkage (robot arm – protein backbone) folding

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 44 Graphics: –Realistic Rendering –Radiosity Computation –Morphing Computational Biology: –Molecular Visualization –Protein Structure Prediction and Protein Folding –Ligand Docking Computer Vision: –Reconstructing a 3d model from images Applications

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 45 Forma Urbis Romae

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 46 Protein docking 3-dim puzzle

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 47 Drug design Archaeology

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 48 Computational Geometry Basic objects: points, lines, line segments, polygons, polygonal lines, embedded graphs Computed objects: convex hull, alpha hull, triangulation, arrangement, Voronoi diagram, Delauney triangulation. Variations: static, dynamic (discrete changes), kinetic (continuous motion) Wanted: good algorithms

CS691G Computational Geometry – UMass Amherst – Ileana Streinu and Oliver Brock 49 More video clips SoCG’04: SoCG’ _multimedia/webproceedings/ _multimedia/webproceedings/