Hamiltonian triangulations and circumscribing polygons of disjoint line segments
From MaRDI portal
(Redirected from Publication:1200910)
Recommendations
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A Theorem on Planar Graphs
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- A linear-time algorithm for finding a minimum spanning pseudoforest
- An efficient algorithm for determining the convex hull of a finite planar set
- Computing Simple Circuits from a Set of Line Segments is NP-Complete
- Computing simple circuits from a set of line segments
- Geometry Helps in Matching
- Hamiltonian cycles in planar triangulations with no separating triangles
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
- Traveling salesman cycles are not always subgraphs of Voronoi duals
- Triangulating a simple polygon in linear time
Cited in
(17)- On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane
- On a counterexample to a conjecture of Mirzaian
- On hamiltonian triangulations in simple polygons (Extended Abstract)
- Segment endpoint visibility graphs are Hamiltonian
- Graham triangulations and triangulations with a center are Hamiltonean
- On circumscribing polygons for line segments
- Non-Hamiltonian triangulations with distant separating triangles
- Two segment classes with Hamiltonian visibility graphs
- On the visibility graph of convex translates
- Circumscribing polygons and polygonizations for disjoint line segments
- The visibility graph of congruent discs is Hamiltonian
- Arc diagrams, flip distances, and Hamiltonian triangulations
- On the perfect matching of disjoint compact sets by noncrossing line segments in \(\mathbb R^n\)
- Compatible geometric matchings
- Compatible spanning trees
- Hamiltonian-connectedness of triangulations with few separating triangles
- scientific article; zbMATH DE number 7559209 (Why is no real title available?)
This page was built for publication: Hamiltonian triangulations and circumscribing polygons of disjoint line segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200910)
