Bettina Speckmann

IEEE Trans. Vis. Comput. Graph., January, 2025

2024

Mobility Data Science: Perspectives and Challenges.

[BibT_eX]

[DOI]

ACM Trans. Spatial Algorithms Syst., June, 2024

Sorting under partial (interval order) information.

[BibT_eX]

[DOI]

J. Comput. Geom., 2024

Polycubes via Dual Loops.

[BibT_eX]

[DOI]

Maxim Snoep

CoRR, 2024

Complexity as Design Material.

[BibT_eX]

[DOI]

CoRR, 2024

Greedy Monochromatic Island Partitions.

[BibT_eX]

[DOI]

Steven van den Broek

CoRR, 2024

Polycube Layouts via Iterative Dual Loops.

[BibT_eX]

[DOI]

Maxim Snoep

CoRR, 2024

Optimal In-Place Compaction of Sliding Cubes.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Optimizing Symbol Visibility Through Displacement.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Contextual Matrix Orderings for Graph Collections.

[BibT_eX]

[DOI]

Nathan van Beusekom

Proceedings of the 17th IEEE Pacific Visualization Conference, 2024

Capturing the Shape of a Point Set with a Line Segment.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Robust Bichromatic Classification Using Two Lines.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Scalable Harmonious Simplification of Isolines.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Spatial Information Theory, 2024

