Adventures in Computational Art: Moving Points Around Craig S. - PowerPoint PPT Presentation

Dec 13, 2022 •41 likes •541 views

Adventures in Computational Art: Moving Points Around Craig S. Kaplan School of Computer Science, University of Waterloo FTLOMACS 14 October 2017 Code is an artistic medium. New (non-physical) simulation: Construct Voronoi diagram. Move

Adventures in Computational Art: Moving Points Around Craig S. Kaplan School of Computer Science, University of Waterloo FTLOMACS ‧ 14 October 2017
Code is an artistic medium.
New (non-physical) simulation: Construct Voronoi diagram. Move each point to the centroid of its Voronoi region. Repeat until points stop moving. AKA Lloyd’s Method
Weighted Voronoi Stippling [Secord 2002]
The Travelling Salesman Problem (TSP)
Area Voronoi Diagrams [Hiller et al., 2003]
[Dalal et al., 2006]
Thank you! Craig S. Kaplan csk@uwaterloo.ca isohedral.ca www.cgl.uwaterloo.ca/csk @cs_kaplan

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Dr Stephen Crabbe September 17 th , 2014 The Adventures of Tom Sawyer (1876) Adventures of

Looking backwards to look forward: Mark Twain and best practice for developing clear and effective content in our globalised, digitally-connected world Dr Stephen Crabbe September 17 th , 2014 The Adventures of Tom Sawyer (1876) Adventures of

437 views • 21 slides

Adventures in Elm GOTO Chicago, 24 May 2016 Adventures in Elm Events, Reproducibility, and

Adventures in Elm GOTO Chicago, 24 May 2016 Adventures in Elm Events, Reproducibility, and Kindness question your principles @jessitron Adventures in Elm Events, Reproducibility, and Kindness Data Data In Out Server UI Everything My

646 views • 39 slides

