scientific article; zbMATH DE number 432799

MaRDI QIDQ3138932zbMATH OpenFDO

Authors Michiel Smid

Publication date 20 October 1993

zbMATH Keywords

computational geometrydynamic data structureproximity problems

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(4)

• Dynamic closest pairs — A probabilistic approach
• Off-line dynamic maintenance of the width of a planar point set
• A parallel batch-dynamic data structure for the closest pair problem
• A simple algorithm for enumerating longest distances in the plane

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138932)