Bettina Speckmann

Orcid: 0000-0002-8514-7858

Affiliations:
  • Eindhoven University of Technology, Netherlands


According to our database1, Bettina Speckmann authored at least 194 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Mobility Data Science: Perspectives and Challenges.
ACM Trans. Spatial Algorithms Syst., June, 2024

Sorting under partial (interval order) information.
J. Comput. Geom., 2024

Polycubes via Dual Loops.
CoRR, 2024

Complexity as Design Material.
CoRR, 2024

SimpleSets: Capturing Categorical Point Patterns with Simple Shapes.
CoRR, 2024

Greedy Monochromatic Island Partitions.
CoRR, 2024

Polycube Layouts via Iterative Dual Loops.
CoRR, 2024

Robust Bichromatic Classification using Two Lines.
CoRR, 2024

Optimal In-Place Compaction of Sliding Cubes.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Optimizing Symbol Visibility Through Displacement.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Contextual Matrix Orderings for Graph Collections.
Proceedings of the 17th IEEE Pacific Visualization Conference, 2024

Capturing the Shape of a Point Set with a Line Segment.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Scalable Harmonious Simplification of Isolines.
Proceedings of the 16th International Conference on Spatial Information Theory, 2024

Optimal In-Place Compaction of Sliding Cubes (Media Exposition).
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
A Monotone Interleaving Distance for Merge Trees.
CoRR, 2023

Towards Mobility Data Science (Vision Paper).
CoRR, 2023

Fast Reconfiguration for Programmable Matter.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Density Approximation for Moving Groups.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

A Subquadratic <i>n</i><sup>ε</sup>-approximation for the Continuous Fréchet Distance.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Data-Spatial Layouts for Grid Maps.
Proceedings of the 12th International Conference on Geographic Information Science, 2023

2022
Simultaneous Matrix Orderings for Graph Collections.
IEEE Trans. Vis. Comput. Graph., 2022

Optimal morphs of planar orthogonal drawings.
J. Comput. Geom., 2022

Crossing Numbers of Beyond-Planar Graphs Revisited.
J. Graph Algorithms Appl., 2022

Mobility Data Science (Dagstuhl Seminar 22021).
Dagstuhl Reports, 2022

Density Approximation for Kinetic Groups.
CoRR, 2022

Characterizing Uncertainty in the Visual Text Analysis Pipeline.
CoRR, 2022

A Subquadratic n<sup>ε</sup>-approximation for the Continuous Fréchet Distance.
CoRR, 2022

Obstructing Classification via Projection.
Comput. Geom. Topol., 2022

Agglomerative Clustering of Growing Squares.
Algorithmica, 2022

Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Preprocessing Imprecise Points for the Pareto Front.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Story Trees: Representing Documents using Topological Persistence.
Proceedings of the Thirteenth Language Resources and Evaluation Conference, 2022

Physically consistent map matching.
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.
Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, 2022

2021
A Simple Pipeline for Coherent Grid Maps.
IEEE Trans. Vis. Comput. Graph., 2021

Maximum Physically Consistent Trajectories.
ACM Trans. Spatial Algorithms Syst., 2021

Compacting Squares.
CoRR, 2021

Diverse Partitions of Colored Points.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Volume from Outlines on Terrains.
Proceedings of the 11th International Conference on Geographic Information Science, 2021

Harmonious Simplification of Isolines.
Proceedings of the 11th International Conference on Geographic Information Science, 2021

Coordinated Schematization for Visualizing Mobility Patterns on Networks.
Proceedings of the 11th International Conference on Geographic Information Science, 2021

Route Reconstruction from Traffic Flow via Representative Trajectories.
Proceedings of the SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems, 2021

Polygon-Universal Graphs.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

Near-Delaunay Metrics.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

Stable Visual Summaries for Trajectory Collections.
Proceedings of the 14th IEEE Pacific Visualization Symposium, 2021

2020
Guest Editors' Foreword.
Discret. Comput. Geom., 2020

Quantitative Comparison of Time-Dependent Treemaps.
Comput. Graph. Forum, 2020

Ordered Strip Packing.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Uncertainty Treemaps.
Proceedings of the 2020 IEEE Pacific Visualization Symposium, 2020

2019
10 Reasons to Get Interested in Graph Drawing.
Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

SolarView: Low Distortion Radial Embedding with a Focus.
IEEE Trans. Vis. Comput. Graph., 2019

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

Computing representative networks for braided rivers.
J. Comput. Geom., 2019

Non-crossing paths with geographic constraints.
Discret. Math. Theor. Comput. Sci., 2019

Spatially and Temporally Coherent Visual Summaries.
CoRR, 2019

Locally correct Fréchet matchings.
Comput. Geom., 2019

SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Optimal Morphs of Planar Orthogonal Drawings II.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Preprocessing Ambiguous Imprecise Points.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

A Practical Algorithm for Spatial Agglomerative Clustering.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018
Stable Treemaps via Local Moves.
IEEE Trans. Vis. Comput. Graph., 2018

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

