On planar path transformation

DOI10.1016/J.IPL.2007.05.009MaRDI QIDQ2379998zbMATH OpenOpenAlexFDO

Authors Md. Kamrul Islam, Selim G. Akl, Henk Meijer

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.05.009

zbMATH Keywords

flipcomputational geometryenumerationdirected pathHamiltonian planar path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Flips in planar graphs
• Amortized efficiency of generating planar paths in convex position
• Planar tree transformation: results and counterexample
• Flipping edges in triangulations

Cites work

• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Analytic combinatorics of non-crossing configurations
• Combinatorial face enumeration in convex polytopes
• Enumerating order types for small sets with applications
• Enumeration of noncrossing trees on a circle
• Flips in planar graphs
• Generating random polygons with given vertices
• Generating rooted triangulations without repetitions
• Geometric tree graphs of points in convex position
• Graphs of non-crossing perfect matchings
• Hamilton cycles in the path graph of a set of points in convex position
• On local transformation of polygons with visibility properties.
• Reverse search for enumeration
• Topologically sweeping visibility complexes via pseudotriangulations
• Transforming triangulations

Cited in

(10)

• scientific article; zbMATH DE number 1512759 (Why is no real title available?)
• The Number of Flips Required to Obtain Non-crossing Convex Cycles
• Flipping plane spanning paths
• scientific article; zbMATH DE number 1504747 (Why is no real title available?)
• On the diameter of geometric path graphs of points in convex position
• Planar tree transformation: results and counterexample
• Short flip sequences to untangle segments in the plane
• Flips in planar graphs
• Reconstruction of the path graph
• Amortized efficiency of generating planar paths in convex position

This page was built for publication: On planar path transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379998)