Bettina Speckmann

According to our database1, Bettina Speckmann authored at least 180 papers between 1997 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

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

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

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

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

Agglomerative Clustering of Growing Squares.
Proceedings of the LATIN 2018: Theoretical Informatics, 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

Non-crossing paths with geographic constraints.
CoRR, 2017

A Framework for Algorithm Stability.
CoRR, 2017

Agglomerative Clustering of Growing Squares.
CoRR, 2017

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs.
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

Non-crossing Paths with Geographic Constraints.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

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

Computing Representative Networks for Braided Rivers.
Proceedings of the 33rd International Symposium on Computational Geometry, 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 and Systems, 2016

Strict confluent drawing.
JoCG, 2016

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

Colored Spanning Graphs for Set Visualization.
CoRR, 2016

Grouping Time-varying Data for Interactive Exploration.
CoRR, 2016

Convex-Arc Drawings of Pseudolines.
CoRR, 2016

Distance-Sensitive Planar Point Location.
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.
JoCG, 2015

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

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

Computing the Similarity Between Moving Curves.
CoRR, 2015

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

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

Geometric k 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

Computing the Similarity Between Moving Curves.
Proceedings of the Algorithms - ESA 2015, 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.
Computers, Environment and Urban Systems, 2014

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

Similarity of trajectories taking into account geographic context.
J. Spatial Information Science, 2014

Plane Graphs with Parity Constraints.
Graphs and Combinatorics, 2014

On the Number of Regular Edge Labelings.
Discrete Mathematics & Theoretical Computer Science, 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, GD 2014, Würzburg, 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

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs.
Proceedings of the 26th Canadian Conference 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

Flip Graphs of Bounded Degree Triangulations.
Graphs and Combinatorics, 2013

Trajectory Grouping Structures
CoRR, 2013

Strict Confluent Drawing.
CoRR, 2013

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

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

Trajectory Grouping Structure.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 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

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

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

Improved grid map layout by point set matching.
Proceedings of the IEEE Pacific Visualization Symposium, 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.
JoCG, 2012

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

Locally Correct Frechet Matchings
CoRR, 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

Locally Correct Fréchet Matchings.
Proceedings of the Algorithms - ESA 2012, 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 Information Science, 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.
Discrete Applied Mathematics, 2011

Angle-Restricted Steiner Arborescences for Flow Map Layout
CoRR, 2011

Angle-Restricted Steiner Arborescences for Flow Map Layout.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Treemaps with Bounded Aspect Ratio.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 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. Geometry Appl., 2010

Treemaps with Bounded Aspect Ratio
CoRR, 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, GD 2010, Konstanz, 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.
Electronic Notes in Discrete Mathematics, 2009

On rectilinear duals for vertex-weighted plane graphs.
Discrete Mathematics, 2009

Polychromatic Colorings of Plane Graphs.
Discrete & Computational Geometry, 2009

Area-Universal Rectangular Layouts
CoRR, 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

Plane Graphs with Parity Constraints.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Geometric Simultaneous Embeddings of a Graph and a Matching.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

On Planar Supports for Hypergraphs.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Shooting permanent rays among disjoint polygons in the plane.
Proceedings of the 25th ACM Symposium on Computational Geometry, 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

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

Efficient Algorithms for Maximum Regression Depth.
Discrete & Computational Geometry, 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, GD 2008, Heraklion, Crete, 2008

Kinetic kd-Trees and Longest-Side kd-Trees.
Proceedings of the Data Structures, 17.02. - 22.02.2008, 2008

Polychromatic colorings of plane graphs.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Triangulating and Guarding Realistic Polygons.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 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 and Combinatorics, 2007

Algorithmic Aspects of Cartogram Computation.
Bulletin of the EATCS, 2007

Maximizing Maximal Angles for Plane Straight-Line Graphs
CoRR, 2007

Edges and Switches, Tunnels and Bridges
CoRR, 2007

On rectangular cartograms.
Comput. Geom., 2007

Editorial.
Comput. Geom., 2007

Edges and Switches, Tunnels and Bridges.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Maximizing Maximal Angles for Plane Straight-Line Graphs.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Matched Drawings of Planar Graphs.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Kinetic KD-trees and longest-side KD-trees.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 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

Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Optimal BSPs and rectilinear cartograms.
Proceedings of the 14th ACM International Symposium on Geographic Information Systems, 2006

Algorithmic Aspects of Proportional Symbol Maps.
Proceedings of the Algorithms, 2006

Kinetic Collision Detection for Convex Fat Objects.
Proceedings of the Algorithms, 2006

2005
Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations.
Discrete & Computational Geometry, 2005

On Rectilinear Duals for Vertex-Weighted Plane Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 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 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

On Rectangular Cartograms.
Proceedings of the Algorithms, 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

Allocating vertex pi-guards in simple polygons via pseudo-triangulations.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

On the Number of Pseudo-Triangulations of Certain Point Sets.
Proceedings of the 15th Canadian Conference on Computational Geometry, 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. Geometry 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, Barcelona, 2002

Convexity minimizes pseudo-triangulations.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Easy triangle strips for TIN terrain models.
International Journal of Geographical Information Science, 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

Kinetic collision detection for simple polygons.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Efficient Algorithms for Maximum Regression Depth.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1997
Easy triangle strips for tin terrain models.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997


  Loading...