The following pages link to (Q4945513):
Displaying 16 items.
- Diffuse reflection diameter in simple polygons (Q299067) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Settling the bound on the rectilinear link radius of a simple rectilinear polygon (Q1944045) (← links)
- Combining discrete and continuous optimization to solve kinodynamic motion planning problems (Q2358063) (← links)
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons (Q2446331) (← links)
- On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane (Q2446340) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Link Distance and Shortest Path Problems in the Plane (Q3638449) (← links)
- Euclidean Steiner Spanners: Light and Sparse (Q5043642) (← links)
- Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons (Q5056907) (← links)
- A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
- Cutting polygons into small pieces with chords: Laser-based localization (Q5874470) (← links)
- Traversing a set of points with a minimum number of turns (Q5901749) (← links)
