Linear approximation of simple objects

DOI10.1007/3-540-55210-3_187zbMath1493.68376OpenAlexW1608900095MaRDI QIDQ5096785

Jean-Marc Robert, Godfried T. Toussaint

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_187

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Efficient piecewise-linear function approximation using the uniform metric

Cites Work

• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• The upper envelope of piecewise linear functions: Algorithms and applications
• Geometric complexity of some location problems
• Topologically sweeping an arrangement
• Stabbing line segments
• Linear facility location. Solving extensions of the basic problem
• Computing the width of a set
• An on-line algorithm for fitting straight lines between data ranges