| Publication | Date of Publication | Type |
|---|
| No quadrangulation is extremely odd | 2023-03-21 | Paper |
| Filling polyhedral molds | 2023-01-18 | Paper |
| Quadrangulations of planar sets | 2022-12-16 | Paper |
| Linear approximation of simple objects | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5859848 | 2021-11-18 | Paper |
| The Geometry of Musical Rhythm | 2019-07-18 | Paper |
| Simple Deterministic Algorithms for Generating “Good” Musical Rhythms | 2018-10-04 | Paper |
| A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane | 2018-04-20 | Paper |
| On the separability of quadrilaterals in the plane by translations and rotations | 2017-08-28 | Paper |
| Minimum many-to-many matchings for computing the distance between two sequences | 2015-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4906197 | 2013-02-08 | Paper |
| Open Guard Edges and Edge Guards in Simple Polygons | 2013-01-07 | Paper |
| Bounded-degree polyhedronization of point sets | 2012-12-04 | Paper |
| The Continuous Hexachordal Theorem | 2012-09-20 | Paper |
| COMPUTING SIGNED PERMUTATIONS OF POLYGONS | 2011-06-17 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| An algorithm for computing the restriction s|caffold assignment problem in computational biology | 2009-12-04 | Paper |
| Structural properties of Euclidean rhythms | 2009-10-21 | Paper |
| Interlocking and Euclidean rhythms | 2009-10-21 | Paper |
| Computational geometric aspects of rhythm, melody, and voice-leading | 2009-10-16 | Paper |
| Deflating the Pentagon | 2009-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3514523 | 2008-07-21 | Paper |
| The Geometry of Musical Rhythm | 2008-03-18 | Paper |
| On polyhedra induced by point sets in space | 2007-11-30 | Paper |
| Edge-unfolding nested polyhedral bands | 2007-10-19 | Paper |
| Sand drawings and Gaussian graphs§ | 2007-09-12 | Paper |
| Efficient many-to-Many point matching in one dimension | 2007-07-19 | Paper |
| GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING | 2005-08-23 | Paper |
| The Erdős--Nagy theorem and its ramifications | 2005-08-05 | Paper |
| Output-sensitive algorithms for computing nearest-neighbour decision boundaries | 2005-08-02 | Paper |
| More classes of stuck unknotted hexagons | 2004-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044350 | 2004-08-11 | Paper |
| Space-efficient planar convex hull algorithms | 2004-08-10 | Paper |
| Simple Proofs of a Geometric Property of Four-Bar Linkages | 2004-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4797604 | 2003-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427858 | 2003-09-14 | Paper |
| Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. | 2003-07-01 | Paper |
| Implicit convex polygons | 2003-04-27 | Paper |
| Aperture-angle optimization problems in three dimensions | 2003-04-27 | Paper |
| Flipturning Polygons | 2003-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789806 | 2003-01-15 | Paper |
| Some aperture-angle optimization problems | 2002-12-01 | Paper |
| Experimental results on quadrangulations of sets of fixed points | 2002-08-13 | Paper |
| Lower bounds for computing statistical depth. | 2002-08-13 | Paper |
| Every set of disjoint line segments admits a binary tree | 2002-07-22 | Paper |
| A note on reconfiguring tree linkages: Trees can lock | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2704992 | 2002-02-25 | Paper |
| Reconfiguring convex polygons | 2002-01-14 | Paper |
| A new class of stuck unknots in \(\text{Pol}_6\) | 2001-11-18 | Paper |
| Simple polygons with an infinite sequence of deflations | 2001-11-18 | Paper |
| Geometric and computational aspects of polymer reconfiguration | 2001-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2704991 | 2001-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525680 | 2001-01-24 | Paper |
| COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON | 2000-11-07 | Paper |
| The Graham scan triangulates simple polygons | 2000-08-01 | Paper |
| A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule | 2000-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401033 | 1998-09-30 | Paper |
| Characterizing and efficiently computing quadrangulations of planar point sets | 1998-06-30 | Paper |
| Feasibility of design in stereolithography | 1998-02-04 | Paper |
| Filling polyhedral molds. | 1998-01-01 | Paper |
| Guarding polyhedral terrains | 1997-03-18 | Paper |
| On Envelopes of Arrangements of Lines | 1996-12-16 | Paper |
| All convex polyhedra can be clamped with parallel jaw grippers | 1996-10-20 | Paper |
| Geometric and computational aspects of gravity casting | 1996-03-05 | Paper |
| Growing a Tree from Its Branches | 1995-09-10 | Paper |
| Linear approximation of simple objects | 1995-03-01 | Paper |
| Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete | 1995-01-09 | Paper |
| A new look at Euclid's second proposition | 1994-03-17 | Paper |
| Slicing an ear using prune-and-search | 1994-01-02 | Paper |
| Editorial | 1994-01-02 | Paper |
| COMPUTING SHORTEST TRANSVERSALS OF SETS | 1993-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138983 | 1993-10-20 | Paper |
| Convex Hulls for Random Lines | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036601 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037437 | 1993-05-18 | Paper |
| Anthropomorphic Polygons | 1992-06-27 | Paper |
| Computing shortest transversals | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3358207 | 1991-01-01 | Paper |
| Computing simple circuits from a set of line segments | 1990-01-01 | Paper |
| On geodesic properties of polygons relevant to linear time triangulation | 1989-01-01 | Paper |
| Fast algorithms for computing the diameter of a finite planar set | 1988-01-01 | Paper |
| Computing the link center of a simple polygon | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795225 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3805747 | 1988-01-01 | Paper |
| Computing the width of a set | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3811771 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779744 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787491 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3799659 | 1987-01-01 | Paper |
| Visibility between two edges of a simple polygon | 1986-01-01 | Paper |
| Shortest path solves edge-to-edge visibility in a polygon | 1986-01-01 | Paper |
| A linear-time algorithm for solving the strong hidden-line problem in a simple polygon | 1986-01-01 | Paper |
| Finding the minimum vertex distance between two disjoint convex polygons in linear time | 1985-01-01 | Paper |
| A simple linear algorithm for intersecting convex polygons | 1985-01-01 | Paper |
| A simple linear hidden-line algorithm for star-shaped polygons | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683086 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716329 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716330 | 1985-01-01 | Paper |
| An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons | 1984-01-01 | Paper |
| Complexity, convexity, and unimodality | 1984-01-01 | Paper |
| A new linear algorithm for triangulating monotone polygons | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4741714 | 1983-01-01 | Paper |
| Efficient algorithms for computing the maximum distance between two finite planar sets | 1983-01-01 | Paper |
| The symmetric all-furthest-neighbor problem | 1983-01-01 | Paper |
| Applications of a two-dimensional hidden-line algorithm to other geometric problems | 1983-01-01 | Paper |
| Computing largest empty circles with location constraints | 1983-01-01 | Paper |
| Optimal algorithms for computing the minimum distance between two finite planar sets | 1983-01-01 | Paper |
| A counterexample to an algorithm for computing monotone hulls of simple polygons | 1983-01-01 | Paper |
| An upper bound on the probability of misclassification in terms of Matusita's measure of affinity | 1982-01-01 | Paper |
| On the multimodality of distances in convex polygons | 1982-01-01 | Paper |
| A Counterexample to a Diameter Algorithm for Convex Polygons | 1982-01-01 | Paper |
| A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets | 1982-01-01 | Paper |
| A simple proof of Pach's extremal theorem for convex polygons | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3967064 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3969899 | 1982-01-01 | Paper |
| A note on linear expected time algorithms for finding convex hulls | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3920971 | 1981-01-01 | Paper |
| The relative neighbourhood graph of a finite planar set | 1980-01-01 | Paper |
| Classification of atypical cells in the automatic cytoscreening for cervical cancer | 1979-01-01 | Paper |
| Experiments in Text Recognition with the Modified Viterbi Algorithm | 1979-01-01 | Paper |
| A bottom-up and top-down approach to using context in text recognition | 1979-01-01 | Paper |
| An improved algorithm to check for polygon similarity | 1978-01-01 | Paper |
| The use of context in pattern recognition | 1978-01-01 | Paper |
| A fast convex hull algorithm | 1978-01-01 | Paper |
| Probability of Error, Expected Divergence, and the Affinity of Several Distributions | 1978-01-01 | Paper |
| On the detection of structures in noisy pictures | 1977-01-01 | Paper |
| A Generalization of Shannon's Equivocation and the Fano Bound | 1977-01-01 | Paper |
| Subjective clustering and bibliography of books on pattern recognition | 1975-01-01 | Paper |
| Sharper lower bounds for discrimination information in terms of variation (Corresp.) | 1975-01-01 | Paper |
| Comments on "On a New Class of Bounds on Bayes' Risk in Multihypothesis Pattern Recognition" | 1975-01-01 | Paper |
| Some properties of Matusita's measure of affinity of several distributions | 1974-01-01 | Paper |
| 313. Generalisations of π: some applications | 1974-01-01 | Paper |
| Bibliography on estimation of misclassification | 1974-01-01 | Paper |
| Polynomial Representation of Classifiers with Independent Discrete-Valued Features | 1972-01-01 | Paper |
| Some Inequalities Between Distance Measures for Feature Evaluation | 1972-01-01 | Paper |
| Feature evaluation with quadratic mutual information | 1972-01-01 | Paper |
| Some Upper Bounds on Error Probability for Multiclass Pattern Recognition | 1971-01-01 | Paper |
| Some Functional Lower Bounds on the Expected Divergence for Multihypothesis Pattern Recognition, Communication, and Radar Systems | 1971-01-01 | Paper |
| Algorithms for Recognizing Contour-Traced Handprinted Characters | 1970-01-01 | Paper |
| On a Simple Minkowski Metric Classifier | 1970-01-01 | Paper |
| Use of Contextual Constraints in Recognition of Contour-Traced Handprinted Characters | 1970-01-01 | Paper |
