Linear approximation of simple objects
From MaRDI portal
Publication:5906528
DOI10.1016/0925-7721(94)90015-9zbMath0807.68101OpenAlexW2021684141MaRDI QIDQ5906528
Jean-Marc Robert, Godfried T. Toussaint
Publication date: 1 March 1995
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(94)90015-9
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (3)
Continuous location of dimensional structures. ⋮ Linear approximation of simple objects ⋮ Locating a median line with partial coverage distance
Cites Work
- Finding the upper envelope of n line segments in O(n log n) time
- The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
- The upper envelope of piecewise linear functions: Algorithms and applications
- Some dynamic computational geometry problems
- Shortest paths in the plane with convex polygonal obstacles
- Geometric complexity of some location problems
- Topologically sweeping an arrangement
- Stabbing line segments
- Linear facility location. Solving extensions of the basic problem
- A convex hull algorithm for discs, and applications
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- Computing the width of a set
- Fitting hyperplanes by minimizing orthogonal deviations
- An on-line algorithm for fitting straight lines between data ranges
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear approximation of simple objects
