Pages that link to "Item:Q583232"
From MaRDI portal
The following pages link to Computing simple circuits from a set of line segments (Q583232):
Displaying 17 items.
- Pointed binary encompassing trees: simple and optimal (Q733553) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Alternating paths through disjoint line segments (Q1014442) (← links)
- Polygonizations of point sets in the plane (Q1093906) (← links)
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments (Q1200910) (← links)
- On a counterexample to a conjecture of Mirzaian (Q1200912) (← links)
- Two segment classes with Hamiltonian visibility graphs (Q1334612) (← links)
- Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete (Q1341680) (← links)
- Segment endpoint visibility graphs are Hamiltonian (Q1395575) (← links)
- Topics on line segments and polygons (Q1916383) (← links)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Compatible spanning trees (Q2444309) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← links)
- Augmenting Geometric Graphs with Matchings (Q5014140) (← links)
- (Q5088936) (← links)
- On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (Q5951972) (← links)
