Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Sorting in c log n parallel steps
Combinatorica
SIAM Journal on Computing
An optimal-time algorithm for slope selection
SIAM Journal on Computing
Introduction to algorithms
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Fast algorithms for collision and proximity problems involving moving geometric objects
Computational Geometry: Theory and Applications
Geometric pattern matching under Euclidean motion
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Computing the minimum diameter for moving points: an exact implementation using parametric search
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Simple algorithms for partial point set pattern matching under rigid motion
Pattern Recognition
Computing the least quartile difference estimator in the plane
Computational Statistics & Data Analysis
Geodesic Fréchet distance inside a simple polygon
ACM Transactions on Algorithms (TALG)
Link distance and shortest path problems in the plane
Computational Geometry: Theory and Applications
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
In this paper we show that in sorting-based applications of parametric search, Quicksort can replace the parallel sorting algorithms that are usually advocated, and we argue that Cole's optimization of certain parametric-search algorithms may be unnecessary under realistic assumptions about the input. Furthermore, we present a generic, flexible, and easy-to-use framework that greatly simplifies the implementation of algorithms based on parametric search. We use our framework to implement an algorithm that solves the Fréchet-distance problem. The implementation based on parametric search is faster than the binary-search approach that is often suggested as a practical replacement for the parametric-search technique.