Minimum-perimeter intersecting polygons
From MaRDI portal
Publication:2429366
DOI10.1007/S00453-011-9516-3zbMATH Open1236.68084OpenAlexW2046670590MaRDI QIDQ2429366FDOQ2429366
Adrian Dumitrescu, Minghui Jiang
Publication date: 26 April 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-011-9516-3
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for TSP with neighborhoods in the plane
- A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
- Approximation algorithms for the Geometric Covering Salesman Problem
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
- TSP with neighborhoods of varying size
- Largest and smallest convex hulls for imprecise points
- Approximating largest convex hulls for imprecise points
- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
- An Asymptotic Expression for the Number of Solutions of a General Class of Diophantine Equations
- On the Number of Convex Lattice Polygons
Cited In (9)
- Minimum area circumscribing polygons
- THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE
- Opaque sets
- New results on stabbing segments with a polygon
- The touring rays and related problems
- Polynomial-time algorithms for the touring rays and related problems
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
- Extremal polygons with minimal perimeter
- Convex transversals
This page was built for publication: Minimum-perimeter intersecting polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429366)
