| Publication | Date of Publication | Type |
|---|
| Implementing geometric algorithms robustly | 2024-06-21 | Paper |
| Adaptive learning of effective dynamics for online modeling of complex systems | 2023-09-12 | Paper |
| The centroid of points with approximate weights | 2023-05-08 | Paper |
| Maintaining the extent of a moving point set | 2022-08-19 | Paper |
| Visibility-based pursuit-evasion in a polygonal environment | 2022-08-19 | Paper |
| Recovering Hidden Components in Multimodal Data with Composite Diffusion Operators | 2022-02-03 | Paper |
| Shape part transfer via semantic latent space factorization | 2020-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633915 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643850 | 2018-05-29 | Paper |
| Functional map networks for analyzing and exploring large shape collections | 2018-04-23 | Paper |
| Relating shapes via geometric symmetries and regularities | 2018-04-23 | Paper |
| Earth mover's distances on discrete surfaces | 2018-04-23 | Paper |
| Reporting red-blue intersections between two sets of connected line segments | 2017-12-05 | Paper |
| Learning smooth objects by probing | 2017-10-20 | Paper |
| Proximity of persistence modules and their diagrams | 2017-10-20 | Paper |
| Kinetic connectivity for unit disks | 2017-09-29 | Paper |
| An empirical comparison of techniques for updating Delaunay triangulations | 2017-09-29 | Paper |
| A segment-tree based kinetic BSP | 2017-09-29 | Paper |
| Compressive Network Analysis | 2017-05-16 | Paper |
| Convolutional Wasserstein distances: efficient optimal transportation on geometric domains | 2016-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501860 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501855 | 2015-08-14 | Paper |
| Improved bounds on weak ε-nets for convex sets | 2015-05-07 | Paper |
| Near-Regular Structure Discovery Using Linear Programming | 2015-02-26 | Paper |
| Map-based exploration of intrinsic shape differences and variability | 2015-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934702 | 2014-12-18 | Paper |
| Geodesic Delaunay triangulations in bounded planar domains | 2014-11-18 | Paper |
| Witnessed k-distance | 2014-03-24 | Paper |
| Persistence-based clustering in riemannian manifolds | 2014-03-24 | Paper |
| Persistence-Based Clustering in Riemannian Manifolds | 2014-02-17 | Paper |
| A Fourier-theoretic approach for inferring symmetries | 2014-01-22 | Paper |
| Witnessed \(k\)-distance | 2013-03-18 | Paper |
| Connected dominating sets on dynamic geometric graphs | 2012-12-04 | Paper |
| Geometric algorithms for sensor networks | 2012-06-04 | Paper |
| Fourier theoretic probabilistic inference over permutations | 2012-04-17 | Paper |
| Scalar field analysis over point cloud data | 2011-11-25 | Paper |
| Euclidean skeletons using closest points | 2011-05-17 | Paper |
| Bounded Uncertainty Roadmaps for Path Planning | 2011-03-02 | Paper |
| Manifold reconstruction in arbitrary dimensions using witness complexes | 2009-07-06 | Paper |
| Manifold reconstruction in arbitrary dimensions using witness complexes | 2009-02-12 | Paper |
| Reconstruction using witness complexes | 2008-12-02 | Paper |
| On incremental rendering of silhouette maps of a polyhedral scene | 2007-10-12 | Paper |
| Toward unsupervised segmentation of semi-rigid low-resolution molecular surfaces | 2007-09-10 | Paper |
| Towards Unsupervised Segmentation of Semi-rigid Low-Resolution Molecular Surfaces | 2007-09-06 | Paper |
| A package for exact kinetic data structures and sweepline algorithms | 2007-07-04 | Paper |
| Learning smooth shapes by probing | 2007-03-15 | Paper |
| Geometric filtering of pairwise atomic interactions applied to the design of efficient statistical potentials | 2006-10-10 | Paper |
| PERSISTENCE BARCODES FOR SHAPES | 2006-05-03 | Paper |
| Efficient collision detection among moving spheres with unknown trajectories | 2006-03-21 | Paper |
| Kinetic collision detection between two simple polygons. | 2004-03-29 | Paper |
| Spanning trees crossing few barriers | 2004-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424125 | 2003-09-09 | Paper |
| Reporting red-blue intersections between two sets of connected ine segments | 2003-06-02 | Paper |
| New similarity measures between polylines with applications to morphing and polygon sweeping | 2003-03-17 | Paper |
| The earth mover's distance as a metric for image retrieval | 2003-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945503 | 2002-10-24 | Paper |
| Maintaining the extent of a moving point set | 2002-07-22 | Paper |
| Morphing between polylines | 2002-07-16 | Paper |
| Kinetic connectivity for unit disks | 2002-05-14 | Paper |
| Deformable free space tilings for kinetic collision detection. | 2002-04-21 | Paper |
| Static and kinetic geometric spanners with applications | 2002-01-30 | Paper |
| Penetration depth of two convex polytopes in 3D | 2002-01-17 | Paper |
| Controlled module density helps reconfiguration planning | 2001-10-21 | Paper |
| Morphing simple polygons | 2001-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721993 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721992 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761861 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952719 | 2001-01-29 | Paper |
| Lower bounds for kinetic planar subdivisions | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499944 | 2000-11-26 | Paper |
| Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes | 2000-11-07 | Paper |
| Voronoi Diagrams of Moving Points | 2000-11-07 | Paper |
| Rounding Arrangements Dynamically | 2000-11-07 | Paper |
| Cylindrical static and kinetic binary space partitions | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952717 | 2000-05-10 | Paper |
| A hierarchical method for real-time distance computation among moving convex bodies | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252305 | 2000-02-16 | Paper |
| Data Structures for Mobile Data | 1999-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252278 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250171 | 1999-06-17 | Paper |
| The union of moving polygonal pseudodiscs -- combinatorial bounds and applications | 1999-05-17 | Paper |
| The Robot Localization Problem | 1998-02-10 | Paper |
| The Floodlight Problem | 1997-07-27 | Paper |
| A method for obtaining randomized algorithms with small tail probabilities | 1997-03-03 | Paper |
| Reaching a goal with directional uncertainty | 1997-02-28 | Paper |
| The exact fitting problem in higher dimensions | 1996-11-17 | Paper |
| Lines in space: Combinatorics and algorithms | 1996-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848595 | 1996-03-05 | Paper |
| Vertical decompositions for triangles in 3-space | 1996-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4328185 | 1995-09-19 | Paper |
| Algorithms for bichromatic line-segment problems and polyhedral terrains | 1995-08-20 | Paper |
| Vertical decomposition of arrangements of hyperplanes in four dimensions | 1995-08-13 | Paper |
| Selecting Heavily Covered Points | 1995-04-06 | Paper |
| Improved bounds on weak \(\varepsilon\)-nets for convex sets | 1995-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138742 | 1995-03-29 | Paper |
| APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS | 1995-01-02 | Paper |
| WALKING IN AN ARRANGEMENT TOPOLOGICALLY | 1994-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138890 | 1994-09-19 | Paper |
| Ray shooting in polygons using geodesic triangulations | 1994-08-10 | Paper |
| Computing a Face in an Arrangement of Line Segments and Related Problems | 1994-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138981 | 1993-10-20 | Paper |
| Diameter, width, closest line pair, and parametric searching | 1993-09-30 | Paper |
| An efficient algorithm for finding the CSG representation of a simple polygon | 1993-09-01 | Paper |
| Constructing strongly convex approximate hulls with inaccurate primitives | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694724 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038708 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036602 | 1993-05-18 | Paper |
| The number of edges of many faces in a line segment arrangement | 1993-01-17 | Paper |
| Counting and cutting cycles of lines and rods in space | 1992-09-27 | Paper |
| Optimal placement of identical resources in a tree | 1992-06-28 | Paper |
| Randomized incremental construction of Delaunay and Voronoi diagrams | 1992-06-28 | Paper |
| Arrangements of curves in the plane --- topology, combinatorics, and algorithms | 1992-06-28 | Paper |
| A singly exponential stratification scheme for real semi-algebraic varieties and its applications | 1992-06-26 | Paper |
| Points and triangles in the plane and halving planes in space | 1992-06-25 | Paper |
| COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS | 1991-01-01 | Paper |
| Corrigendum: Topologically sweeping an arrangement | 1991-01-01 | Paper |
| The complexity of many cells in arrangements of planes and related problems | 1990-01-01 | Paper |
| Combinatorial complexity bounds for arrangements of curves and spheres | 1990-01-01 | Paper |
| The complexity and construction of many faces in arrangements of lines and of segments | 1990-01-01 | Paper |
| On arrangements of Jordan arcs with three intersections per pair | 1989-01-01 | Paper |
| A linear-time algorithm for computing the Voronoi diagram of a convex polygon | 1989-01-01 | Paper |
| The complexity of cutting complexes | 1989-01-01 | Paper |
| On the general motion-planning problem with two degrees of freedom | 1989-01-01 | Paper |
| Topologically sweeping an arrangement | 1989-01-01 | Paper |
| Visibility and intersection problems in plane geometry | 1989-01-01 | Paper |
| Optimal shortest path queries in a simple polygon | 1989-01-01 | Paper |
| Implicitly representing arrangements of lines or segments | 1989-01-01 | Paper |
| The upper envelope of piecewise linear functions: Algorithms and applications | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3481216 | 1989-01-01 | Paper |
| An O(n2) shortest path algorithm for a non-rotating convex body | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796750 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795219 | 1988-01-01 | Paper |
| Parallel computational geometry | 1988-01-01 | Paper |
| Computing convolutions by reciprocal search | 1987-01-01 | Paper |
| Solving related two- and three-dimensional linear programming problems in logarithmic time | 1987-01-01 | Paper |
| Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons | 1987-01-01 | Paper |
| Probabilistic analysis of a network resource allocation algorithm | 1986-01-01 | Paper |
| Optimal Point Location in a Monotone Subdivision | 1986-01-01 | Paper |
| Fractional cascading. I: A data structuring technique | 1986-01-01 | Paper |
| Fractional cascading. II: Applications | 1986-01-01 | Paper |
| Visibility of disjoint polygons | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687756 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3685222 | 1985-01-01 | Paper |
| Finding Extremal Polygons | 1985-01-01 | Paper |
| Primitives for the manipulation of general subdivisions and the computation of Voronoi | 1985-01-01 | Paper |
| On computing all north-east nearest neighbors in the \(L_ 1\) metric | 1983-01-01 | Paper |
| Efficient searching using partial ordering | 1981-01-01 | Paper |
| String overlaps, pattern matching, and nontransitive games | 1981-01-01 | Paper |
| Periods in strings | 1981-01-01 | Paper |
| A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm | 1980-01-01 | Paper |
| Long repetitive patterns in random sequences | 1980-01-01 | Paper |
| The analysis of double hashing | 1978-01-01 | Paper |
| The Analysis of Hashing Techniques That Exhibit k -ary Clustering | 1978-01-01 | Paper |
| Maximal Prefix-Synchronized Codes | 1978-01-01 | Paper |
| A principle of independence for binary tree searching | 1975-01-01 | Paper |
