Pages that link to "Item:Q3183469"
From MaRDI portal
The following pages link to Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments (Q3183469):
Displaying 7 items.
- New results on stabbing segments with a polygon (Q474818) (← links)
- The maximal distance between imprecise point objects (Q533189) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Minimum-perimeter intersecting polygons (Q2429366) (← links)
- Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments (Q3188909) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
