Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Explicit expanders and the Ramanujan conjectures
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Sorting in c log n parallel steps
Combinatorica
An optimal-time algorithm for slope selection
SIAM Journal on Computing
Optimal slope selection via expanders
Information Processing Letters
Approximations and optimal geometric divide-and-conquer
Selected papers of the 23rd annual ACM symposium on Theory of computing
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
A Note on Linear Time Algorithms for Maximum Error Histograms
IEEE Transactions on Knowledge and Data Engineering
Exploiting duality in summarization with deterministic guarantees
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Fitting a Step Function to a Point Set
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Approximating Points by a Piecewise Linear Function: I
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Weighted rectilinear approximation of points in the plane
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A randomized algorithm for weighted approximation of points by a step function
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Fitting a Step Function to a Point Set
Algorithmica - Special Issue: European Symposium on Algorithms
A deterministic algorithm for fitting a step function to a weighted point-set
Information Processing Letters
| Hi-index | 0.89 |
We study the problem of searching for a vertex with a desired property in the arrangement of a set of lines in the plane. We show that this problem can be solved efficiently by modifying (and simplifying) two slope selection algorithms without using parametric search. We apply this result to a points approximation problem and obtain an optimal solution for it without using parametric search. Since this line arrangement searching problem is quite natural, our result may find other applications as well.