scientific article; zbMATH DE number 742974

MaRDI QIDQ4763414zbMATH OpenFDO

Authors Christian Schwarz, Michiel Smid

Publication date 11 April 1995

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An optimal algorithm for the on-line closest-pair problem
• scientific article; zbMATH DE number 1372522
• An optimal algorithm for closest-pair maintenance
• Dynamic rectangular point location, with an application to the closest pair problem
• Dynamic closest pairs — A probabilistic approach

Cited in

(7)

• An optimal algorithm for the on-line closest-pair problem
• Dynamic rectangular point location, with an application to the closest pair problem
• An optimal algorithm for closest-pair maintenance
• A simple randomized O(N N)-time closest-pair algorithm in doubling metrics
• scientific article; zbMATH DE number 1256675 (Why is no real title available?)
• scientific article; zbMATH DE number 1372522 (Why is no real title available?)
• A parallel batch-dynamic data structure for the closest pair problem

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 Q4763414)