A geometric algorithm based on dynamic rectangular window for closest points

DOI10.3969/J.ISSN.1006-7043.201204044MaRDI QIDQ3195829zbMATH OpenFDO

Authors C. Jiang, Guoyin Zhang

Publication date 28 October 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1006-7043.201204044

zbMATH Keywords

geometric algorithmpigeonhole principleclosest pointdynamic rectangular window

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case
• Two-dimensional closest pair problem: a closer look
• An improved algorithm for finding the closest pair of points
• scientific article; zbMATH DE number 1424308
• Optimal time bounds for some proximity problems in the plane

Cited in

(1)

• A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation

This page was built for publication: A geometric algorithm based on dynamic rectangular window for closest points

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