Linear approximation of simple objects
From MaRDI portal
Publication:5890660
DOI10.1016/S0020-0190(97)00049-5zbMath1337.68279MaRDI QIDQ5890660
Pankaj K. Agarwal, Kasturi R. Varadarajan
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- Diameter, width, closest line pair, and parametric searching
- Geometric complexity of some location problems
- Stabbing line segments
- Linear facility location. Solving extensions of the basic problem
- Almost tight upper bounds for lower envelopes in higher dimensions
- Approximations and optimal geometric divide-and-conquer
- Computer science today. Recent trends and developments
- The overlay of lower envelopes and its applications
- Ray Shooting and Parametric Search
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Computing the width of a set
- An on-line algorithm for fitting straight lines between data ranges
- Parallelism in Comparison Problems
- Linear approximation of simple objects
This page was built for publication: Linear approximation of simple objects
