Parallel line centers with guaranteed separation

DOI10.1016/J.COMGEO.2025.102185MaRDI QIDQ6964868zbMATH OpenFDO

Authors Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn

Publication date 4 July 2025

Published in Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

geometric optimizationseparationwidthslabline center

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
• A simple algorithm for computing the zone of a line in an arrangement of lines
• An efficient algorithm for determining the convex hull of a finite planar set
• An optimal algorithm for the boundary of a cell in a union of rays
• Approximation algorithms for a \(k\)-line center
• Computing the width of a set
• Geometric approximation algorithms
• Minimum-width double-slabs and widest empty slabs in high dimensions
• Minimum-width double-strip and parallelogram annulus
• On the complexity of locating linear facilities in the plane
• Support-vector networks
• The power of geometric duality
• The two-line center problem from a polar view: a new algorithm and data structure

This page was built for publication: Parallel line centers with guaranteed separation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964868)