| Publication | Date of Publication | Type |
|---|
| No quadrangulation is extremely odd | 2023-03-21 | Paper |
Filling polyhedral molds
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Quadrangulations of planar sets
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Linear approximation of simple objects
STACS 92 | 2022-08-18 | Paper |
| A comparison of rhythmic dissimilarity measures | 2021-11-18 | Paper |
| The geometry of musical rhythm. What makes a ``good'' rhythm good? | 2019-07-18 | Paper |
Simple Deterministic Algorithms for Generating “Good” Musical Rhythms
Emergent Computation | 2018-10-04 | Paper |
A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane
Computational Optimization and Applications | 2018-04-20 | Paper |
On the separability of quadrilaterals in the plane by translations and rotations
Beiträge zur Algebra und Geometrie | 2017-08-28 | Paper |
Minimum many-to-many matchings for computing the distance between two sequences
Graphs and Combinatorics | 2015-09-24 | Paper |
| The geometry of musical rhythm. What makes a ``good'' rhythm good? | 2013-02-08 | Paper |
Open guard edges and edge guards in simple polygons
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Bounded-degree polyhedronization of point sets
Computational Geometry | 2012-12-04 | Paper |
The marble frieze patterns of the cathedral of Siena: geometric structure, multi-stable perception and types of repetition
Journal of Mathematics and the Arts | 2012-10-16 | Paper |
The Continuous Hexachordal Theorem
Communications in Computer and Information Science | 2012-09-20 | Paper |
Computing signed permutations of polygons
International Journal of Computational Geometry & Applications | 2011-06-17 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Open problems in geometric methods for instance-based learning
Lecture Notes in Computer Science | 2010-02-05 | Paper |
An algorithm for computing the restriction s|caffold assignment problem in computational biology
Information Processing Letters | 2009-12-04 | Paper |
Structural properties of Euclidean rhythms
Journal of Mathematics and Music | 2009-10-21 | Paper |
Interlocking and Euclidean rhythms
Journal of Mathematics and Music | 2009-10-21 | Paper |
Computational geometric aspects of rhythm, melody, and voice-leading
Computational Geometry | 2009-10-16 | Paper |
Deflating the Pentagon
Computational Geometry and Graph Theory | 2009-01-13 | Paper |
| All polygon flip finitely\dots right? | 2008-07-21 | Paper |
The Geometry of Musical Rhythm
Discrete and Computational Geometry | 2008-03-18 | Paper |
On polyhedra induced by point sets in space
Discrete Applied Mathematics | 2007-11-30 | Paper |
Edge-unfolding nested polyhedral bands
Computational Geometry | 2007-10-19 | Paper |
Sand drawings and Gaussian graphs§
Journal of Mathematics and the Arts | 2007-09-12 | Paper |
Efficient many-to-Many point matching in one dimension
Graphs and Combinatorics | 2007-07-19 | Paper |
GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
International Journal of Computational Geometry & Applications | 2005-08-23 | Paper |
The Erdős--Nagy theorem and its ramifications
Computational Geometry | 2005-08-05 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries
Discrete & Computational Geometry | 2005-08-02 | Paper |
More classes of stuck unknotted hexagons
Beiträge zur Algebra und Geometrie | 2004-09-10 | Paper |
More classes of stuck unknotted hexagons
Beiträge zur Algebra und Geometrie | 2004-09-10 | Paper |
| scientific article; zbMATH DE number 2086251 (Why is no real title available?) | 2004-08-11 | Paper |
Space-efficient planar convex hull algorithms
Theoretical Computer Science | 2004-08-10 | Paper |
Simple Proofs of a Geometric Property of Four-Bar Linkages
The American Mathematical Monthly | 2004-06-14 | Paper |
| scientific article; zbMATH DE number 1877248 (Why is no real title available?) | 2003-11-13 | Paper |
| scientific article; zbMATH DE number 1979514 (Why is no real title available?) | 2003-09-14 | Paper |
Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
Computational Geometry | 2003-07-01 | Paper |
Implicit convex polygons
JMMA. Journal of Mathematical Modelling and Algorithms | 2003-04-27 | Paper |
Aperture-angle optimization problems in three dimensions
JMMA. Journal of Mathematical Modelling and Algorithms | 2003-04-27 | Paper |
Flipturning Polygons
Discrete & Computational Geometry | 2003-03-17 | Paper |
| scientific article; zbMATH DE number 1854302 (Why is no real title available?) | 2003-01-15 | Paper |
Some aperture-angle optimization problems
Algorithmica | 2002-12-01 | Paper |
Experimental results on quadrangulations of sets of fixed points
Computer Aided Geometric Design | 2002-08-13 | Paper |
Lower bounds for computing statistical depth.
Computational Statistics and Data Analysis | 2002-08-13 | Paper |
Locked and unlocked polygonal chains in three dimensions
Discrete & Computational Geometry | 2002-07-22 | Paper |
Every set of disjoint line segments admits a binary tree
Discrete & Computational Geometry | 2002-07-22 | Paper |
A note on reconfiguring tree linkages: Trees can lock
Discrete Applied Mathematics | 2002-05-15 | Paper |
Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications.
Studies in Locational Analysis | 2002-02-25 | Paper |
Reconfiguring convex polygons
Computational Geometry | 2002-01-14 | Paper |
A new class of stuck unknots in \(\text{Pol}_6\)
Beiträge zur Algebra und Geometrie | 2001-11-18 | Paper |
A new class of stuck unknots in \(\text{Pol}_6\)
Beiträge zur Algebra und Geometrie | 2001-11-18 | Paper |
Simple polygons with an infinite sequence of deflations
Beiträge zur Algebra und Geometrie | 2001-11-18 | Paper |
Simple polygons with an infinite sequence of deflations
Beiträge zur Algebra und Geometrie | 2001-11-18 | Paper |
Geometric and computational aspects of polymer reconfiguration
Journal of Mathematical Chemistry | 2001-06-19 | Paper |
Some constrained minimax and maximin location problems
Studies in Locational Analysis | 2001-05-13 | Paper |
| scientific article; zbMATH DE number 1555917 (Why is no real title available?) | 2001-01-24 | Paper |
COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
The Graham scan triangulates simple polygons
Pattern Recognition Letters | 2000-08-01 | Paper |
A counterexample to Tomek's consistency theorem for a condensed nearest neighbor decision rule
Pattern Recognition Letters | 2000-07-04 | Paper |
| scientific article; zbMATH DE number 1182936 (Why is no real title available?) | 1998-09-30 | Paper |
Characterizing and efficiently computing quadrangulations of planar point sets
Computer Aided Geometric Design | 1998-06-30 | Paper |
Feasibility of design in stereolithography
Algorithmica | 1998-02-04 | Paper |
Filling polyhedral molds.
CAD. Computer-Aided Design | 1998-01-01 | Paper |
Guarding polyhedral terrains
Computational Geometry | 1997-03-18 | Paper |
On Envelopes of Arrangements of Lines
Journal of Algorithms | 1996-12-16 | Paper |
All convex polyhedra can be clamped with parallel jaw grippers
Computational Geometry | 1996-10-20 | Paper |
Geometric and computational aspects of gravity casting
CAD. Computer-Aided Design | 1996-03-05 | Paper |
Growing a Tree from Its Branches
Journal of Algorithms | 1995-09-10 | Paper |
Linear approximation of simple objects
Computational Geometry | 1995-03-01 | Paper |
Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete
Information Processing Letters | 1995-01-09 | Paper |
A new look at Euclid's second proposition
The Mathematical Intelligencer | 1994-03-17 | Paper |
Editorial
Pattern Recognition Letters | 1994-01-02 | Paper |
Slicing an ear using prune-and-search
Pattern Recognition Letters | 1994-01-02 | Paper |
COMPUTING SHORTEST TRANSVERSALS OF SETS
International Journal of Computational Geometry & Applications | 1993-11-26 | Paper |
| scientific article; zbMATH DE number 432849 (Why is no real title available?) | 1993-10-20 | Paper |
Convex Hulls for Random Lines
Journal of Algorithms | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176771 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177566 (Why is no real title available?) | 1993-05-18 | Paper |
Anthropomorphic Polygons
The American Mathematical Monthly | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4211464 (Why is no real title available?) | 1991-01-01 | Paper |
Computing shortest transversals
Computing | 1991-01-01 | Paper |
Computing simple circuits from a set of line segments
Discrete & Computational Geometry | 1990-01-01 | Paper |
On geodesic properties of polygons relevant to linear time triangulation
The Visual Computer | 1989-01-01 | Paper |
Fast algorithms for computing the diameter of a finite planar set
The Visual Computer | 1988-01-01 | Paper |
Computing the link center of a simple polygon
Discrete & Computational Geometry | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060719 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4074328 (Why is no real title available?) | 1988-01-01 | Paper |
Computing the width of a set
IEEE Transactions on Pattern Analysis and Machine Intelligence | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4080989 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4041267 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4051002 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4066391 (Why is no real title available?) | 1987-01-01 | Paper |
Visibility between two edges of a simple polygon
The Visual Computer | 1986-01-01 | Paper |
Shortest path solves edge-to-edge visibility in a polygon
Pattern Recognition Letters | 1986-01-01 | Paper |
A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
Pattern Recognition Letters | 1986-01-01 | Paper |
Finding the minimum vertex distance between two disjoint convex polygons in linear time
Computers & Mathematics with Applications | 1985-01-01 | Paper |
A simple linear algorithm for intersecting convex polygons
The Visual Computer | 1985-01-01 | Paper |
A simple linear hidden-line algorithm for star-shaped polygons
Pattern Recognition Letters | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3905323 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3945378 (Why is no real title available?) | 1985-01-01 | Paper |
