Constrained two-line center problems
From MaRDI portal
Cites work
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
- A fully dynamic algorithm for planar width
- An Expander-Based Approach to Geometric Optimization
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Approximation algorithms for a \(k\)-line center
- Approximation algorithms for orthogonal line centers
- Constrained square-center problems
- Covering a point set by two disjoint rectangles
- Dynamic planar convex hull
- Efficient randomized algorithms for some geometric optimization problems
- Generalized Selection and Ranking: Sorted Matrices
- scientific article; zbMATH DE number 432848 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- Incremental and Decremental Maintenance of Planar Width
- Minimum-width double-slabs and widest empty slabs in high dimensions
- Minimum-width double-strip and parallelogram annulus
- Off-line dynamic maintenance of the width of a planar point set
- Off-Line Maintenance of Planar Configurations
- On some geometric selection and optimization problems via sorted matrices
- On some geometric selection and optimization problems via sorted matrices
- On the complexity of locating linear facilities in the plane
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- The two-line center problem from a polar view: a new algorithm and data structure
- Triangulating a simple polygon in linear time
- Triangulating Simple Polygons and Equivalent Problems
- Visibility of disjoint polygons
This page was built for publication: Constrained two-line center problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260605)