1 n log n ) An O( n n 3 O( n log n 3 ) An An O( )- -Time Triangulation Algorithm Time

Triangulations Triangulations A triangulation of set S of points in the plane is a partition of the convex hull of the set into triangles whose vertices Computational Geometry Computational Geometry are the points, and do not contain other

398 views • 6 slides

Computational Notebooks 30.06.2020 30.06.20 | FB Informatik | Reactive Programming & STG

Computational Notebooks 30.06.2020 30.06.20 | FB Informatik | Reactive Programming & STG | G. Doci, J.Stadtmller | 1 Outline Motivation Strong points Pain points & messiness Existing approaches and solutions

234 views • 22 slides

Cylinders Through Five Points: Computational Algebra and Geometry Daniel Lichtblau Wolfram

Cylinders Through Five Points: Computational Algebra and Geometry Daniel Lichtblau Wolfram Research, Inc. 100 Trade Centre Dr. Champaign, IL 61820 danl@wolfram.com ICMS, Castro Urdiales, Spain September 13, 2006 | 2 Abstract

468 views • 27 slides

The Adventures of NIKA2 from the AoD perspective Bilal Ladjelate - Observing the millimeter

The Adventures of NIKA2 from the AoD perspective Bilal Ladjelate - Observing the millimeter Universe with the NIKA2 Camera Outline of these adventures Review of the di ff erent pools Overview of projects observed Evolution of NIKA2

310 views • 28 slides

Enhanced Discretization and Space-Time Refinement in Moving-Boundary Flow Simulation Marek

Enhanced Discretization and Space-Time Refinement in Moving-Boundary Flow Simulation Marek Behr Chair for Computational Analysis of Technical Systems RICAM Special Semester November 8, 2016 Outline Why moving boundaries?

551 views • 41 slides

CS133 Computational Geometry Convex Hull 1 Convex Hull Given a set of n points, find the

CS133 Computational Geometry Convex Hull 1 Convex Hull Given a set of n points, find the minimal convex polygon that contains all the points 2 Convex Hull Properties 3 Convex Hull Representation The convex hull is represented by all

1.07k views • 82 slides

CS133 Computational Geometry Convex Hull 4/12/2018 1 Convex Hull Given a set of n points,

CS133 Computational Geometry Convex Hull 4/12/2018 1 Convex Hull Given a set of n points, find the minimal convex polygon that contains all the points 4/12/2018 2 Convex Hull Properties 4/12/2018 3 Convex Hull Representation The

1.21k views • 81 slides

R-trees Computational Geometry Heuristics Buffer Paradigm 1 Spatial Data Spatial data: points,

R-trees Computational Geometry Heuristics Buffer Paradigm 1 Spatial Data Spatial data: points, lines, polygons/polyhedra in R d . For simplicity: assume d = 2 . Typical queries: Point: All objects containing query point Intersection: All

399 views • 11 slides

Theorem Provers Seminar Resources for Anna Mndelein Computational Linguists (SS 2007)

Theorem Provers Seminar Resources for Anna Mndelein Computational Linguists (SS 2007) 02.07.2007 Magda Wolska, Michaela Regneri Outline Theorem Proving for Text Adventures Introduction Knowledge Base System

508 views • 25 slides

DDR solution Sprites overview Moving right arrow Moving left arrow Moving down arrow Moving up

DDR solution Sprites overview Moving right arrow Moving left arrow Moving down arrow Moving up arrow Moving up arrow Cassy (contol loop) Great sprite OK sprite Space bar sprite

521 views • 11 slides

Adventures! ! What did I learn last class? Use simple dictionaries Word Banks Word Walls Sound

Adventures! ! What did I learn last class? Use simple dictionaries Word Banks Word Walls Sound of the letters nn Adventures ! What will I learn today? Draw a picture of a story Descriptive adjectives Sounds of the letter MM

815 views • 50 slides

Adventures of a Long-Range Walker Thierry DAUXOIS CNRS & ENS Lyon 1 Stefano Ruffo

Adventures of a Long-Range Walker Thierry DAUXOIS CNRS & ENS Lyon 1 Stefano Ruffo Adventures of a long-range walker, born 13th May 1954 60th birthday 2 Studying Links between Statistical Mechanics and Nonlinear Dynamics Fermi-Pasta-Ulam

449 views • 42 slides

Computational Geometry Largest convex subsets Exercise session #9: Arrangements Definition :

Computational Geometry Largest convex subsets Exercise session #9: Arrangements Definition : A finite set of points P is in convex position if all points of P are the vertices of the Applications of arrangements convex hull polygon of P

225 views • 4 slides

Numerical Computation of StarkHegner points in higher level Xevi Guitart 1 Marc Masdeu 2 1 Max

Numerical Computation of StarkHegner points in higher level Xevi Guitart 1 Marc Masdeu 2 1 Max Planck Institute/U. Politcnica de Catalunya 2 Columbia University Rational points on curves: A p -adic and computational perspective Mathematical

312 views • 16 slides

( ) 2017.04.27 CS686 Presentation #1 Bircher, Andreas, et al. "Structural

Structural Inspection Path Planning via Iterative Viewpoint Resampling with Application to Aerial Robot Sungwook Jung ( ) 2017.04.27 CS686 Presentation #1 Bircher, Andreas, et al. "Structural inspection path planning via

653 views • 20 slides

Travelling Salesman Problem Stewart Adam Kevin Visser May 14, 2010 The Problem Need to

Travelling Salesman Problem Stewart Adam Kevin Visser May 14, 2010 The Problem Need to visit N cities with smallest total distance travelled Thought of in the 1830s Mathematicians in the 1930s realized the problem was unsolvable

934 views • 16 slides

Grindstone River Dam Hinckley Community Room December 20, 2018 Tonights Agenda Updating the

Grindstone River Dam Hinckley Community Room December 20, 2018 Tonights Agenda Updating the local community 6:00 6:10 Welcome, tonights purpose, agenda, facilitator 6:10 6:30 Presentation: How did we get here and what now?

366 views • 10 slides

DRAINAGE DITCH #29 PRESEN T ED: BY OT T ER TAI L COU N T Y DI TCH I N SPECTOR K EV I N

DRAINAGE DITCH #29 PRESEN T ED: BY OT T ER TAI L COU N T Y DI TCH I N SPECTOR K EV I N FELLBAU M N OV EM BER/1 5 /2 0 1 6 COUNTY DITCH #29 PRESENTATION *Drainage Authority Chair Comments *Introductions *Reason for Meeting *Ditch

269 views • 15 slides

Algorithms for Covering Points with Lines Aman Anand Department of Computer Science and

Algorithms for Covering Points with Lines Aman Anand Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India 4th November, 2014 Aman Anand (CSE, IITK) Algorithms for Covering Points with Lines 04/11/14

127 views • 12 slides

Estimating building inventory for rapid seismic vulnerability assessment in Bishkek, Kyrgyzstan

Estimating building inventory for rapid seismic vulnerability assessment in Bishkek, Kyrgyzstan an integrated approach based on multi-source imaging and GIS M. Wieland, M. Pittore, S. Parolai, J. Zschau http://www.globalquakemodel.org

469 views • 23 slides

Pr ss Pr Pr

Pr ss t Pr Pr ss Pr Pr

656 views • 42 slides

The Market Conditions Addendum Form Comments by: Robert T. Murphy Senior Business Manager

1 The Market Conditions Addendum Form Comments by: Robert T. Murphy Senior Business Manager Enterprise Risk Office Single Family Risk Fannie Mae 3 Comments by: Jacqueline Doty Collateral Policy Director Freddie Mac 4 Presenter Mark

566 views • 41 slides