Pages that link to "Item:Q4848831"
From MaRDI portal
The following pages link to MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS (Q4848831):
Displaying 21 items.
- Algorithms for interval structures with applications (Q388095) (← links)
- New results on stabbing segments with a polygon (Q474818) (← links)
- Stabbers of line segments in the plane (Q543793) (← links)
- Computing shortest transversals (Q757096) (← links)
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- Finding transversals for sets of simple geometric figures (Q1083215) (← links)
- Minimal surface convex hulls of spheres (Q1633782) (← links)
- Stabbing segments with rectilinear objects (Q1738129) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- Efficient algorithm for transversal of disjoint convex polygons. (Q1853055) (← links)
- Polynomial-time algorithms for the touring rays and related problems (Q2039639) (← links)
- Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143) (← links)
- On intersecting a set of parallel line segments with a convex polygon of minimum area (Q2380042) (← links)
- Minimum-perimeter intersecting polygons (Q2429366) (← links)
- The touring rays and related problems (Q2662682) (← links)
- Algorithms for Interval Structures with Applications (Q3004669) (← links)
- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments (Q3183469) (← links)
- ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA (Q3405971) (← links)
- THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE (Q4903631) (← links)
- Minimizing the number of lattice points in a translated polygon (Q5741788) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
