Computing the diameter of a point set

DOI10.1007/3-540-45986-3_18MaRDI QIDQ4738260zbMATH OpenFDO

Authors Grégoire Malandain, Jean-Daniel Boissonnat

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2301/23010197.htm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• COMPUTING THE DIAMETER OF A POINT SET
• scientific article; zbMATH DE number 4041267
• A practical approach for computing the diameter of a point set
• Fast algorithms for computing the diameter of a finite planar set
• Approximating the diameter of a set of points in the Euclidean space

Cited in

(9)

• Fast algorithms for computing the diameter of a finite planar set
• Approximating the diameter of a set of points in the Euclidean space
• On computing the diameter of a point set in high dimensional Euclidean space.
• scientific article; zbMATH DE number 4041267 (Why is no real title available?)
• Maximum distance between two sets of points in Ed
• COMPUTING THE DIAMETER OF A POINT SET
• A practical approach for computing the diameter of a point set
• Approximating the Radii of Point Sets
• An optimal deterministic algorithm for computing the diameter of a three-dimensional point set

This page was built for publication: Computing the diameter of a point set

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