Klaus Hinrichs

Available identifiers

Publication	Date of Publication	Type
A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited	2024-02-28	Paper
A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects	2023-01-18	Paper
A plane-sweep algorithm for finding a closest pair among convex planar objects	2022-08-18	Paper
Supporting depth and motion perception in medical volume data	2008-04-14	Paper
Planar point location for large data sets	2005-08-04	Paper
Efficient bulk operations on dynamic \(R\)-trees	2002-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4251948	2000-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q4252662	1999-06-21	Paper
An all-round sweep algorithm for 2-dimensional nearest-neighbor problems	1993-02-22	Paper
Probabilistic analysis of an algorithm for solving the \(k\)-dimensional all-nearest-neighbors problem by projection	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3805895	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3815507	1986-01-01	Paper
Implementation of the grid file: Design concepts and experience	1985-01-01	Paper

This page was built for person: Klaus Hinrichs