November 21GEOINFO 2005 Preserving Incidence and Coincidence Topologies in Saalfelds Polyline Simplification Algorithm Department of Computer Engineering.

Slides:



Advertisements
Similar presentations
Lia Toledo Moreira Mota, Alexandre de Assis Mota, Wu, Shin-Ting
Advertisements

November 20GEOINFO 20061/25 A Robust Strategy for Handling Linear Features in Topologically Consistent Polyline Simplification Department of Computer Engineering.
Creating interactive User Feedback in DGS using the Scripting Interface of Cinderella Andreas Fest University of Education Schwäbisch Gmünd CADGME 2009.
Representation of spatial data
Quine-McCluskey Method
1 st Meeting, Industrial Geometry, 2005 Approximating Solids by Balls (in collaboration with subproject: "Applications of Higher Geometrics") Bernhard.
 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
Computer Graphics (Spring 2008) COMS 4160, Lecture 6: Curves 1
Surface Simplification using Quadric Error Metrics Guowei Wu.
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
Providing Geography for Topology; A Schematic View of the National Watershed Boundary Dataset (WBD) James E. Mitchell, Ph.D. IT GIS Manager Kurt L. Johnson.
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
A Recursive Algorithm for Calculating the Relative Convex Hull Gisela Klette AUT University Computing & Mathematical Sciences Auckland, New Zealand.
Proportion Priors for Image Sequence Segmentation Claudia Nieuwenhuis, etc. ICCV 2013 Oral.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
Shape from Contours and Multiple Stereo A Hierarchical, Mesh-Based Approach Hendrik Kück, Wolfgang Heidrich, Christian Vogelgsang.
Graph Drawing Introduction 2005/2006. Graph Drawing: Introduction2 Contents Applications of graph drawing Planar graphs: some theory Different types of.
Cláudio Baptista, UFCG A Model for Geographic Knowledge Extraction on Web Documents Cláudio E. C. Campelo and Cláudio de Souza.
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
NetFlow Analyzer Drilldown to the root-QoS Product Overview.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Consistent Parameterizations Arul Asirvatham Committee Members Emil Praun Hugues Hoppe Peter Shirley.
WORKFLOWS IN CLOUD COMPUTING. CLOUD COMPUTING  Delivering applications or services in on-demand environment  Hundreds of thousands of users / applications.
Curve Modeling Bézier Curves
Cadastre software based on Open Source in Kyrgyzstan Alexander Solovov Solution developer.
Applied Cartography and Introduction to GIS GEOG 2017 EL
Orthogonal moments Motivation for using OG moments Stable calculation by recurrent relations Easier and stable image reconstruction - set of orthogonal.
11/19/02 (c) 2002, University of Wisconsin, CS 559 Last Time Many, many modeling techniques –Polygon meshes –Parametric instancing –Hierarchical modeling.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Multi-Scale Dual Morse Complexes for Representing Terrain Morphology E. Danovaro Free University of Bolzano, Italy L. De Floriani University of Genova,
OVERVIEW- What is GIS? A geographic information system (GIS) integrates hardware, software, and data for capturing, managing, analyzing, and displaying.
Spatial Databases: Data Collection Spring, 2015 Ki-Joune Li.
/15 GEOBIA 2008, 07. August 2008 From Image - Objects to Maps: Cartographic Requirements for GEOBIA Stefan Steiniger, Guillermo Castilla,
1 Surface Applications Fitting Manifold Surfaces To 3D Point Clouds, Cindy Grimm, David Laidlaw and Joseph Crisco. Journal of Biomechanical Engineering,
CHAPTER 3 VECTOR DATA MODEL.
Computer Graphics and Multimedia Systems, University of Siegen, Germany 1 GPU-Based Responsive Grass Jens Orthmann, Christof Rezk-Salama, Andreas Kolb.
Research Status on Multi-Resolution Modeling System Youngjae Song CAD Lab,. Seoul National Univ. Youngjae Song CAD Lab,. Seoul National Univ.
MIRALab Where Research means Creativity SVG Open 2005 University of Geneva 1 Converting 3D Facial Animation with Gouraud shaded SVG A method.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Multimodal Analysis Using Network Analyst. Outline Summarizing accessibility Summarizing accessibility Adding transportation modes to a network Adding.
Feature Point Detection and Curve Approximation for Early Processing of Free-Hand Sketches Tevfik Metin Sezgin and Randall Davis MIT AI Laboratory.
Rendering Bezier Curves (1) Evaluate the curve at a fixed set of parameter values and join the points with straight lines Advantage: Very simple Disadvantages:
COMPUTER GRAPHICS CS 482 – FALL 2015 SEPTEMBER 10, 2015 TRIANGLE MESHES 3D MESHES MESH OPERATIONS.
ACM-GIS Morphology-Driven Simplification and Multiresolution Modeling of Terrains Emanuele Danovaro, Leila De Floriani, Paola Magillo, Mohammed.
DPL3/10/2016 CS 551/651: Simplification Continued David Luebke
Euro-Par, HASTE: An Adaptive Middleware for Supporting Time-Critical Event Handling in Distributed Environments ICAC 2008 Conference June 2 nd,
Decimation of Triangle Meshes Paper by W.J.Schroeder et.al Presented by Guangfeng Ji.
1 INTRODUCTION TO COMPUTER GRAPHICS. Computer Graphics The computer is an information processing machine. It is a tool for storing, manipulating and correlating.
Introduction to Parametric Curve and Surface Modeling.
Accurate 3D Modeling of User Inputted Molecules Using a Nelder Mead Algorithm Ben Parr Period 6.

