Bettina Speckmann

Bettina Speckmann's AcademicInfluence.com Rankings

Bettina Speckmann

Computer Science

#4280

World Rank

#4503

Historical Rank

Database

#8580

World Rank

#8991

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Bettina Speckmann Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Bettina Speckmann is a German computer scientist who heads the Applied Geometric Algorithms group in the Department of Mathematics and Computer Science of Eindhoven University of Technology in Eindhoven, Netherlands, where she is a professor. The main topics of her research are computational geometry and information visualization, especially focusing on the geometry and visualization of objects in motion.

(See a Problem?)

Bettina Speckmann's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Efficient detection of motion patterns in spatio-temporal data sets (2004) (171)
On rectangular cartograms (2004) (161)
Analysis and visualisation of movement: an interdisciplinary review (2015) (151)
Flow Map Layout via Spiral Trees (2011) (138)
Efficient Detection of Patterns in 2D Trajectories of Moving Points (2007) (130)
Kinetic collision detection for simple polygons (2000) (125)
KelpFusion: A Hybrid Set Visualization Technique (2013) (97)
Kinetic Data Structures (2008) (79)
Kelp Diagrams: Point Set Membership Visualization (2012) (78)
Area-Universal and Constrained Rectangular Layouts (2012) (73)
Necklace Maps (2010) (65)
Subdivision Drawings of Hypergraphs (2009) (56)
Analysis and visualization of animal movement (2012) (54)
Easy triangle strips for TIN terrain models (2001) (54)
On Planar Supports for Hypergraphs (2009) (52)
Similarity of trajectories taking into account geographic context (2014) (52)
Context-Aware Similarity of Trajectories (2012) (50)
Allocating Vertex π-Guards in Simple Polygons via Pseudo-Triangulations (2003) (49)
On rectilinear duals for vertex-weighted plane graphs (2005) (48)
Trajectory grouping structure (2013) (47)
Improved grid map layout by point set matching (2013) (47)
Area-preserving approximations of polygonal paths (2006) (42)
Tight degree bounds for pseudo-triangulations of points (2003) (41)
Optimal BSPs and rectilinear cartograms (2006) (39)
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons (2002) (37)
Evolution Strategies for Optimizing Rectangular Cartograms (2012) (37)
Stable Treemaps via Local Moves (2018) (37)
Computing the Fréchet distance with shortcuts is NP-hard (2013) (35)
Efficient Algorithms for Maximum Regression Depth (1999) (33)
Area-universal rectangular layouts (2009) (33)
A Linear Programming Approach to Rectangular Cartograms (2006) (33)
A new method for subdivision simplification with applications to urban-area generalization (2011) (33)
On the Number of Pseudo-Triangulations of Certain Point Sets (2006) (32)
Polychromatic Colorings of Plane Graphs (2008) (31)
Convexity minimizes pseudo-triangulations (2004) (31)
Algorithmic Aspects of Proportional Symbol Maps (2006) (31)
Mosaic Drawings and Cartograms (2015) (31)
Computational Geometry (1997) (29)
Moving beyond the point: An agenda for research in movement analysis with real data (2014) (28)
Area-Preserving Subdivision Schematization (2010) (27)
The Zigzag Path of a Pseudo-Triangulation (2003) (26)
Area-Preserving Simplification and Schematization of Polygonal Subdivisions (2016) (26)
Angle-Restricted Steiner Arborescences for Flow Map Layout (2011) (24)
Colored Spanning Graphs for Set Visualization (2013) (23)
KelpFusion: a Hybrid Set Visualization Technique. (2013) (23)
Vulnerability in Social Epistemic Networks (2020) (22)
Strict confluent drawing (2013) (22)
Locally Correct Frechet Matchings (2012) (22)
Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces (2004) (21)
Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations (2014) (21)
Detecting Hotspots in Geographic Networks (2009) (21)
Geometric Simultaneous Embeddings of a Graph and a Matching (2009) (20)
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs (2017) (20)
Treemaps with bounded aspect ratio (2010) (20)
Delineating imprecise regions via shortest-path graphs (2011) (19)
Map Schematization with Circular Arcs (2014) (19)
Geo word clouds (2016) (19)
Topologically Safe Curved Schematisation (2013) (18)
SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension (2018) (18)
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles (2006) (17)
Trajectory Grouping Structure under Geodesic Distance (2015) (17)
Rectangular cartograms: construction & animation (2005) (17)
Degree Bounds for Constrained Pseudo-Triangulations (2003) (17)
Kinetic 2-centers in the black-box model (2013) (17)
On minimum weight pseudo-triangulations (2009) (17)
Quantitative Comparison of Time‐Dependent Treemaps (2019) (16)
Visual Encoding of Dissimilarity Data via Topology-Preserving Map Deformation (2016) (16)
Accentuating focus maps via partial schematization (2013) (16)
Simultaneous visualization of language endangerment and language description (2018) (15)
Kinetic KD-trees and longest-side KD-trees (2007) (15)
Plane Graphs with Parity Constraints (2009) (14)
Edges and Switches, Tunnels and Bridges (2007) (14)
Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes (2012) (14)
Connect the dot: Computing feed-links for network extension (2011) (14)
Kinetic Collision Detection for Convex Fat Objects (2006) (14)
Angle-Restricted Steiner Arborescences for Flow Map Layout (2011) (14)
Matched Drawings of Planar Graphs (2007) (13)
Clustered edge routing (2015) (13)
Geometry and Topology of Estuary and Braided River Channel Networks Automatically Extracted From Topographic Data (2019) (13)
Trajectory Grouping Structures (2013) (12)
Computing Representative Networks for Braided Rivers (2017) (12)
Maximizing maximal angles for plane straight-line graphs (2007) (12)
Tripod � a minimalist data structure for embedded triangulations (2005) (12)
Grouping Time-varying Data for Interactive Exploration (2016) (12)
Geometric k Shortest Paths (2015) (12)
Exploring Curved Schematization of Territorial Outlines (2015) (11)
A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs (2018) (11)
The vulnerability of tidal flats and multi-channel estuaries to dredging and disposal (2019) (11)
Off-line Admission Control for Advance Reservations in Star Networks (2004) (11)
Kinetic convex hulls and delaunay triangulations in the black-box model (2011) (11)
Shooting permanent rays among disjoint polygons in the plane (2009) (11)
Separation Sensitive Kinetic Separation Structures for Convex Polygons (2000) (10)
A Simple Pipeline for Coherent Grid Maps (2020) (10)
Column planarity and partially-simultaneous geometric embedding (2014) (10)
Homotopic Rectilinear Routing with Few Links and Thick Edges (2010) (9)
Optimizing Regular Edge Labelings (2010) (9)
Can Real Social Epistemic Networks Deliver the Wisdom of Crowds? (2020) (9)
A splitting line model for directional relations (2011) (9)
An Improved Lower Bound on the Minimum Number of Triangulations (2016) (9)
Multi-Granular Trend Detection for Time-Series Analysis (2017) (9)
A philosophical perspective on visualization for digital humanities (2018) (9)
Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model (2012) (8)
Rectangular cartogram computation with sea regions (2005) (8)
Computing the Fréchet Distance between Real-Valued Surfaces (2017) (8)
Preprocessing Ambiguous Imprecise Points (2019) (7)
Pointed Binary Encompassing Trees (2004) (7)
Exploring Curved Schematization (2014) (7)
Triangulating and Guarding Realistic Polygons (2014) (7)
Uncertainty Treemaps (2020) (7)
Finding the Most Relevant Fragments in Networks (2010) (7)
SolarView: Low Distortion Radial Embedding with a Focus (2019) (6)
Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 9135 (2015) (6)
Stenomaps: Shorthand for shapes (2014) (6)
Simultaneous Matrix Orderings for Graph Collections (2021) (6)
Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary (2017) (6)
10 Reasons to Get Interested in Graph Drawing (2019) (6)
Spatially and Temporally Coherent Visual Summaries (2019) (6)
Cutting a Country for Smallest Square Fit (2002) (6)
On pseudo-convex decompositions, partitions, and coverings (2005) (5)
Homotopic 𝒞-oriented routing with few links and thick edges (2018) (5)
Agglomerative Clustering of Growing Squares (2017) (5)
Flip Graphs of Bounded Degree Triangulations (2009) (5)
Geometric kth Shortest Paths: the Applet (2014) (5)
GlottoVis: Visualizing language endangerment and documentation (2017) (5)
Computing the Similarity Between Moving Curves (2015) (5)
Mobility Data Science (Dagstuhl Seminar 22021) (2022) (4)
A formal approach to the automated labeling of groups of features (2015) (4)
Modeling Checkpoint-Based Movement with the Earth Mover's Distance (2016) (4)
GlamMap: Geovisualization for e-humanities (2016) (4)
Geometry and topology of estuary and braided river channel networks extracted from topographic data (2018) (4)
Non-crossing Paths with Geographic Constraints (2017) (4)
Computing representative networks for braided rivers (2017) (4)
Trajectory Grouping Structure: the Video (2014) (4)
On the Number of Empty Pseudo-Triangles in Point Sets (2007) (4)
Connect the Dot: Computing Feed-Links with Minimum Dilation (2009) (4)
Kinetic volume-based persistence for 1D terrains (2019) (4)
Guarding Fat Polygons and Triangulating Guarded Polygons (2007) (4)
Optimal Morphs of Planar Orthogonal Drawings II (2019) (3)
Stable Visual Summaries for Trajectory Collections (2019) (3)
An improved lower bound on the number of triangulations (2016) (3)
Alluvial connectivity in multi‐channel networks in rivers and estuaries (2021) (3)
Convex-Arc Drawings of Pseudolines (2016) (3)
GlamMap: visualizing library metadata (2014) (3)
Graph Drawing : 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011. Revised Selected Papers (2012) (3)
On (Pointed) Minimum Weight Pseudo-Triangulations (2007) (3)
Feed-links for network extensions (2008) (3)
Towards Characterizing Graphs with a Sliceable Rectangular Dual (2015) (3)
A Framework for Algorithm Stability (2017) (3)
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares (2021) (3)
Obstructing Classification via Projection (2021) (3)
Area-Preserving C-Oriented Schematization ∗ (2011) (3)
Distance-Sensitive Planar Point Location (2013) (2)
Algorithms for Necklace Maps (2015) (2)
Fréchet isotopies to monotone curves (2017) (2)
Automata, Languages, and Programming (2015) (2)
A Practical Algorithm for Spatial Agglomerative Clustering (2019) (2)
Coordinated Schematization for Visualizing Mobility Patterns on Networks (2021) (2)
Optimal Algorithms for Compact Linear Layouts (2018) (2)
Eecient Algorithms for Maximum Regression Depth (1999) (2)
Volume-based similarity of linear features on terrains (2018) (2)
Polygon-Universal Graphs (2021) (2)
Computational Geometry: Fundamental Structures * (2005) (2)
10491 Summary - Representation, Analysis and Visualization of Moving Objects (2010) (2)
Rectangular cartograms: the game (2009) (2)
The effects of dredging and disposal activity on the resilience of estuary morphodynamics (2018) (2)
Story Trees: Representing Documents using Topological Persistence (2022) (1)
Proceedings of the 19th international conference on Graph Drawing (2011) (1)
Sea regions for rectangular cartograms (2014) (1)
A Subquadratic nε-approximation for the Continuous Fréchet Distance (2023) (1)
Visual Analytics for the World's Library Data (2015) (1)
Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022) (2016) (1)
Social Network-Epistemology (2018) (1)
Circles in the Water: Towards Island Group Labeling (2016) (1)
Simplification with Parallelism (2020) (1)
Agglomerative Clustering of Growing Squares (2021) (1)
A KDS for discrete Morse-Smale complexes (2018) (1)
Empty pseudo-triangles in point sets (2011) (1)
Complexity Measures for Mosaic Drawings (2017) (1)
Non-crossing drawings of multiple geometric Steiner arborescences (2017) (1)
Non-Crossing Geometric Steiner Arborescences (2017) (1)
The 2x2 Simple Packing Problem (2011) (1)
Better Hit the Nail on the Head than Beat around the Bush: Removing Protected Attributes with a Single Projection (2022) (1)
Kinetic kd-trees (2007) (1)
One-to-one Point Set Matchings for Grid Map Layout ∗ (2012) (1)
Maximum Physically Consistent Trajectories (2019) (1)
2 Computing the Similarity Between Moving Curves (2015) (0)
Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks (2018) (0)
Fast Reconfiguration for Programmable Matter (2022) (0)
Guest Editors’ Foreword (2020) (0)
A Subquadratic $n^\epsilon$-approximation for the Continuous Fr\'echet Distance (2022) (0)
[Segments of double ureter]. (1978) (0)
Guest Editors’ Foreword (2020) (0)
Kinetic Euclidean 2-centers in the Black-Box Model ⇤ (2013) (0)
Guidelines for the SoCG Program Committee (2022) (0)
Editorial (Special issue on 21st European Workshop on Computational Geometry (EWCG 2005), Eindhoven, The Netherlands, March 9-11, 2005) (2007) (0)
Automatic schematization with curved lines (2014) (0)
Optimal morphs of planar orthogonal drawings (2018) (0)
Kinetic Collision Detection for Low-Density Scenes in the Black-Box Model (2012) (0)
Characterizing Uncertainty in the Visual Text Analysis Pipeline (2022) (0)
Distance-sensitive point location made easy (2014) (0)
Kinetic collision detection for balls rolling on a plane (2006) (0)
Guidelines for SoCG Reviewing The CG Steering Committee (2021) (0)
Crossing Numbers of Beyond-Planar Graphs Revisited (2021) (0)
Colour patterns for polychromatic four-colourings of rectangular subdivisions (2008) (0)
The 1st ACM SIGSPATIAL International Workshop on Computing with Multifaceted Movement Data (MOVE++ 2019) (2020) (0)
Physically consistent map matching (2022) (0)
Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter (2022) (0)
Density Approximation for Moving Groups (2022) (0)
Dagstuhl-seminar 01121, ''computational Geometry'' Three-dimensional Mesh Generation for Domains with Small Angles a Separation Bound for Real Algebraic Expressions (0)
Near-Delaunay Metrics (2021) (0)
Orthogonal Schematization with Minimum Homotopy Area (2020) (0)
Abstracts for the twentyfirst European workshop on Computational geometry, Technische Universiteit Eindhoven, The Netherlands, March 9-11, 2005 (2005) (0)
Automated Construction of Rectangular Cartograms (2005) (0)
Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition) (2020) (0)
Automated Construction of Rectangular Cartograms 1 (2005) (0)
Diverse Voronoi Partitions of 1D Colored Points∗ (2020) (0)
Algorithms for Context-Aware Trajectory Analysis (2011) (0)
Special issue for the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, Kyoto, Japan (2018) (0)
Plane Graphs with Parity Constraints (2012) (0)
Algorithms for flow maps (2007) (0)
Optimal straight-line labels for island groups (2015) (0)
Algorithmic Aspects of Cartogram Computation (2007) (0)
On Counting Lines rather than Pages The CG Steering Committee and the SoCG 2019 PC Chairs (2018) (0)
On the Number of Regular Edge Labelings (2014) (0)
Preprocessing Imprecise Points for the Pareto Front (2021) (0)
Flip Graphs of Bounded Degree Triangulations (2012) (0)
VAST International Program Committee (2019) (0)
Automatic and objective extraction of channel networks from topography in systems (2019) (0)
Kinetic convex hulls in the black-box model (2011) (0)
Compacting Squares (2021) (0)
Graph visualization (Invited talk) (2012) (0)
Maximum Physically Consistent Trajectories (2021) (0)
10491 Results of the break-out group: Aggregation (2010) (0)
Diverse Partitions of Colored Points (2021) (0)
The Path of a Pseudo-Triangulation (2002) (0)
Meeting report Analysis and visualization of animal movement (2016) (0)
Analysis and visualisation of movement: an interdisciplinary review (2015) (0)
Pointed Encompassing Trees ( Extended (2004) (0)
54 : 2 Non-Crossing Geometric (2017) (0)
Density Approximation for Kinetic Groups (2022) (0)
Harmonious Simplification of Isolines (2021) (0)
34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary (2018) (0)
Convex treemaps with bounded aspect ratio (2011) (0)
Guest Editor's Foreword (Special Issue with Selected Papers from the 19th International Symposium on Graph Drawing, GD 2011) (2012) (0)
Ordered Strip Packing (2020) (0)
Volume from Outlines on Terrains (2021) (0)
Pointed encompassing trees (2004) (0)
Route Reconstruction from Traffic Flow via Representative Trajectories (2020) (0)
Placing diagrams and symbols on maps (2008) (0)
Post-masters Programme Software Technology X 00tic Automated Construction of Rectangular Cartograms 1 Object-based Updating of Land-use Maps of Ur- Ban Areas Using Satellite Remote Sensing Analytical Software Design Case Maglev Stage Software Project for Philips Applied Technolo- Gies Advertorials (2005) (0)

This paper list is powered by the following services:

Other Resources About Bettina Speckmann

en.wikipedia.org

What Schools Are Affiliated With Bettina Speckmann?

Bettina Speckmann is affiliated with the following schools:

Bettina Speckmann's Academic­Influence.com Rankings