Optimal In-Place Compaction of Sliding Cubes (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Complexity as Design Material Position Paper.

[BibT_eX]

[DOI]

Proceedings of the IEEE Evaluation and Beyond, 2024

2023

A Monotone Interleaving Distance for Merge Trees.

[BibT_eX]

[DOI]

CoRR, 2023

Towards Mobility Data Science (Vision Paper).

[BibT_eX]

[DOI]

CoRR, 2023

Fast Reconfiguration for Programmable Matter.

[BibT_eX]

[DOI]

Irina Kostitsyna

Tom Peters

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Density Approximation for Moving Groups.

[BibT_eX]

[DOI]

Max van Mulken

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

A Subquadratic nε-approximation for the Continuous Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Data-Spatial Layouts for Grid Maps.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Geographic Information Science, 2023

2022

Simultaneous Matrix Orderings for Graph Collections.

[BibT_eX]

[DOI]

Nathan van Beusekom

IEEE Trans. Vis. Comput. Graph., 2022

Optimal morphs of planar orthogonal drawings.

[BibT_eX]

[DOI]

Arthur van Goethem

J. Comput. Geom., 2022

Crossing Numbers of Beyond-Planar Graphs Revisited.

[BibT_eX]

[DOI]

Nathan van Beusekom

Irene Parada

J. Graph Algorithms Appl., 2022

Mobility Data Science (Dagstuhl Seminar 22021).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2022

Density Approximation for Kinetic Groups.

[BibT_eX]

[DOI]

Max van Mulken

CoRR, 2022

Characterizing Uncertainty in the Visual Text Analysis Pipeline.

[BibT_eX]

[DOI]

Pantea Haghighatkhah

Mennatallah El-Assady

CoRR, 2022

A Subquadratic nε-approximation for the Continuous Fréchet Distance.

[BibT_eX]

[DOI]

CoRR, 2022

Obstructing Classification via Projection.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2022

Agglomerative Clustering of Growing Squares.

[BibT_eX]

[DOI]

Algorithmica, 2022

Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter.

[BibT_eX]

[DOI]

Irina Kostitsyna

Tom Peters

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Preprocessing Imprecise Points for the Pareto Front.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Story Trees: Representing Documents using Topological Persistence.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Language Resources and Evaluation Conference, 2022

Physically consistent map matching.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on Advances in Geographic Information Systems, 2022

Better Hit the Nail on the Head than Beat around the Bush: Removing Protected Attributes with a Single Projection.

[BibT_eX]

[DOI]

Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, 2022

2021

A Simple Pipeline for Coherent Grid Maps.

[BibT_eX]

[DOI]

Max Sondag

IEEE Trans. Vis. Comput. Graph., 2021

Maximum Physically Consistent Trajectories.

[BibT_eX]

[DOI]

ACM Trans. Spatial Algorithms Syst., 2021

Compacting Squares.

[BibT_eX]

[DOI]

CoRR, 2021

Diverse Partitions of Colored Points.

[BibT_eX]

[DOI]

Jérôme Urhausen

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Volume from Outlines on Terrains.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Geographic Information Science, 2021

Harmonious Simplification of Isolines.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Geographic Information Science, 2021

Coordinated Schematization for Visualizing Mobility Patterns on Networks.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Geographic Information Science, 2021

Route Reconstruction from Traffic Flow via Representative Trajectories.

[BibT_eX]

[DOI]

Proceedings of the SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems, 2021

Polygon-Universal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Near-Delaunay Metrics.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

Stable Visual Summaries for Trajectory Collections.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE Pacific Visualization Symposium, 2021

2020

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Quantitative Comparison of Time-Dependent Treemaps.

[BibT_eX]

[DOI]

Eduardo Faccin Vernier

Comput. Graph. Forum, 2020

Ordered Strip Packing.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Uncertainty Treemaps.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE Pacific Visualization Symposium, 2020

2019

10 Reasons to Get Interested in Graph Drawing.

[BibT_eX]

[DOI]

Reinhard von Hanxleden

Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

SolarView: Low Distortion Radial Embedding with a Focus.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2019

The 1st ACM SIGSPATIAL International Workshop on Computing with Multifaceted Movement Data (MOVE++ 2019).

[BibT_eX]

[DOI]

ACM SIGSPATIAL Special, 2019

Computing representative networks for braided rivers.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Non-crossing paths with geographic constraints.

[BibT_eX]

[DOI]

Rodrigo I. Silveira

Discret. Math. Theor. Comput. Sci., 2019

Spatially and Temporally Coherent Visual Summaries.

[BibT_eX]

[DOI]

CoRR, 2019

Locally correct Fréchet matchings.

[BibT_eX]

[DOI]

Comput. Geom., 2019

SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension.

[BibT_eX]

[DOI]

Tim Ophelders

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Optimal Morphs of Planar Orthogonal Drawings II.

[BibT_eX]

[DOI]

Arthur van Goethem

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Preprocessing Ambiguous Imprecise Points.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

A Practical Algorithm for Spatial Agglomerative Clustering.

[BibT_eX]

[DOI]

Thom Castermans

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018

Stable Treemaps via Local Moves.

[BibT_eX]

[DOI]

Max Sondag

IEEE Trans. Vis. Comput. Graph., 2018

Special issue for the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, Kyoto, Japan.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Naoki Kobayashi

Inf. Comput., 2018

Homotopic 𝒞-oriented routing with few links and thick edges.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Colored spanning graphs for set visualization.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Computing the similarity between moving curves.

[BibT_eX]

[DOI]

Tim Ophelders

Comput. Geom., 2018

A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Volume-based similarity of linear features on terrains.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

Social Network-Epistemology.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE International Conference on e-Science, 2018

Optimal Algorithms for Compact Linear Layouts.

[BibT_eX]

[DOI]

Proceedings of the IEEE Pacific Visualization Symposium, 2018

2017

Multi-Granular Trend Detection for Time-Series Analysis.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2017

Column planarity and partially-simultaneous geometric embedding.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Packing plane spanning trees and paths in complete geometric graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

A Framework for Algorithm Stability.

[BibT_eX]

[DOI]

CoRR, 2017

Complexity Measures for Mosaic Drawings.

[BibT_eX]

[DOI]

Quirijn W. Bouts

Proceedings of the WALCOM: Algorithms and Computation, 2017

Computing the Fréchet Distance between Real-Valued Surfaces.

[BibT_eX]

[DOI]

Tim Ophelders

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Non-Crossing Geometric Steiner Arborescences.

[BibT_eX]

[DOI]

Irina Kostitsyna

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Kinetic Data Structures.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Visual Encoding of Dissimilarity Data via Topology-Preserving Map Deformation.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2016

Area-Preserving Simplification and Schematization of Polygonal Subdivisions.

[BibT_eX]

[DOI]

ACM Trans. Spatial Algorithms Syst., 2016

Strict confluent drawing.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2016

Convex-Arc Drawings of Pseudolines.

[BibT_eX]

[DOI]

CoRR, 2016

Distance-sensitive planar point location.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Circles in the Water: Towards Island Group Labeling.

[BibT_eX]

[DOI]

Arthur van Goethem

Proceedings of the Geographic Information Science - 9th International Conference, 2016

Modeling Checkpoint-Based Movement with the Earth Mover's Distance.

[BibT_eX]

[DOI]

Proceedings of the Geographic Information Science - 9th International Conference, 2016

Grouping Time-Varying Data for Interactive Exploration.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

An Improved Lower Bound on the Minimum Number of Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Geo word clouds.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Pacific Visualization Symposium, 2016

2015

Exploring Curved Schematization of Territorial Outlines.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2015

Trajectory grouping structure.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

Algorithms for Necklace Maps.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2015

Improved Grid Map Layout by Point Set Matching.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2015

Mosaic Drawings and Cartograms.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2015

Angle-Restricted Steiner Arborescences for Flow Map Layout.

[BibT_eX]

[DOI]

Sylvester David Eriksson-Bique

Algorithmica, 2015

Geometric k Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Towards Characterizing Graphs with a Sliceable Rectangular Dual.

[BibT_eX]

[DOI]

Vincent Kusters

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Trajectory Grouping Structure under Geodesic Distance.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

Clustered edge routing.

[BibT_eX]

[DOI]

Quirijn W. Bouts

Proceedings of the 2015 IEEE Pacific Visualization Symposium, 2015

2014

Moving beyond the point: An agenda for research in movement analysis with real data.

[BibT_eX]

[DOI]

Comput. Environ. Urban Syst., 2014

Stenomaps: Shorthand for shapes.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2014

Similarity of trajectories taking into account geographic context.

[BibT_eX]

[DOI]

Maike Buchin

Somayeh Dodge

J. Spatial Inf. Sci., 2014

Plane Graphs with Parity Constraints.

[BibT_eX]

[DOI]

Graphs Comb., 2014

On the Number of Regular Edge Labelings.

[BibT_eX]

[DOI]

Sander Verdonschot

Discret. Math. Theor. Comput. Sci., 2014

Treemaps with bounded aspect ratio.

[BibT_eX]

[DOI]

Vincent van der Weele

Comput. Geom., 2014

Triangulating and guarding realistic polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Map Schematization with Circular Arcs.

[BibT_eX]

[DOI]

Proceedings of the Geographic Information Science - 8th International Conference, 2014

Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations.

[BibT_eX]

[DOI]

Proceedings of the Geographic Information Science - 8th International Conference, 2014

Column Planarity and Partial Simultaneous Geometric Embedding.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Geometric kth Shortest Paths: the Applet.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Computing the Fréchet distance with shortcuts is NP-hard.

[BibT_eX]

[DOI]

Maike Buchin

Anne Driemel

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Trajectory Grouping Structure: the Video.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Exploring Curved Schematization.

[BibT_eX]

[DOI]

Proceedings of the IEEE Pacific Visualization Symposium, 2014

2013

KelpFusion: A Hybrid Set Visualization Technique.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2013

Trajectory Grouping Structures

[BibT_eX]

[DOI]

CoRR, 2013

Maximizing maximal angles for plane straight-line graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Distance-Sensitive Planar Point Location.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Accentuating focus maps via partial schematization.

[BibT_eX]

[DOI]

Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

Colored Spanning Graphs for Set Visualization.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Rodrigo I. Silveira

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Kinetic 2-centers in the black-box model.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Shooting Permanent Rays among Disjoint Polygons in the Plane.

[BibT_eX]

[DOI]

Mashhood Ishaque

SIAM J. Comput., 2012

Area-Universal and Constrained Rectangular Layouts.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model.

[BibT_eX]

[DOI]

J. Comput. Geom., 2012

Guest Editor's Foreword.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Kelp Diagrams: Point Set Membership Visualization.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2012

Evolution Strategies for Optimizing Rectangular Cartograms.

[BibT_eX]

[DOI]

Sander Verdonschot

Proceedings of the Geographic Information Science - 7th International Conference, 2012

Context-Aware Similarity of Trajectories.

[BibT_eX]

[DOI]

Maike Buchin

Somayeh Dodge

Proceedings of the Geographic Information Science - 7th International Conference, 2012

Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

Flow Map Layout via Spiral Trees.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2011

Connect the dot: Computing feed-links for network extension.

[BibT_eX]

[DOI]

J. Spatial Inf. Sci., 2011

Geometric Simultaneous Embeddings of a Graph and a Matching.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

On Planar Supports for Hypergraphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Empty pseudo-triangles in point sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

A new method for subdivision simplification with applications to urban-area generalization.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

A splitting line model for directional relations.

[BibT_eX]

[DOI]

Vincent J. J. Kusters

Frank Staals

Bogdan Vasilescu

Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Delineating imprecise regions via shortest-path graphs.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Kinetic convex hulls and delaunay triangulations in the black-box model.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

The 2x2 Simple Packing Problem.

[BibT_eX]

[DOI]

André van Renssen

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Necklace Maps.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2010

Finding the Most Relevant Fragments in Networks.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Optimal BSPs and Rectilinear Cartograms.

[BibT_eX]

[DOI]

Elena Mumford

Int. J. Comput. Geom. Appl., 2010

Pointed binary encompassing trees: Simple and optimal.

[BibT_eX]

[DOI]

Michael Hoffmann

Comput. Geom., 2010

Algorithmic Aspects of Proportional Symbol Maps.

[BibT_eX]

[DOI]

Algorithmica, 2010

Homotopic Rectilinear Routing with Few Links and Thick Edges.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Area-Preserving Subdivision Schematization.

[BibT_eX]

[DOI]

André van Renssen

Proceedings of the Geographic Information Science, 6th International Conference, 2010

Optimizing Regular Edge Labelings.

[BibT_eX]

[DOI]

Sander Verdonschot

Proceedings of the Graph Drawing - 18th International Symposium, 2010

10491 Summary - Representation, Analysis and Visualization of Moving Objects.

[BibT_eX]

[DOI]

Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects.

[BibT_eX]

[DOI]

Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Results of the break-out group: Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

2009

Kinetic kd-Trees and Longest-Side kd-Trees.

[BibT_eX]

[DOI]

Mohammad Ali Abam

SIAM J. Comput., 2009

Matched Drawings of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Flip Graphs of Bounded-Degree Triangulations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On rectilinear duals for vertex-weighted plane graphs.

[BibT_eX]

[DOI]

Elena Mumford

Discret. Math., 2009

Polychromatic Colorings of Plane Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Edges and switches, tunnels and bridges.

[BibT_eX]

[DOI]

Comput. Geom., 2009

On minimum weight pseudo-triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Kinetic Collision Detection for Convex Fat Objects.

[BibT_eX]

[DOI]

Algorithmica, 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Area-universal rectangular layouts.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Rectangular cartograms: the game.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Detecting Hotspots in Geographic Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in GIScience, 2009

2008

Kinetic Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On the number of pseudo-triangulations of certain point sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2008

Efficient Algorithms for Maximum Regression Depth.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Discret. Comput. Geom., 2008

Feed-links for network extensions.

[BibT_eX]

[DOI]

Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Subdivision Drawings of Hypergraphs.

[BibT_eX]

[DOI]

Michael Kaufmann

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Efficient Detection of Patterns in 2D Trajectories of Moving Points.

[BibT_eX]

[DOI]

Joachim Gudmundsson

GeoInformatica, 2007

Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Algorithmic Aspects of Cartogram Computation.

[BibT_eX]

Bull. EATCS, 2007

On rectangular cartograms.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2007

On the Number of Empty Pseudo-Triangles in Point Sets.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

On (Pointed) Minimum Weight Pseudo-Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Area-preserving approximations of polygonal paths.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

2005

Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

On pseudo-convex decompositions, partitions, and coverings.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Rectangular cartograms: construction & animation.

[BibT_eX]

[DOI]

Sander Florisson

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Convexity minimizes pseudo-triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Off-line Admission Control for Advance Reservations in Star Networks.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Pointed Binary Encompassing Trees.

[BibT_eX]

[DOI]

Michael Hoffmann

Proceedings of the Algorithm Theory, 2004

Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Point Based Graphics, 2004

Efficient detection of motion patterns in spatio-temporal data sets.

[BibT_eX]

[DOI]

Joachim Gudmundsson

Proceedings of the 12th ACM International Workshop on Geographic Information Systems, 2004

2003

Tight degree bounds for pseudo-triangulations of points.

[BibT_eX]

[DOI]

Comput. Geom., 2003

The Zigzag Path of a Pseudo-Triangulation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Degree Bounds for Constrained Pseudo-Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Kinetic Collision Detection for Simple Polygons.

[BibT_eX]

[DOI]

Jack Snoeyink

Int. J. Comput. Geom. Appl., 2002

Cutting a Country for Smallest Square Fit.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

Easy triangle strips for TIN terrain models.

[BibT_eX]

[DOI]

Jack Snoeyink

Int. J. Geogr. Inf. Sci., 2001

Tight degree bounds for pseudo-triangulations of points.

[BibT_eX]

[DOI]

Lutz Kettner

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Separation Sensitive Kinetic Separation Structures for Convex Polygons.

[BibT_eX]

[DOI]