minimum_enclosing_circle_example.cc File Reference

Minimum enclosing circle via Welzl's algorithm. More...

#include <geom_algorithms.H>
#include <cassert>
#include <iostream>

Include dependency graph for minimum_enclosing_circle_example.cc:

Go to the source code of this file.

Functions
static void	print_banner (const char *title)
int	main ()

Detailed Description

Minimum enclosing circle via Welzl's algorithm.

Demonstrates:

• MinimumEnclosingCircle in expected O(n)
• Verification that every point is inside the result

See also

geom_algorithms.H

MinimumEnclosingCircle

Definition in file minimum_enclosing_circle_example.cc.

Function Documentation

main()

int main

(

)

Definition at line 58 of file minimum_enclosing_circle_example.cc.

References Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), Aleph::Point::get_x(), Aleph::Point::get_y(), Aleph::HTList::Iterator::has_curr(), and print_banner().

print_banner()

static void print_banner ( const char *  title )

static

Definition at line 52 of file minimum_enclosing_circle_example.cc.

Referenced by main().