Convex transversals
From MaRDI portal
Publication:390129
DOI10.1016/j.comgeo.2012.10.009zbMath1281.65027OpenAlexW2913347331MaRDI QIDQ390129
Esther M. Arkin, Claudia Dieckmann, Lena Schlipf, Valentin Polishchuk, Joseph S. B. Mitchell, Christian Knauer, Shang Yang
Publication date: 22 January 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.10.009
convex polygontransversalspolynomial-time algorithmNP-hardapproximate symmetryapproximate convexityimprecise input
Related Items
New results on stabbing segments with a polygon ⋮ Stabbing segments with rectilinear objects ⋮ Stabbing circles for sets of segments in the plane ⋮ Largest and smallest area triangles on imprecise points ⋮ Convex partial transversals of planar regions ⋮ Characterization of extremal antipodal polygons
Cites Work
- Unnamed Item
- Largest and smallest convex hulls for imprecise points
- Testing approximate symmetry in the plane is NP-hard
- On computing a set of points meeting every cell defined by a family of polynomials on a variety
- Estimation of a convex function: Characterizations and asymptotic theory.
- Minimum-perimeter intersecting polygons
- Stabbing parallel segments with a convex polygon
- Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
- Estimating a Convex Function in Nonparametric Regression
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Geometry helps in bottleneck matching and related problems
