A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center

DOI10.1016/S0925-7721(03)00017-8zbMath1030.65011MaRDI QIDQ1405006

Kasturi R. Varadarajan, Cecilia M. Procopiuc, Pankaj K. Agarwal

Publication date: 25 August 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsshape fitting2-line-center problemprojective clustering

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

Approximation algorithms for orthogonal line centers ⋮ Approximation algorithms for orthogonal line centers ⋮ Analysis of incomplete data and an intrinsic-dimension Helly theorem ⋮ APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric complexity of some location problems
• Efficient randomized algorithms for some geometric optimization problems
• On the complexity of locating linear facilities in the plane
• Computing the width of a set
• The two-line center problem from a polar view: a new algorithm and data structure
• On some geometric selection and optimization problems via sorted matrices
• Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus

This page was built for publication: A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center