We propose a method which can be used to reduce high dimensional data sets into simplicial complexes with far fewer points which can capture topological.
Daniel Pilon Senior project officer at NRCan
Decimation Of Triangle Meshes
Principles of GIS Geocomputation – Part II Shaowen Wang
Dingding Liu* Yingen Xiong† Linda Shapiro* Kari Pulli†
© University of Wisconsin, CS559 Spring 2004
Vicki M. Bier, Eli Robert Gratz, Naraphorn J
JTS Topology Suite An API for Processing Linear Geometry
Meshes.
Spatial Databases: Data Collection
A Hierarchical Vector Data Model for Distributed Geospatial Processing
Introduction to Parametric Curve and Surface Modeling
Scrumium NetBrain Thursday, May 09, 2019.
Spatial Databases: Data Collection
Presentation transcript:

November 21GEOINFO 2005 Preserving Incidence and Coincidence Topologies in Saalfelds Polyline Simplification Algorithm Department of Computer Engineering and Industrial Automation (DCA) School of Electrical and Computer Engineering (FEEC) State University of Campinas (UNICAMP) da Silva, Adler C. G. Wu, Shin-Ting

November 21GEOINFO 2005 Topics l Motivation l Polyline simplification l Topological Properties l State-of-the-art l Objective l Proposal l Results l Concluding remarks

November 21GEOINFO 2005 Topics l Motivation l Polyline simplification l Topological Properties l State-of-the-art l Objective l Proposal l Results l Concluding remarks

November 21GEOINFO 2005 Motivation l Graphical User Interface for Pre-dispatches Pre-dispacth = Planned schedule of power dispatching One-line diagram Visual presentation in different levels of detail + + Geographical context

November 21GEOINFO 2005 Motivation Geographical context in different levels of detail Maps in different resolutions Simplification of a set of polylines

November 21GEOINFO 2005 Topics l Motivation l Polyline simplification l Topological Properties l State-of-the-art l Objective l Proposal l Results l Concluding remarks

November 21GEOINFO 2005 Polyline Simplification Original Map: Simplified Map: Source: Digital Chart of the World Server (

November 21GEOINFO 2005 Polyline Simplification l Visvalingam and Whyatt, 1993 l White, 1985 l McMaster, 1986 l Ramer, 1972; Douglas and Peucker, 1973 RDP algorithm DistanceAdjacent distance Adjacent AngleAdjacent Area

November 21GEOINFO 2005 Polyline Simplification: RDP l Maximum tolerable distance ( )

November 21GEOINFO 2005 Polyline Simplification: Problems

November 21GEOINFO 2005 Topics l Motivation l Polyline simplification l Topological Properties l State-of-the-art l Objective l Proposal l Results l Concluding remarks

November 21GEOINFO 2005 Topological Properties l Geometrical properties that are invariant under continuous deformations

November 21GEOINFO 2005 Topological Properties Coincidence Sidecrossings Incidence

November 21GEOINFO 2005 Topics l Motivation l Polyline simplification l Topological Properties l State-of-the-art l Objective l Proposal l Results l Concluding remarks

November 21GEOINFO 2005 State-of-the-art Possible solutions: l To decrease the tolerance l To handle all polylines and features of a map as a whole l To handle the polyline, taking into account its vicinity (Saalfeld 1998)

November 21GEOINFO 2005 State-of-the-art: Saalfelds 1) Necessity for inconsistencies 3) Triangle inversion2) Point sidedness Simplification from RDP algorithm simplification subpolyline

