| Publication | Date of Publication | Type |
|---|
| The complexity of geodesic spanners | 2024-10-18 | Paper |
| The complexity of geodesic spanners | 2024-10-16 | Paper |
| A subquadratic \(n^\varepsilon\)-approximation for the continuous Fréchet distance | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065409 | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065436 | 2023-11-14 | Paper |
| The Spiroplot App (Media Exposition) | 2023-11-02 | Paper |
| Space-aware reconfiguration | 2023-05-12 | Paper |
| On fully diverse sets of geometric objects and graphs | 2023-05-05 | Paper |
| Reconstructing Graphs from Connected Triples | 2023-03-12 | Paper |
| Computing the maximum overlap of two convex polygons under translations | 2023-01-25 | Paper |
| Connected component and simple polygon intersection searching | 2023-01-18 | Paper |
| On fat partitioning, fat covering and the union size of polygons | 2023-01-18 | Paper |
| Filling polyhedral molds | 2023-01-18 | Paper |
| Intersection queries in sets of disks | 2022-12-09 | Paper |
| Two- and three- dimensional point location in rectangular subdivisions | 2022-12-09 | Paper |
| Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric | 2022-12-09 | Paper |
| Concatenable segment trees | 2022-08-16 | Paper |
| Competitive Searching for a Line on a Line Arrangement. | 2022-07-21 | Paper |
| Convex partial transversals of planar regions | 2022-07-21 | Paper |
| Mapping multiple regions to the grid with bounded Hausdorff distance | 2022-03-25 | Paper |
| Diverse partitions of colored points | 2022-03-25 | Paper |
| 10 reasons to get interested in graph drawing | 2022-02-16 | Paper |
| Linear-time reconstruction of Delaunay triangulations with applications | 2021-12-20 | Paper |
| Between shapes, using the Hausdorff distance | 2021-12-15 | Paper |
| Space-Aware Reconfiguration | 2021-09-20 | Paper |
| Topological stability of kinetic \(k\)-centers | 2021-04-14 | Paper |
| On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance | 2020-08-18 | Paper |
| On optimal polyline simplification using the Hausdorff and Fréchet distance | 2020-08-04 | Paper |
| Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary | 2020-05-27 | Paper |
| Computing representative networks for braided rivers | 2020-01-13 | Paper |
| Topological Stability of Kinetic k-centers | 2019-10-15 | Paper |
| Geometry and Generation of a New Graph Planarity Game | 2019-09-16 | Paper |
| Segmentation of Trajectories on Non-Monotone Criteria | 2019-05-15 | Paper |
| The Painter’s Problem: Covering a Grid with Colored Connected Polygons | 2019-02-20 | Paper |
| Segmentation of Trajectories on Nonmonotone Criteria | 2018-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580125 | 2018-08-13 | Paper |
| A Refined Definition for Groups of Moving Entities and Its Computation | 2018-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5745397 | 2018-06-05 | Paper |
| A Refined Definition for Groups of Moving Entities and its Computation | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606291 | 2018-03-02 | Paper |
| Colored spanning graphs for set visualization | 2018-02-19 | Paper |
| Grouping time-varying data for interactive exploration | 2018-01-30 | Paper |
| The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd Simulation | 2018-01-30 | Paper |
| Embedding rivers in polyhedral terrains | 2017-10-20 | Paper |
| Trajectory Grouping Structure under Geodesic Distance | 2017-10-10 | Paper |
| Schematization of road networks | 2017-09-29 | Paper |
| Good NEWS | 2017-09-29 | Paper |
| Approximation algorithms for aligning points | 2017-09-29 | Paper |
| Packing plane spanning trees and paths in complete geometric graphs | 2017-06-13 | Paper |
| Trajectory grouping structure | 2017-03-30 | Paper |
| Labeling a rectilinear map more efficiently | 2016-06-16 | Paper |
| Improved Grid Map Layout by Point Set Matching | 2015-11-03 | Paper |
| Google Scholar makes it hard -- the complexity of organizing one's publications | 2015-09-15 | Paper |
| Computing similarity between piecewise-linear functions | 2014-04-03 | Paper |
| Computing Correlation between Piecewise-Linear Functions | 2014-02-04 | Paper |
| Colored Spanning Graphs for Set Visualization | 2013-12-20 | Paper |
| On planar supports for hypergraphs | 2013-11-28 | Paper |
| Trajectory Grouping Structure | 2013-08-12 | Paper |
| Median trajectories | 2013-06-25 | Paper |
| Time-Space Maps from Triangulations | 2013-04-03 | Paper |
| How Many Potatoes Are in a Mesh? | 2013-03-21 | Paper |
| Blocking Delaunay triangulations | 2012-12-04 | Paper |
| GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON | 2012-11-23 | Paper |
| Empty pseudo-triangles in point sets | 2012-03-19 | Paper |
| Finding long and similar parts of trajectories | 2011-12-28 | Paper |
| Bold graph drawings | 2011-12-28 | Paper |
| Peeling meshed potatoes | 2011-05-10 | Paper |
| Geometric Simultaneous Embeddings of a Graph and a Matching | 2011-04-19 | Paper |
| Preprocessing Imprecise Points and Splitting Triangulations | 2011-04-04 | Paper |
| The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs | 2011-02-11 | Paper |
| Algorithmic aspects of proportional symbol maps | 2010-09-27 | Paper |
| Median Trajectories | 2010-09-06 | Paper |
| On Planar Supports for Hypergraphs | 2010-04-27 | Paper |
| Geometric Simultaneous Embeddings of a Graph and a Matching | 2010-04-27 | Paper |
| Largest bounding box, smallest diameter, and related problems on imprecise points | 2010-03-16 | Paper |
| Optimization for first order Delaunay triangulations | 2010-03-16 | Paper |
| Largest and smallest convex hulls for imprecise points | 2010-02-23 | Paper |
| Matched Drawings of Planar Graphs | 2010-02-04 | Paper |
| Planar bichromatic minimum spanning trees | 2009-12-10 | Paper |
| Connect the Dot: Computing Feed-Links with Minimum Dilation | 2009-10-20 | Paper |
| Wooden geometric puzzles: Design and hardness proofs | 2009-08-06 | Paper |
| Optimal higher order Delaunay triangulations of polygons | 2009-06-30 | Paper |
| Edges and switches, tunnels and bridges | 2009-06-30 | Paper |
| Towards a definition of higher order constrained Delaunay triangulations | 2009-03-09 | Paper |
| Placing Text Boxes on Graphs | 2009-03-03 | Paper |
| Subdivision Drawings of Hypergraphs | 2009-03-03 | Paper |
| Approximating largest convex hulls for imprecise points | 2009-02-23 | Paper |
| Edges and Switches, Tunnels and Bridges | 2009-02-17 | Paper |
| Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points | 2009-02-17 | Paper |
| Optimization for First Order Delaunay Triangulations | 2009-02-17 | Paper |
| Region-restricted clustering for geographic data mining | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601537 | 2009-02-10 | Paper |
| Preprocessing Imprecise Points and Splitting Triangulations | 2009-01-29 | Paper |
| Visibility Maps of Segments and Triangles in 3D | 2009-01-27 | Paper |
| Efficient algorithms for maximum regression depth | 2008-08-19 | Paper |
| On realistic terrains | 2008-07-29 | Paper |
| Geodesic Disks and Clustering in a Simple Polygon | 2008-05-27 | Paper |
| REGION INTERVISIBILITY IN TERRAINS | 2008-05-14 | Paper |
| Optimal Higher Order Delaunay Triangulations of Polygons | 2008-04-15 | Paper |
| Delineating boundaries for imprecise regions | 2008-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5452284 | 2008-03-25 | Paper |
| Matched Drawings of Planar Graphs | 2008-03-25 | Paper |
| Visibility maps of segments and triangles in 3D | 2008-03-13 | Paper |
| Region-Restricted Clustering for Geographic Data Mining | 2008-03-11 | Paper |
| Algorithmic Aspects of Proportional Symbol Maps | 2008-03-11 | Paper |
| Approximating Largest Convex Hulls for Imprecise Points | 2008-02-20 | Paper |
| Wooden Geometric Puzzles: Design and Hardness Proofs | 2007-11-15 | Paper |
| Largest and Smallest Tours and Convex Hulls for Imprecise Points | 2007-09-07 | Paper |
| Schematisation of Tree Drawings | 2007-08-28 | Paper |
| Approximate unions of lines and Minkowski sums | 2007-06-21 | Paper |
| On rectangular cartograms | 2007-06-04 | Paper |
| Generating realistic terrains with higher-order Delaunay triangulations | 2007-03-12 | Paper |
| Area-preserving approximations of polygonal paths | 2007-02-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA | 2006-03-13 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Schematization of networks | 2005-05-12 | Paper |
| Constrained higher order Delaunay triangulations | 2005-05-12 | Paper |
| GOOD NEWS: PARTITIONING A SIMPLE POLYGON BY COMPASS DIRECTIONS | 2004-11-01 | Paper |
| Approximation algorithms for aligning points | 2004-09-22 | Paper |
| Facility location on a polyhedral surface | 2004-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425945 | 2003-09-14 | Paper |
| Translating a regular grid over a point set | 2003-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4792739 | 2003-02-17 | Paper |
| Higher order Delaunay triangulations | 2002-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753939 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4947407 | 2000-04-18 | Paper |
| Point labeling with sliding labels | 2000-02-09 | Paper |
| Label placement by maximum independent set in rectangles | 1999-04-11 | Paper |
| Computing the maximum overlap of two convex polygons under translations | 1998-11-11 | Paper |
| On fat partitioning, fat covering and the union size of polygons | 1998-09-07 | Paper |
| Filling polyhedral molds. | 1998-01-01 | Paper |
| Determining the castability of simple polyhedra | 1997-08-25 | Paper |
| Trekking in the alps without freezing or getting tired | 1997-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344150 | 1997-07-14 | Paper |
| AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS | 1997-03-31 | Paper |
| Folding rulers inside triangles | 1996-09-22 | Paper |
| Connected component and simple polygon intersection searching | 1996-07-23 | Paper |
| Point location in zones of \(k\)-flats in arrangements | 1996-07-14 | Paper |
| Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions | 1996-02-26 | Paper |
| IMPLICIT POINT LOCATION IN ARRANGEMENTS OF LINE SEGMENTS, WITH AN APPLICATION TO MOTION PLANNING | 1995-04-06 | Paper |
| Rectilinear decompositions with low stabbing number | 1995-01-09 | Paper |
| Efficient ray shooting and hidden surface removal | 1994-08-10 | Paper |
| Concatenable structures for decomposable problems | 1994-06-09 | Paper |
| The power of parallel projection | 1994-01-09 | Paper |
| Intersection Queries in Curved Objects | 1993-12-06 | Paper |
| Union-copy structures and dynamic segment trees | 1993-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694764 | 1993-06-29 | Paper |
| SHORTEST PATH QUERIES IN RECTILINEAR WORLDS | 1993-04-01 | Paper |
| Intersection queries in sets of disks | 1992-12-14 | Paper |
| Divided \(k-d\) trees | 1992-06-27 | Paper |
| Finding squares and rectangles in sets of points | 1991-01-01 | Paper |
| Maintaining range trees in secondary memory. Part I: Partitions | 1990-01-01 | Paper |
