Part II: Paper c: Skeletons, Roofs, and the Medial Axis Joseph ORourke Smith College.

Slides:

Advertisements

Similar presentations

Order-k Voronoi Diagram in the Plane

Advertisements

Part III: Polyhedra b: Unfolding

Part II: Paper b: One-Cut Theorem Joseph ORourke Smith College (Many slides made by Erik Demaine)

Data Visualization Lecture 4 Two Dimensional Scalar Visualization

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

Spatial Embedding of Pseudo-Triangulations Peter Braß Institut für Informatik Freie Universität Berlin Berlin, Germany Franz Aurenhammer Hannes Krasser.

Problems in curves and surfaces M. Ramanathan Problems in curves and surfaces.

Convex drawing chapter 5 Ingeborg Groeneweg. Summery What is convex drawing What is convex drawing Some definitions Some definitions Testing convexity.

Open Problem 9 Yoosun Song CSCE 620 : EDGE-UNFOLDING CONVEX POLYHEDRA Yoosun Song.

Proximity graphs: reconstruction of curves and surfaces

2/3/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Triangulations and Guarding Art Galleries II Carola Wenk.

Fundamentals of computational geometry M. Ramanathan STTP CAD 2011.

9/12/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2006 Triangulations and Guarding Art Galleries II Carola Wenk.

1 Voronoi Diagrams. 2 Voronoi Diagram Input: A set of points locations (sites) in the plane.Input: A set of points locations (sites) in the plane. Output:

Medial axis computation of exact curves and surfaces M. Ramanathan Department of Engineering Design, IIT Madras Medial object.

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.

1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.

Tutorial 2 – Computational Geometry

Voronoi Diagram Presenter: GI1 11號蔡逸凡

Lecture 7: Voronoi Diagrams Presented by Allen Miu Computational Geometry September 27, 2001.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2010 Lecture 2 Polygon Partitioning Thursday,

Computational Geometry -- Voronoi Diagram

17. Computational Geometry Chapter 7 Voronoi Diagrams.

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.

3. Delaunay triangulation

Delaunay Triangulation Computational Geometry, WS 2006/07 Lecture 11 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001 Lecture 4 Chapter 6: Arrangements Monday,

By Dor Lahav. Overview Straight Skeletons Convex Polygons Constrained Voronoi diagrams and Delauney triangulations.

Vocabulary 2.2 – Curves and two dimensional figures (part 1) MA418 Spring 2010 McAllister.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Chapter 5: Voronoi Diagrams Wednesday,

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Chapter 5: Voronoi Diagrams Monday, 2/23/04.

Lecture 10 : Delaunay Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Overview Motivation. Triangulation of Planar Point Sets. Definition.

CS CS 175 – Week 3 Triangulating Point Clouds VD, DT, MA, MAT, Crust.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 O’Rourke Chapter 8 Motion Planning.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Lecture 2 Chapter 2: Polygon Partitioning.

Basic Definitions in Geometry

Brute-Force Triangulation

UNC Chapel Hill M. C. Lin Point Location Chapter 6 of the Textbook –Review –Algorithm Analysis –Dealing with Degeneracies.

CS 450: Computer Graphics REVIEW: OVERVIEW OF POLYGONS

9/7/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2006 Triangulations and Guarding Art Galleries Carola Wenk.

Subdivision of Edge In a graph G, subdivision of an edge uv is the operation of replacing uv with a path u,w,v through a new vertex w.

Vertex the point where two lines, line segments, or rays meet to form an angle Point A is a vertex for the angles formed. A.

Reagan’s unit 5 math vocab

Unit 5 Vocab By: Mika Hamady. Acute Angle Definition: An acute angle is an angle that is less then 90 degrees. Examples: 1.A 43 degree angle is acute.

PRE-TRIANGULATIONS Generalized Delaunay Triangulations and Flips Franz Aurenhammer Institute for Theoretical Computer Science Graz University of Technology,

Part 6: Graphics Output Primitives (4) 1.  Another useful construct,besides points, straight line segments, and curves for describing components of a.

Points, Lines, and Planes Sections 1.1 & 1.2. Definition: Point A point has no dimension. It is represented by a dot. A point is symbolized using an upper-case.

