Pages that link to "Item:Q1825657"
From MaRDI portal
The following pages link to On separating two simple polygons by a single translation (Q1825657):
Displaying 16 items.
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- An optimal algorithm for one-separation of a set of isothetic polygons (Q707337) (← links)
- Separating two simple polygons by a sequence of translations (Q1104080) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- Assembly sequences for polyhedra (Q1892580) (← links)
- A polygonal approximation for general 4-contours corresponding to weakly simple curves (Q2127283) (← links)
- Embedding graphs into embedded graphs (Q2205635) (← links)
- On the separability of quadrilaterals in the plane by translations and rotations (Q2400117) (← links)
- (Q4734798) (← links)
- Translating polygons with applications to hidden surface removal (Q5056092) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q5056155) (← links)
- Separating translates in the plane: Combinatorial bounds and an algorithm (Q5056170) (← links)
- Embedding Graphs into Embedded Graphs (Q5136253) (← links)
- Computing the minimal perimeter polygon for digital objects in the triangular tiling (Q6671384) (← links)