CGAL 6.2 - Maximal Empty Spheres
Loading...
Searching...
No Matches
User Manual

Author
Max Kohlbrenner and Marc Alexa

This chapter describes the ...

Definitions

Section on definitions here ...

Examples

First Example

The following example shows ...


File Maximal_empty_spheres/maximal_empty_spheres_3.cpp

#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Maximal_empty_spheres/maximal_empty_spheres.h>
#include <iostream>
#include <vector>
using Sphere_3 = CGAL::Exact_predicates_inexact_constructions_kernel::Sphere_3;
using Point_3 = CGAL::Exact_predicates_inexact_constructions_kernel::Point_3;
int main(){
std::vector<Sphere_3> spheres, result;
std::ifstream in("data/3D/spheres.csv");
double x, y, z, r;
while(in >> x){
in.ignore(10,','); in >> y; in.ignore(10,','); in >> z; in.ignore(10,','); in >> r;
spheres.emplace_back(Point_3(x, y, z), r*r);
std::cout << "Sphere: " << spheres.back() << std::endl;
}
CGAL::maximal_empty_spheres(spheres, std::back_inserter(result));
return 0;
}
void maximal_empty_spheres(const SphereRange &input, OutputIterator result)
compute maximal empty spheres from a range of spheres.
Definition: maximal_empty_spheres.h:348

Figure 107.1 Left: ...


Implementation History