martin fink university of california santa barbara
play

Martin Fink University of California Santa Barbara research - PowerPoint PPT Presentation

Jan 08, 2023 •173 likes •227 views

Martin Fink University of California Santa Barbara research interests: Graph Drawing Information Visualization Computational Geometry Experimental Graph Drawing Algorithms Marcus Schaefer Markus Chimani Sebastian Leipert Seok-Hee Hong

  1. Martin Fink University of California Santa Barbara research interests: Graph Drawing Information Visualization Computational Geometry

  2. Experimental Graph Drawing Algorithms Marcus Schaefer Markus Chimani Sebastian Leipert Seok-Hee Hong Takao Nishizeki Md. Saidur Rahman 0001 Tim Dwyer Michael J¨ unger Kim Marriott Petra Mutzel Peter Eades Karsten Klein Stephen C. North Carsten Gutwenger Yehuda Koren Lev Nachmanson Christian Bachmaier Joe Marks Emden R. Gansner Stephen G. Kobourov Georg Sander Christian A. Duncan Dorothea Wagner David Eppstein Franz-Josef Brandenburg Michael T. Goodrich Stina S. Bridgeman Ulrik Brandes Martin N¨ ollenburg Sabine Cornelsen Roberto Tamassia Ioannis G. Tollis Ashim Garg Therese C. Biedl Jan Kratochv´ ıl Prosenjit Bose David R. Wood Alexander Wolff Maurizio Patrignani Maurizio Pizzonia Giuseppe Di Battista Fabrizio Frati Michael A. Bekos Giuseppe Liotta J´ anos Pach Sue Whitesides Michael Kaufmann Vida Dujmovic Walter Didimo Henk Meijer Antonios Symvonis Patrizio Angelini Stephen K. Wismath G´ eza T´ oth Emilio Di Giacomo Tamara Mchedlidze curvy metro maps drawing in restricted area

  3. Aspect Ratio of Scatterplots user preferences output of optimization methods

  4. Possible Future Work block crossings of metro lines bundled crossings in graph drawing

Recommend

Drawing Graphs within Restricted Area Martin Fink Department of Computer Science University of

Drawing Graphs within Restricted Area Martin Fink Department of Computer Science University of

Drawing Graphs within Restricted Area Martin Fink Department of Computer Science University of California, Santa Barbara Joint work with Maximilian Aulbach, Julian Schuhmann, and Alexander Wolff 1 /25 Motivation Calculation Graphs

1.5k views • 118 slides
Counting Convex k -gons in an Arrangement of Line Segments Martin Fink, Neeraj Kumar and Subhash

Counting Convex k -gons in an Arrangement of Line Segments Martin Fink, Neeraj Kumar and Subhash

Counting Convex k -gons in an Arrangement of Line Segments Martin Fink, Neeraj Kumar and Subhash Suri University of California, Santa Barbara Motivation Consider the following problem from computer vision: Motivation Consider the following

1.29k views • 80 slides
Nominal alignment in Chitimacha Daniel W. Hieber University of California, Santa Barbara Slides

Nominal alignment in Chitimacha Daniel W. Hieber University of California, Santa Barbara Slides

Workshop on American Indigenous Languages (WAIL), UC Santa Barbara, April 2021, 2018 Nominal alignment in Chitimacha Daniel W. Hieber University of California, Santa Barbara Slides available at danielhieber.com/cv This research was funded

679 views • 64 slides
Linda Petzold University of California Santa Barbara www.engineering.ucsb.edu/~cse

Linda Petzold University of California Santa Barbara www.engineering.ucsb.edu/~cse

Linda Petzold University of California Santa Barbara www.engineering.ucsb.edu/~cse Definition: The understanding of biological network behavior through the application of modeling and simulation, tightly

622 views • 27 slides
Poisson Clusters and Unique Factorization Ken Goodearl University of California at Santa Barbara

Poisson Clusters and Unique Factorization Ken Goodearl University of California at Santa Barbara

Poisson Clusters and Unique Factorization Ken Goodearl University of California at Santa Barbara [joint work with Milen Yakimov] 0 Quick cluster algebra sketch (geometric type; coeffs field) K F = K ( y 1 , . . . , y N ) = rational

