Pages that link to "Item:Q2380042"
From MaRDI portal
The following pages link to On intersecting a set of parallel line segments with a convex polygon of minimum area (Q2380042):
Displaying 12 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)
- The directed Hausdorff distance between imprecise point sets (Q553353) (← links)
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- Stabbing segments with rectilinear objects (Q1738129) (← links)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← 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)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
