Time - Space Sandra Bies Marc van Kreveld maps from triangulations.

Slides:



Advertisements
Similar presentations
November 20GEOINFO 20061/25 A Robust Strategy for Handling Linear Features in Topologically Consistent Polyline Simplification Department of Computer Engineering.
Advertisements

Domain of Applicability A Cluster-Based Measure of Domain of Applicability of a QSAR Model Robert Stanforth 6 September 2005.
Machine Learning for Vision-Based Motion Analysis Learning pullback metrics for linear models Oxford Brookes Vision Group Oxford Brookes University 17/10/2008.
Data Visualization Lecture 4 Two Dimensional Scalar Visualization
Generating Realistic Terrains with Higher-Order Delaunay Triangulations Thierry de Kok Marc van Kreveld Maarten Löffler Center for Geometry, Imaging and.
Higher-Order Delaunay Triangulations
Changing Rational Numbers from decimals to fractions/fractions to decimals and least to greatest notes Absent copy Tues/Wed 11/19,20.
Delaunay Triangulation and Tetrahedrilization
Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
Getting A Speeding Ticket. Mesh Generation 2D Point Set Delaunay Triangulation 3D Point Set Delaunay Tetrahedralization.
Parallel Algorithms in Computational Geometry
Voronoi Diagrams in n· 2 O(√lglg n ) Time Timothy M. ChanMihai Pătraşcu STOC’07.
C o m p u t i n g C O N V E X H U L L S by Kok Lim Low 10 Nov 1998 COMP Presentation.
Morphing CSE 590 Computational Photography Tamara Berg.
Ruslana Mys Delaunay Triangulation Delaunay Triangulation (DT)  Introduction  Delaunay-Voronoi based method  Algorithms to compute the convex hull 
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.
09/25/02 Dinesh Manocha, COMP258 Triangular Bezier Patches Natural generalization to Bezier curves Triangles are a simplex: Any polygon can be decomposed.
CSCE 620: Open Problem Voronoi Diagram of Moving Points Asish Ghoshal Problem 2 from The Open Problems Project 1.
A Bezier Based Approach to Unstructured Moving Meshes ALADDIN and Sangria Gary Miller David Cardoze Todd Phillips Noel Walkington Mark Olah Miklos Bergou.
1cs542g-term Notes. 2 Meshing goals  Robust: doesn’t fail on reasonable geometry  Efficient: as few triangles as possible Easy to refine later.
Delaunay Triangulation Computational Geometry, WS 2006/07 Lecture 11 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
We propose a successive convex matching method to detect actions in videos. The proposed scheme does not need foreground/background separation, works in.
CENG 789 – Digital Geometry Processing 05- Smoothing and Remeshing
Lecture 10 : Delaunay Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Overview Motivation. Triangulation of Planar Point Sets. Definition.
GIS projects 2012 Marc van Kreveld. Two phases Problem analysis (phase 1  report 1) –Literature study, reverse engineering –Statement of criteria –Dependency.
Image Morphing : Rendering and Image Processing Alexei Efros.
1 Mesh Generation and Delaunay-Based Meshes Jernej Barbic Computer Science Department Carnegie Mellon University.
Image Morphing : Computational Photography Alexei Efros, CMU, Fall 2005 © Alexey Tikhonov.
Computing the Delaunay Triangulation By Nacha Chavez Math 870 Computational Geometry; Ch.9; de Berg, van Kreveld, Overmars, Schwarzkopf By Nacha Chavez.
Image Morphing, Triangulation CSE399b, Spring 07 Computer Vision.
Part Two Multiresolution Analysis of Arbitrary Meshes M. Eck, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, W. Stuetzle SIGGRAPH 95.
1 Dr. Scott Schaefer Generalized Barycentric Coordinates.
Image Morphing, Thin-Plate Spline Model CSE399b, Spring 07 Computer Vision
Week 13 - Wednesday CS361.
Image Morphing CSC320: Introduction to Visual Computing
1 Dr. Scott Schaefer Generalized Barycentric Coordinates.
PRE-TRIANGULATIONS Generalized Delaunay Triangulations and Flips Franz Aurenhammer Institute for Theoretical Computer Science Graz University of Technology,
Collision handling: detection and response
C o m p u t i n g C O N V E X H U L L S. Presentation Outline 2D Convex Hulls –Definitions and Properties –Approaches: Brute Force Gift Wrapping QuickHull.
Computational Photography Derek Hoiem, University of Illinois
3D Game Engine Design 1 3D Game Engine Design Ch D MAP LAB.
Generating Realistic Terrains with Higher-Order Delaunay Triangulations Thierry de Kok Marc van Kreveld Maarten Löffler Center for Geometry, Imaging and.
CS558 Project Local SVM Classification based on triangulation (on the plane) Glenn Fung.
A New Voronoi-based Reconstruction Algorithm
L8 - Delaunay triangulation L8 – Delaunay triangulation NGEN06(TEK230) – Algorithms in Geographical Information Systems.
Image Morphing Computational Photography Derek Hoiem, University of Illinois 9/29/15 Many slides from Alyosha Efros.
1 11. Polygons Polygons 2D polygons ( 다각형 ) –Polygon sides are all straight lines lying in the same plane 3D polyhedra ( 다면체 )  chap. 12 –Polyhedra.
Efficient Motion Updates for Delaunay Triangulations Daniel Russel Leonidas Guibas.
UNC Chapel Hill M. C. Lin Delaunay Triangulations Reading: Chapter 9 of the Textbook Driving Applications –Height Interpolation –Constrained Triangulation.
Polygon Definition Bounded by a closed circuit of straight-line segment. Term Edge : straight line segment Vertices : points.
Image Warping and Morphing : Computational Photography Alexei Efros, CMU, Fall 2011 © Alexey Tikhonov.
Spring 2014 CS274: Automatic Rigging
1 Point Location Strategies Idit Haran
Multimedia Programming 10: Image Morphing
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Algorithmic Aspects of Proportional Symbol Maps Sergio Cabello Herman Haverkort Marc van Kreveld Bettina Speckmann IMFM Ljubljana TU Eindhoven Utrecht.
Digital Elevation Models (DEMs)Constructing Grid DEMConstructing Contour Map Constructing TIN DEM Grid DEM Quality Metric A Digital Elevation Model (DEM)
Opportunities in Map-Making Alan Saalfeld. April 20-22, 2007Computational and Conformal Geometry2 Cartographers can make maps that: Preserve all angles.

