Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Intersection of unit-balls and diameter of point set in R3
Computational Geometry: Theory and Applications
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
A practical approach for computing the diameter of a point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Parallel algorithms for higher-dimensional convex hulls
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Building efficient, accurate character skins from examples
ACM SIGGRAPH 2003 Papers
Discrete bisector function and Euclidean skeleton in 2D and 3D
Image and Vision Computing
SMI 2013: Grouping real functions defined on 3D surfaces
Computers and Graphics
PHOG: photometric and geometric functions for textured shape retrieval
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
| Hi-index | 0.00 |
Given a finite set of points P in Rd, the diameter of P is defined as the maximum distance between two points of P. We propose a very simple algorithm to compute the diameter of a finite set of points. Although the algorithm is not worst-case optimal, it appears to be extremely fast for a large variety of point distributions.