Computing the Diameter of a Point Set
- 14 March 2002
- book chapter
- Published by Springer Nature
- Vol. 12 (6) , 197-208
- https://doi.org/10.1007/3-540-45986-3_18
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Parallel algorithms for higher-dimensional convex hullsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A practical approach for computing the diameter of a point setPublished by Association for Computing Machinery (ACM) ,2001
- Deterministic algorithms for 3-D diameter and some 2-D lower envelopesPublished by Association for Computing Machinery (ACM) ,2000
- Intersection of unit-balls and diameter of a point set in R3Computational Geometry, 1997
- Construction of 1-d lower envelopes and applicationsPublished by Association for Computing Machinery (ACM) ,1997
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989