Thorsten Graf

According to our database, Thorsten Graf authored at least 5 papers between 1993 and 1994.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1994

Plane-sweep construction of proximity graphs.

Thorsten Graf

PhD thesis, 1994

Distribution Algorithms for the all-nearest-foreign-neighbors Problem in Arbitrary L^t-metrics.

Thorsten Graf, Klaus H. Hinrichs

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

The Colored Quadrant Priority Search Tree with an Application to the all-nearest-foreign-neighbors Problem.

Andreas Brinkman, Thorsten Graf, Klaus H. Hinrichs

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects.

Thorsten Graf, Klaus H. Hinrichs

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Algorithms for Proximity Problems on Colored Point Sets.

Klaus H. Hinrichs, Thorsten Graf

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993