553 views • 26 slides
Nineteenth Century Maine Donald G. Janelle University of California, Santa Barbara A T h i n k S

Nineteenth Century Maine Donald G. Janelle University of California, Santa Barbara A T h i n k S

Rivers, Bridges, Stagecoaches, and Settlement System Development in early Nineteenth Century Maine Donald G. Janelle University of California, Santa Barbara A T h i n k S p a t i a l presentation 30 April 2013 a work in progress (slowly )

676 views • 41 slides
Cooks Theorem 1 Cook showed that SATISFIABILITY is NP-complete. The terms used to specify it

Cooks Theorem 1 Cook showed that SATISFIABILITY is NP-complete. The terms used to specify it

The Theory of NP-Completeness Peter Cappello Department of Computer Science University of California, Santa Barbara Santa Barbara, CA 93106 cappello@cs.ucsb.edu Please read the corresponding chapter before attending this lecture.

531 views • 20 slides
Verification of Web Services Jianwen Su University of California, Santa Barbara The

Verification of Web Services Jianwen Su University of California, Santa Barbara The

Verification of Web Services Jianwen Su University of California, Santa Barbara The Verification Problem Given a web service/composition/choreography/workflow/ a goal do all executions satisfy the goal? ? = Choices for

1.7k views • 111 slides
Searches for NP Claudio Campagnari University of California Santa Barbara 1 Disclaime mer

Searches for NP Claudio Campagnari University of California Santa Barbara 1 Disclaime mer

Searches for NP Claudio Campagnari University of California Santa Barbara 1 Disclaime mer Not a comprehensive review of results. Selected results (mostly) shown to make some (pedagogical? interesCng?) point Only CMS and Atlas

1.32k views • 75 slides
Ergativity in Chitimacha Daniel W. Hieber University of California, Santa Barbara Slides

Ergativity in Chitimacha Daniel W. Hieber University of California, Santa Barbara Slides

Society for the Study of the Indigenous Languages of the Americas (SSILA), Jan. 36, NYC Ergativity in Chitimacha Daniel W. Hieber University of California, Santa Barbara Slides available at danielhieber.com/cv This research was funded in

747 views • 33 slides
For every CFG there is a PDA We illustrate the general case with an example. Consider the

For every CFG there is a PDA We illustrate the general case with an example. Consider the

Chapter 15: CFG = PDA Peter Cappello Department of Computer Science University of California, Santa Barbara Santa Barbara, CA 93106 cappello@cs.ucsb.edu The corresponding textbook chapter should be read before attending this lecture.

641 views • 25 slides
Dog Waste in Santa Barbara Dog Waste in Santa Barbara Dog Waste in Santa Barbara Dog Waste in

Dog Waste in Santa Barbara Dog Waste in Santa Barbara Dog Waste in Santa Barbara Dog Waste in

Dog Waste in Santa Barbara Dog Waste in Santa Barbara Dog Waste in Santa Barbara Dog Waste in Santa Barbara Strategies and Solutions Strategies and Solutions Arabia lvarez Laura Botzong Kody Burke Kody Burke Evan Rosenberg June 12, 2012

591 views • 37 slides
Emptiness & Uselessness Theorem Let G be a CFG. Is L ( G ) = ? is decidable. Proof

Emptiness & Uselessness Theorem Let G be a CFG. Is L ( G ) = ? is decidable. Proof

Chapter 18: Decidability Peter Cappello Department of Computer Science University of California, Santa Barbara Santa Barbara, CA 93106 cappello@cs.ucsb.edu Please read the corresponding chapter before attending this lecture. These

