Pages that link to "Item:Q1317860"
From MaRDI portal
The following pages link to The complexity of detecting crossingfree configurations in the plane (Q1317860):
Displaying 14 items.
- Covering points with orthogonal polygons (Q496708) (← links)
- Reconstructing polygons from scanner data (Q553352) (← links)
- Configurations with few crossings in topological graphs (Q876504) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Enumerating constrained non-crossing minimally rigid frameworks (Q946684) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- A Bottleneck Matching Problem with Edge-Crossing Constraints (Q2792796) (← links)
- Covering oriented points in the plane with orthogonal polygons is NP-complete (Q2883577) (← links)
- Reconstruction of Weakly Simple Polygons from Their Edges (Q3177902) (← links)
- Connected Rectilinear Graphs on Point Sets (Q3611865) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- Non-crossing geometric steiner arborescences (Q5136274) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