Homotopic 𝒞-oriented routing with few links and thick edges.
Comput. Geom., 2018

Colored spanning graphs for set visualization.
Comput. Geom., 2018

Computing the similarity between moving curves.
Comput. Geom., 2018

A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Volume-based similarity of linear features on terrains.
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

Social Network-Epistemology.
Proceedings of the 14th IEEE International Conference on e-Science, 2018

Optimal Algorithms for Compact Linear Layouts.
Proceedings of the IEEE Pacific Visualization Symposium, 2018

2017
Multi-Granular Trend Detection for Time-Series Analysis.
IEEE Trans. Vis. Comput. Graph., 2017

Column planarity and partially-simultaneous geometric embedding.
J. Graph Algorithms Appl., 2017

Packing plane spanning trees and paths in complete geometric graphs.
Inf. Process. Lett., 2017

A Framework for Algorithm Stability.
CoRR, 2017

Complexity Measures for Mosaic Drawings.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Computing the Fréchet Distance between Real-Valued Surfaces.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Non-Crossing Geometric Steiner Arborescences.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Kinetic Data Structures.
Encyclopedia of Algorithms, 2016

Visual Encoding of Dissimilarity Data via Topology-Preserving Map Deformation.
IEEE Trans. Vis. Comput. Graph., 2016

Area-Preserving Simplification and Schematization of Polygonal Subdivisions.
ACM Trans. Spatial Algorithms Syst., 2016

Strict confluent drawing.
J. Comput. Geom., 2016

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

Convex-Arc Drawings of Pseudolines.
CoRR, 2016

Distance-sensitive planar point location.
Comput. Geom., 2016

Circles in the Water: Towards Island Group Labeling.
Proceedings of the Geographic Information Science - 9th International Conference, 2016

Modeling Checkpoint-Based Movement with the Earth Mover's Distance.
Proceedings of the Geographic Information Science - 9th International Conference, 2016

Grouping Time-Varying Data for Interactive Exploration.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

An Improved Lower Bound on the Minimum Number of Triangulations.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Geo word clouds.
Proceedings of the 2016 IEEE Pacific Visualization Symposium, 2016

2015
Exploring Curved Schematization of Territorial Outlines.
IEEE Trans. Vis. Comput. Graph., 2015

Trajectory grouping structure.
J. Comput. Geom., 2015

Algorithms for Necklace Maps.
Int. J. Comput. Geom. Appl., 2015

Improved Grid Map Layout by Point Set Matching.
Int. J. Comput. Geom. Appl., 2015

Mosaic Drawings and Cartograms.
Comput. Graph. Forum, 2015

Angle-Restricted Steiner Arborescences for Flow Map Layout.
Algorithmica, 2015

Geometric <i>k</i> Shortest Paths.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Towards Characterizing Graphs with a Sliceable Rectangular Dual.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Trajectory Grouping Structure under Geodesic Distance.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Clustered edge routing.
Proceedings of the 2015 IEEE Pacific Visualization Symposium, 2015

2014
Moving beyond the point: An agenda for research in movement analysis with real data.
Comput. Environ. Urban Syst., 2014

Stenomaps: Shorthand for shapes.
IEEE Trans. Vis. Comput. Graph., 2014

Similarity of trajectories taking into account geographic context.
J. Spatial Inf. Sci., 2014

Plane Graphs with Parity Constraints.
Graphs Comb., 2014

On the Number of Regular Edge Labelings.
Discret. Math. Theor. Comput. Sci., 2014

Treemaps with bounded aspect ratio.
Comput. Geom., 2014

Triangulating and guarding realistic polygons.
Comput. Geom., 2014

Map Schematization with Circular Arcs.
Proceedings of the Geographic Information Science - 8th International Conference, 2014

Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations.
Proceedings of the Geographic Information Science - 8th International Conference, 2014

Column Planarity and Partial Simultaneous Geometric Embedding.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Geometric kth Shortest Paths: the Applet.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Computing the Fréchet distance with shortcuts is NP-hard.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Trajectory Grouping Structure: the Video.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Exploring Curved Schematization.
Proceedings of the IEEE Pacific Visualization Symposium, 2014

2013
KelpFusion: A Hybrid Set Visualization Technique.
IEEE Trans. Vis. Comput. Graph., 2013

Trajectory Grouping Structures
CoRR, 2013

Maximizing maximal angles for plane straight-line graphs.
Comput. Geom., 2013

Distance-Sensitive Planar Point Location.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Accentuating focus maps via partial schematization.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

Colored Spanning Graphs for Set Visualization.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Kinetic 2-centers in the black-box model.
Proceedings of the Symposium on Computational Geometry 2013, 2013

2012
Shooting Permanent Rays among Disjoint Polygons in the Plane.
SIAM J. Comput., 2012

Area-Universal and Constrained Rectangular Layouts.
SIAM J. Comput., 2012

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