1 Triangulation Supplemental From O’Rourke (Chs. 1&2) Fall 2005.

TEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES An Algorithm for the Computation of the Metric.

Order-k Voronoi diagram in the plane Dominique Schmitt Université de Haute-Alsace.

2/19/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Voronoi Diagrams Carola Wenk Based on: Computational Geometry:

Voronoi Diagram (Supplemental)

GEOMETRY 10.5 Surface Area of Pyramids and Cones.

Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.

Robert Pless, CS 546: Computational Geometry Lecture #3 Last Time: Plane Sweep Algorithms, Segment Intersection, + (Element Uniqueness)

Greg Humphreys CS445: Intro Graphics University of Virginia, Fall 2003 Subdivision Surfaces Greg Humphreys University of Virginia CS 445, Fall 2003.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2010 O’Rourke Chapter 6 with some material.

9/8/10CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2010 Triangulations and Guarding Art Galleries Carola Wenk.

An Introduction to Computational Geometry: Arrangements and Duality Joseph S. B. Mitchell Stony Brook University Some images from [O’Rourke, Computational.

Geometry 12-5 Symmetry. Vocabulary Image – The result of moving all points of a figure according to a transformation Transformation – The rule that assigns.

CMPS 3130/6130 Computational Geometry Spring 2017

Section 9.1 Points, Lines, Planes, and Angles

Robust and Fast Algorithm for a Circle Set Voronoi Diagram in a Plane

Transformations and Symmetry

Tutorial 3 – Computational Geometry

An Introduction to Computational Geometry

VORONOI DIAGRAMS FOR PARALLEL HALFLINES IN 3D

An angle inside a polygon

Section 9.1 Points, Lines, Planes, and Angles

Presentation transcript:

Part II: Paper c: Skeletons, Roofs, and the Medial Axis Joseph ORourke Smith College

Outline zVoronoi Diagram zMedial Axis yGrassfire Transformation zStraight Skeleton yConstant-sloped roofs (cf. David Bélanger notes) yProperties (cf. Kevin Danaher notes)

Voronoi Applet (Paul Chew, Cornell) zhttp://

Skeletons & Roofs zDavid Bélanger, McGill Univ. zroofs.html (local)roofs.html zhttp:// (remote)

Straight Skeleton in 1-Cut Thm zShrink boundary yHandle nonconvex polygons new event when vertex hits opposite edge yHandle nonpolygons butt vertices of degree 0 and 1

Straight Skeletons An alternative to the medial axis Kevin Danaher Computer Geometry Fall

Straight Skeleton

Shrinking Process (contd) zPolygon hierarchy during shrinking

Events zTwo events can occur: yEdge event: an edge shrinks to zero, making its neighboring edges adjacent. ySplit event: A reflex vertex runs to an edge and splits it, thus splitting the whole polygon. New adjacencies occur between the split edge and each of the two edges incident to the reflex vertex.

Events (contd)

Formal Definitions zThe straight skeleton, S(P), of polygon, P, is the union of the pieces of the angular bisectors traced out by the polygon vertices during the shrinking process. zEach edge, e, sweeps out a certain area called the face of e. zBisector pieces are called arcs, and their endpoints which are not vertices of P are called nodes of S(P).

Properties zIf P is an n-gon, then S(P): yrealizes 2n -3 arcs yrealizes n -2 nodes yDivides P into n monotone polygons

Why straight skeleton? zThe straight skeleton has a lower combinatorial complexity than the medial axis for non-convex polygons. yMedial axis has 2n+r –3 arcs (with r parabolically curved) -vs- 2n –3 for straight skeleton

Bibliography zO. Aichholzer, F. Aurenhammer, D. Alberts, and B. Gartner. A novel type of skeleton for polygons. Journal of universal computer science, Institute for Image Processing and Computer Supported New Media, 1(12): , zO. Aichholzer and F. Aurenhammer, Straight skeletons for general polygonal figures in the plane, Proc.2nd COCOON, Lecture Notes in Computer Science, 1090, Springer-Verlag, Berlin, 1996, pp zP. Felkel, S. Obdrzalek, Straight Skeleton Implementaion, 14th Spring Conference on Computer Graphics (SCCG'98), , 1998.