Construction of three-dimensional Delaunay triangulations using local transformations
Computer Aided Geometric Design
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Combinatorial face enumeration in convex polytopes
Computational Geometry: Theory and Applications
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Generating random polygons with given vertices
Computational Geometry: Theory and Applications
Enumeration of noncrossing trees on a circle
Proceedings of the 7th conference on Formal power series and algebraic combinatorics
Geometric tree graphs of points in convex position
Discrete Applied Mathematics - Special issue on the 13th European workshop on computational geometry CG '97
Analytic combinatorics of non-crossing configurations
Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
Hamilton cycles in the path graph of a set of points in convex position
Computational Geometry: Theory and Applications
Enumerating order types for small sets with applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
On local transformation of polygons with visibility properties
Theoretical Computer Science
On the diameter of geometric path graphs of points in convex position
Information Processing Letters
Amortized efficiency of generating planar paths in convex position
Theoretical Computer Science
| Hi-index | 0.89 |
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (fe) is inserted such that the resulting object belongs to the same class as the original object. Here, we consider Hamiltonian planar paths as geometric objects. A technique is presented for transforming a given planar path into another one for a set S of n points in convex position in the plane. Under these conditions, we show that any planar path can be transformed into another planar path by at most 2n-5 flips. For the case when the points are in general position we provide experimental results regarding transformability of any planar path into another. We show that for n=