November 21GEOINFO 2005 State-of-the-art: Saalfelds First step: RDP algorithm until condition is satisfied Second step: further insertions until sidedness and conditions are satisfied

November 21GEOINFO 2005 State-of-the-art: limitations WITH redundancies (Fast visualization) WITHOUT redundancies (Easy edition) Data structures:

November 21GEOINFO 2005 State-of-the-art: Saalfelds Coincidence crossings Incidence

November 21GEOINFO 2005 State-of-the-art: Saalfelds

November 21GEOINFO 2005 State-of-the-art Incidence of P 2 in P 1 without the insertion of the incident vertex in P 1 :

November 21GEOINFO 2005 Topics l Motivation l Polyline simplification l Topological Properties l State-of-the-art l Objective l Proposal l Results l Concluding remarks

November 21GEOINFO 2005 Objective l General context: to develop a topologically consistent map simplification algorithm l Contribution of this work: to enhance Saalfelds algorithm such that it also preserves topological consistency of the redundant data

November 21GEOINFO 2005 Objective: Improving Saalfelds l RDP l Saalfeld l Saalfeld for maps

November 21GEOINFO 2005 Topics l Motivation l Polyline simplification l Topological Properties l State-of-the-art l Objective l Proposal l Results l Concluding remarks

November 21GEOINFO 2005 Proposal l To integrate additional conditions in Saalfeld´s algorithm such that the topological consistencies may be ensured along the simplification process incidence coincidence

November 21GEOINFO 2005 Proposal: Coincidence l Preserving coincidence by using the essential vertices l Pre-processing time required MapVerticesTime (s) Amazonas ,718 Minas Gerais ,729 São Paulo ,899 Santa Catarina ,528 Rio de Janeiro ,254 Alagoas7.0000,001 Essential Vertices = extreme overlapping vertices

November 21GEOINFO 2005 l Processing of the in-between vertices: Proposal: Coincidence Original polylinesFirst step: RDP Simplifications One simplification is adjustedThe other is a copy Second step

November 21GEOINFO 2005 Proposal: Incidence l Preserving Incidences: 1 – nearness tolerance in numerical resolution 2 – nearness tolerance in device resolution = max( 1, 2 )

November 21GEOINFO 2005 Proposal: Stop Conditions l From RDP algorithm: condition l From Saalfeds algorithm: sidedness condition l Our proposal: nearness condition

November 21GEOINFO 2005 Proposal: Incidence Nearness classification Feature distance monitoring Close

November 21GEOINFO 2005 Proposal: Enhanced Algorithm l Determine the first simplification consisting of the essential vertices l Apply RDP algorithm on each polyline until the condition is satisfied. l Determine the fat convex hull for each simplified segment. l Evaluate the sidedness, the coincidence, and the nearness of all features inside each convex hull. l Adjust coincidence geometry. l Apply RDP algorithm on each polyline until the sidedness, the, and the nearness conditions are satisfied.

November 21GEOINFO 2005 Topics l Motivation l Polyline simplification l Topological Properties l State-of-the-art l Objective l Proposal l Results l Concluding remarks

November 21GEOINFO 2005 Results Saalfelds Our

November 21GEOINFO 2005 Results Saalfelds Our

November 21GEOINFO 2005 Topics l Motivation l Polyline simplification l Topological Properties l State-of-the-art l Objective l Proposal l Results l Concluding remarks

November 21GEOINFO 2005 Concluding Remarks l We present a simple procedure to ensure coincidence and incidence topologies during the simplification of maps with redundant data. It is based on the essential vertices and the nearness tolerance. l The visual results make us to believe that our proposal is promising. l As further work, To integrate this algorithm with one-line diagram algorithm to be presented on Wedneday. To extend it to be multiresolution.

November 21GEOINFO 2005 Thank You!

November 21GEOINFO 2005 Objective: Improving Saalfelds l To simplify each polyline until condition is satisfied. l To process each convex hull until and sidedness conditions are satisfied.

November 21GEOINFO 2005 State-of-the-art: Saalfelds l RDP with a new stop condition ( + sidedness)