Pages that link to "Item:Q1688854"
From MaRDI portal
The following pages link to Recognizing weakly simple polygons (Q1688854):
Displaying 13 items.
- Linear-time algorithms for weakly-monotone polygons (Q685601) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- Embedding graphs into embedded graphs (Q2205635) (← links)
- Piercing pairwise intersecting geodesic disks (Q2230402) (← links)
- A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
- Recognizing weakly simple polygons (Q3132840) (← links)
- Reconstruction of Weakly Simple Polygons from Their Edges (Q3177902) (← links)
- Reconstruction of weakly simple polygons from their edges (Q4636492) (← links)
- Atomic Embeddability, Clustered Planarity, and Thickenability (Q5066950) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Crossing minimization in perturbed drawings (Q5896138) (← links)
- Crossing minimization in perturbed drawings (Q5915943) (← links)
- Finding weakly simple closed quasigeodesics on polyhedral spheres (Q6145671) (← links)