mirror of https://github.com/CGAL/cgal
Flesh out the algorithm's outline
This commit is contained in:
parent
0d4923bbd0
commit
1ee73d70a9
|
|
@ -453,12 +453,14 @@ private: // functions :
|
||||||
// Make room for the new point if necessary
|
// Make room for the new point if necessary
|
||||||
if (out.size() == out.capacity()) {
|
if (out.size() == out.capacity()) {
|
||||||
|
|
||||||
// Find the location of the furthest point in the list
|
|
||||||
|
|
||||||
// Remove the furthest point
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Add the point to the list
|
// Add the point to the list
|
||||||
|
// TODO
|
||||||
|
|
||||||
|
// Sort the list (for next time)
|
||||||
|
// TODO
|
||||||
|
|
||||||
// Update the distance
|
// Update the distance
|
||||||
largest_radius_squared_found = new_distance_squared;
|
largest_radius_squared_found = new_distance_squared;
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue