Parametric search made practical
From MaRDI portal
Publication:598230
DOI10.1016/j.comgeo.2004.03.006zbMath1072.68528OpenAlexW4213012742MaRDI QIDQ598230
Remco C. Veltkamp, René van Oostrum
Publication date: 6 August 2004
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/18869
Related Items
Can we compute the similarity between surfaces?, The maximin line problem with regional demand, Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane, Some variations on constrained minimum enclosing circle problem, Link distance and shortest path problems in the plane, Exact algorithms for the bottleneck Steiner tree problem, Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees, One-dimensional \(k\)-center on uncertain data, The frechet distance revisited and extended, THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS, Parametric search: three new applications, Simple algorithms for partial point set pattern matching under rigid motion, Computing the least quartile difference estimator in the plane, Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time, Optimal Algorithms for Geometric Centers and Depth
Uses Software
Cites Work
- Unnamed Item
- Geometric pattern matching under Euclidean motion
- Sorting in \(c \log n\) parallel steps
- Fast algorithms for collision and proximity problems involving moving geometric objects
- Geometric applications of a randomized optimization technique
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Parallel Merge Sort
- An Optimal-Time Algorithm for Slope Selection
- Combinatorial Optimization with Rational Objective Functions
- Parallelism in Comparison Problems
- New Parallel-Sorting Schemes
- Slowing down sorting networks to obtain faster sorting algorithms
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES
- On the Number of Stable States in a NOR Network
- Geometry helps in bottleneck matching and related problems
