The following pages link to Parametric search made practical (Q598230):
Displaying 15 items.
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- Can we compute the similarity between surfaces? (Q848860) (← links)
- The maximin line problem with regional demand (Q872234) (← links)
- Computing the least quartile difference estimator in the plane (Q1020878) (← links)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS (Q4650088) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
- The frechet distance revisited and extended (Q5404460) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane (Q6162513) (← links)
