Parametric search made practical

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2002, Pages 1-9

  Van Oostrum, René ^a   Veltkamp, Remco C ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Framework for Parametric Search; Implementation

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SORTING;

PARALLEL SORTING ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 0036369037     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513400.513401     Document Type: Conference Paper

References (20)

1. Efficient algorithms for geometric optimization
2. Sorting in clog n parallel steps
3. Computing the Fréchet distance between two polygonal curves
4. Sorting networks and their applications
5. Applications of the generic programming paradigm in the design of CGAL
6. Geometric pattern matching under Euclidean motion
7. Slowing down sorting networks to obtain faster sorting algorithms
8. Parallel merge sort
9. An optimal-time algorithm for slope selection
10. Improvements on bottleneck matching and related problems using geometry
11. Fast algorithms for collision and proximity problems involving moving geometric objects
12. Combinatorial optimization with rational objective functions
13. Applying parallel computation algorithms in the design of serial algorithms
14. Labeling points with rectangles of various shapes
15. New parallel-sorting schemes
16. Computing the minimum diameter for moving points: An exact implementation using parametric search
17. Parallelism in comparison problems