747 views • 22 slides
Definitions A problem is effectively solvable if there is an algorithm for solv- ing it (a

Definitions A problem is effectively solvable if there is an algorithm for solv- ing it (a

Chapter 11: Decidability Peter Cappello Department of Computer Science University of California, Santa Barbara Santa Barbara, CA 93106 cappello@cs.ucsb.edu The corresponding textbook chapter should be read before attending this

269 views • 9 slides
Heather Zheng Department of Computer Science p p University of California, Santa Barbara CS201

Heather Zheng Department of Computer Science p p University of California, Santa Barbara CS201

Heather Zheng Department of Computer Science p p University of California, Santa Barbara CS201 UCLA, May 22, 2008 1 Explosion of wireless networks and devices Static spectrum assignments are inefficient p g Under utilization +

365 views • 24 slides
2019 LEGISLATIVE UPDATE SANTA BARBARA, CALIFORNIA Presented by: Eric S. Phillips APA California

2019 LEGISLATIVE UPDATE SANTA BARBARA, CALIFORNIA Presented by: Eric S. Phillips APA California

2019 LEGISLATIVE UPDATE SANTA BARBARA, CALIFORNIA Presented by: Eric S. Phillips APA California VP of Policy and Legislation Sande George Stefan/George Associates APA California Executive Director and Lobbyist Lauren De Valencia

662 views • 36 slides
The Pumping Lemma Definition: A language that cannot be defined by a regular expression is a

The Pumping Lemma Definition: A language that cannot be defined by a regular expression is a

Chapter 10: Nonregular Languages Peter Cappello Department of Computer Science University of California, Santa Barbara Santa Barbara, CA 93106 cappello@cs.ucsb.edu The corresponding textbook chapter should be read before attending this

348 views • 14 slides
Will McClintock Marine Science Institute, University of California Santa Barbara United Nations

Will McClintock Marine Science Institute, University of California Santa Barbara United Nations

Collaborative GeoDesign Technology for Marine Spatial Planning Will McClintock Marine Science Institute, University of California Santa Barbara United Nations Environment Programme World Conservation Monitoring Centre Geospatial Information

480 views • 21 slides
Stochastic Volatility Modeling Jean-Pierre Fouque University of California Santa Barbara Special

Stochastic Volatility Modeling Jean-Pierre Fouque University of California Santa Barbara Special

PART II: Stochastic Volatility Modeling Jean-Pierre Fouque University of California Santa Barbara Special Semester on Stochastics with Emphasis on Finance Tutorial September 5, 2008 RICAM, Linz, Austria 1 References: Derivatives in

872 views • 38 slides
of Chitimacha preverbs Daniel W. Hieber University of California, Santa Barbara UCSB 25th

of Chitimacha preverbs Daniel W. Hieber University of California, Santa Barbara UCSB 25th

Hieber, Daniel W. 2014. Category genesis through schematicity: On the origin of Chitimacha preverbs. Talk presented at the UC Santa Barbara 25 th Anniversary Reunion, Oct. 11, 2014, Santa Barbara, CA. Category genesis through schematicity: On the

455 views • 17 slides
Non-autonomous valency- changing devices in Chitimacha Daniel W. Hieber University of

Non-autonomous valency- changing devices in Chitimacha Daniel W. Hieber University of

Non-autonomous valency- changing devices in Chitimacha Daniel W. Hieber University of California, Santa Barbara danielhieber.com Workshop on American Indigenous Languages (WAIL), May 6-7, 2016 University of California, Santa Barbara Chief

407 views • 30 slides
Unification Theorem: Any language that can be defined by a regular expression, or a finite

Unification Theorem: Any language that can be defined by a regular expression, or a finite

Chapter 7: Kleenes Theorem Peter Cappello Department of Computer Science University of California, Santa Barbara Santa Barbara, CA 93106 cappello@cs.ucsb.edu The corresponding textbook chapter should be read before attending this

612 views • 27 slides
A Geospatial Perspective Michael F. Goodchild University of California Santa Barbara Embedded

A Geospatial Perspective Michael F. Goodchild University of California Santa Barbara Embedded

A Geospatial Perspective Michael F. Goodchild University of California Santa Barbara Embedded social networks Embedded in geographic space (and time) What can we learn from the embedding? What constraints does the embedding impose?

774 views • 28 slides
in Graph Computations Aydn Bulu John R. Gilbert University of California, Santa Barbara

in Graph Computations Aydn Bulu John R. Gilbert University of California, Santa Barbara

Parallel Combinatorial BLAS and Applications in Graph Computations Aydn Bulu John R. Gilbert University of California, Santa Barbara Adapted from talks at SIAM conferences 1 Primitives for Graph Computations By analogy to numerical

383 views • 22 slides

More recommend