Guest Editor's Foreword.
J. Graph Algorithms Appl., 2012

Kelp Diagrams: Point Set Membership Visualization.
Comput. Graph. Forum, 2012

Evolution Strategies for Optimizing Rectangular Cartograms.
Proceedings of the Geographic Information Science - 7th International Conference, 2012

Context-Aware Similarity of Trajectories.
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.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Flow Map Layout via Spiral Trees.
IEEE Trans. Vis. Comput. Graph., 2011

Connect the dot: Computing feed-links for network extension.
J. Spatial Inf. Sci., 2011

Geometric Simultaneous Embeddings of a Graph and a Matching.
J. Graph Algorithms Appl., 2011

On Planar Supports for Hypergraphs.
J. Graph Algorithms Appl., 2011

Empty pseudo-triangles in point sets.
Discret. Appl. Math., 2011

A new method for subdivision simplification with applications to urban-area generalization.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

A splitting line model for directional relations.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Delineating imprecise regions via shortest-path graphs.
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.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

The 2x2 Simple Packing Problem.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Necklace Maps.
IEEE Trans. Vis. Comput. Graph., 2010

Finding the Most Relevant Fragments in Networks.
J. Graph Algorithms Appl., 2010

Optimal BSPs and Rectilinear Cartograms.
Int. J. Comput. Geom. Appl., 2010

Pointed binary encompassing trees: Simple and optimal.
Comput. Geom., 2010

Algorithmic Aspects of Proportional Symbol Maps.
Algorithmica, 2010

Homotopic Rectilinear Routing with Few Links and Thick Edges.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Area-Preserving Subdivision Schematization.
Proceedings of the Geographic Information Science, 6th International Conference, 2010

Optimizing Regular Edge Labelings.
Proceedings of the Graph Drawing - 18th International Symposium, 2010

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

10491 Abstracts Collection - Representation, Analysis and Visualization of Moving Objects.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Results of the break-out group: Aggregation.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

2009
Kinetic kd-Trees and Longest-Side kd-Trees.
SIAM J. Comput., 2009

Matched Drawings of Planar Graphs.
J. Graph Algorithms Appl., 2009

Flip Graphs of Bounded-Degree Triangulations.
Electron. Notes Discret. Math., 2009

On rectilinear duals for vertex-weighted plane graphs.
Discret. Math., 2009

Polychromatic Colorings of Plane Graphs.
Discret. Comput. Geom., 2009

Edges and switches, tunnels and bridges.
Comput. Geom., 2009

On minimum weight pseudo-triangulations.
Comput. Geom., 2009

Kinetic Collision Detection for Convex Fat Objects.
Algorithmica, 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Area-universal rectangular layouts.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Rectangular cartograms: the game.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Detecting Hotspots in Geographic Networks.
Proceedings of the Advances in GIScience, 2009

2008
Kinetic Data Structures.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On the number of pseudo-triangulations of certain point sets.
J. Comb. Theory A, 2008

Efficient Algorithms for Maximum Regression Depth.
Discret. Comput. Geom., 2008

Feed-links for network extensions.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Subdivision Drawings of Hypergraphs.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007
Efficient Detection of Patterns in 2D Trajectories of Moving Points.
GeoInformatica, 2007

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

Algorithmic Aspects of Cartogram Computation.
Bull. EATCS, 2007

On rectangular cartograms.
Comput. Geom., 2007

Editorial.
Comput. Geom., 2007

On the Number of Empty Pseudo-Triangles in Point Sets.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

On (Pointed) Minimum Weight Pseudo-Triangulations.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Area-preserving approximations of polygonal paths.
J. Discrete Algorithms, 2006

2005
Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations.
Discret. Comput. Geom., 2005

On pseudo-convex decompositions, partitions, and coverings.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Rectangular cartograms: construction & animation.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

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

Convexity minimizes pseudo-triangulations.
Comput. Geom., 2004

Off-line Admission Control for Advance Reservations in Star Networks.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Pointed Binary Encompassing Trees.
Proceedings of the Algorithm Theory, 2004

Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces.
Proceedings of the 1st Symposium on Point Based Graphics, 2004

Efficient detection of motion patterns in spatio-temporal data sets.
Proceedings of the 12th ACM International Workshop on Geographic Information Systems, 2004

2003
Tight degree bounds for pseudo-triangulations of points.
Comput. Geom., 2003

The Zigzag Path of a Pseudo-Triangulation.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Degree Bounds for Constrained Pseudo-Triangulations.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Kinetic Collision Detection for Simple Polygons.
Int. J. Comput. Geom. Appl., 2002

Cutting a Country for Smallest Square Fit.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons.
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001
Easy triangle strips for TIN terrain models.
Int. J. Geogr. Inf. Sci., 2001

Tight degree bounds for pseudo-triangulations of points.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Separation Sensitive Kinetic Separation Structures for Convex Polygons.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000


  Loading...