Parametric search visualization

Authors:
Ivaylo Ilinkin
Affiliations:
Gettysburg College, Gettysburg, USA
Venue:
Proceedings of the twenty-ninth annual symposium on Computational geometry
Year:
2013

Citing 3
Cited 0

Computing the minimum diameter for moving points: an exact implementation using parametric search

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Parametric search made practical

Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002

Quantified Score

Hi-index	0.00

Visualization

Abstract

This video provides a visualization of parametric search using as the underlying application an algorithm for computing a tangent to a level in arrangement proposed by Matoušek [2]. The visualization is based on the framework of van~Oostrum and Veltkamp [6], which simplifies considerably the implementation of parametric search algorithms.