Related Experiment Video
Updated: Jan 29, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
A simple approximation algorithm for the diameter of a set of points in an Euclidean plane
Jieying Hong1, Zhipeng Wang2, Wei Niu2,3
1ESSEC Asia-Pacific, ESSEC Business School, Singapore, Singapore.
Abstract:
Approximation algorithms with linear complexities are required in the treatments of big data, however, present algorithms cannot output the diameter of a set of points with arbitrary accuracy and near-linear complexity. By introducing the partition technique, we introduce a very simple approximation algorithm with arbitrary accuracy ε and a complexity of O(N + ε-1 log ε-1) for the cases that all points are located in an Euclidean plane. The error bounds are proved strictly, and are verified by numerical tests. This complexity is better than existing algorithms, and the present algorithm is also very simple to be implemented in applications.
More Related Videos
Related Concept Videos
Approximate Integration
Linearization and Approximation
Accuracy, limits, and approximation
Accuracy is defined as the closeness of the measured value to the true or actual value. In engineering mechanics, repeated measurements are taken during theoretical or experimental analyses to ensure that the result is precise and accurate.
The accuracy of any solution is based on the...
Application of Linearization and Approximation
Work Done Over an Inclined Plane
The work done by gravity to move a rigid body, or the work done by an opposing force to move a rigid body against gravity, can be calculated using the center-of-mass framework. It is the line integral of the force of gravity over the path, considered positive if...
Trial and Error and Algorithm

