On planar path transformation
From MaRDI portal
Publication:2379998
DOI10.1016/J.IPL.2007.05.009zbMATH Open1184.68551OpenAlexW2114125964MaRDI QIDQ2379998FDOQ2379998
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
Recommendations
Cites Work
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Geometric tree graphs of points in convex position
- Analytic combinatorics of non-crossing configurations
- Reverse search for enumeration
- Generating rooted triangulations without repetitions
- Transforming triangulations
- Enumeration of noncrossing trees on a circle
- Flips in planar graphs
- Topologically sweeping visibility complexes via pseudotriangulations
- Graphs of non-crossing perfect matchings
- Generating random polygons with given vertices
- Hamilton cycles in the path graph of a set of points in convex position
- On local transformation of polygons with visibility properties.
- Combinatorial face enumeration in convex polytopes
- Enumerating order types for small sets with applications
Cited In (10)
- Short flip sequences to untangle segments in the plane
- Reconstruction of the path graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Amortized efficiency of generating planar paths in convex position
- The Number of Flips Required to Obtain Non-crossing Convex Cycles
- Flipping plane spanning paths
- On the diameter of geometric path graphs of points in convex position
- Planar tree transformation: results and counterexample
- Flips in planar graphs
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)