Visualization Fundamentals
NEW SOLUTION FOR CONSTRUCTION OF RECTILINEAR AREA CARTOGRAM
Image Morphing © Zooface Many slides from Alexei Efros, Berkeley.
Computational Photography Derek Hoiem, University of Illinois
Grids Geometry Computational Geometry
Grids Geometry Computational Geometry
Exterior Angles.
World Cultural Geography
Grids Geometry Computational Geometry
Real-time Skeletal Skinning with Optimized Centers of Rotation
Areas by "Triangle Boxing"
Presentation transcript:

Time - Space Sandra Bies Marc van Kreveld maps from triangulations

Showing travel times between places in a country by train

50 km

60 min From Amsterdam: Rotterdam: 63 min.; s-Hertogenbosch: 59 min.; Arnhem: 70 min.

Can we deform the map so that any time-contour from Amsterdam becomes a circle?

The idea of using triangulations Triangulations to define map deformations (Saalfeld, SoCG 1987) Triangulations for contiguous-area cartograms (Edelsbrunner and Waupotitsch, SoCG 1995) Spring embedder: Kocmoud and House, 1998

everything inside a triangle moves according to a linear interpolation of the movement of the vertices Barycentric coordinates

Triangulations for Time-Space Maps Question 1: Can we extend the deformation naturally outside the convex hull of the point set?

Triangulations for Time-Space Maps Question 1: Can we extend the deformation naturally outside the convex hull of the point set? Yes, we can make a bounding box with vertices that are stationary. The deformation dies out towards the outside.

Triangulations for Time-Space Maps Question 2: Is there a triangulation that is good for the original point set and the moved point set?

Triangulations for Time-Space Maps Question 2: Is there a triangulation that is good for the original point set and the moved point set? Yes, we can use a radial triangulation. No moving point will cause a triangle to collapse.

Triangulations for Time-Space Maps Question 2: Is there a triangulation that is good for the original point set and the moved point set? Yes, we can use a radial triangulation. No moving point will cause a triangle to collapse.

Triangulations for Time-Space Maps Question 3: Does this give a nice deformation?

Triangulations for Time-Space Maps Question 3: Does this give a nice deformation? No, it has many artifacts. Static radial

Triangulations for Time-Space Maps Question 4: Is there a different triangulation that does not have collapses and gives a nice deformation?

Triangulations for Time-Space Maps Question 4: Is there a different triangulation that does not have collapses and gives a nice deformation? Usually. For a given input we can flip toward a triangulation that is maximally Delaunay but does not have collapses.

Triangulations for Time-Space Maps Question 4: Is there a different triangulation that does not have collapses and gives a nice deformation? Usually. For a given input we can flip toward a triangulation that is maximally Delaunay but does not have collapses.

Triangulations for Time-Space Maps Question 5: Does this give a nice deformation?

Triangulations for Time-Space Maps Question 5: Does this give a nice deformation? Much nicer. But there are still artifacts. Static hybrid

Triangulations for Time-Space Maps Question 6: Can we somehow change the triangulation when moving the points from geographic to time location?

Triangulations for Time-Space Maps Question 6: Can we somehow change the triangulation when moving the points from geographic to time location? This is a great idea! We maintain the Delaunay triangulation for moving points, and flip when the in-circle predicate is violated.

Triangulations for Time-Space Maps Question 7: Does this give a nice deformation?

Triangulations for Time-Space Maps Question 7: Does this give a nice deformation? Dynamic Delaunay Usually very nice. Occasionally there may be visually unpleasant parts.

t=0 t=1 t=0 t=1 t=0 t=1 t=0; t=1

t=0 t=1 t=0 t=1 t=0; t=1

Comparison Static radialStatic hybridDynamic Delaunay compute deformation ( n cities ) O(n log n)O(n 2 log n)O(n 3 log n) (*) compute deformed map ( m vertices ) O(m log n) O(m n 3 log n) (*) distance deformation 58.8 km27.3 km7.0 km angle deformation 37.0 o 26.3 o 19.6 o 25 km 25 + X km 60 o 60 o ± Y

Conclusions Time-space maps Triangulations make deformations Maintaining the Delaunay triangulation during point movement gives good deformations