LEP: paramsearch 1.0

An implementation that shows that parametric search is not at all a purely theoretical technique. Download Software  Download Documentation  If you want to get update information concerning this package please contact ledares@mpi-sb.mpg.de to be put on a mailing list. Contact  Jörg Schwerdt  Algorithmic Solutions Software GmbH  Postfach 15 11 01  66041 Saarbrücken  Germany  email: joerg.schwerdt@algorithmic-solutions.com   This LEP implements an algorithm that computes the minimum diameter of a set of moving points. The implementation uses parametric search, and solves the problem exactly. Bibliography  Fast algorithms for collision and proximity problems involving moving geometric objects P. Gupta, R. Janardan and M. Smid Comput. Geom. Theory Appl., 6:371-391, 1996, Applying parallel computation algorithms in the design of serial algorithms N. Megiddo J. ACM, 30:852--865, 1983 Das Diameterproblem einer bewegten Punktemenge: eine Implementierung mit Hilfe von Parametric Search J. Schwerdt Diplomarbeit, 1996 Computing the minimum diameter for moving points: an exact implementation using parametric search J. Schwerdt, M. Smid and S. Schirra Proc. 13th Annu. ACM Sympos. Comput. Geom., 466--468, 1997 back to the LEDA EP index page

---

person responsible for the page: Michael Seel