geom_algorithms_test_mec.cc File Reference

#include "geom_algorithms_test_common.h"
#include <cmath>
#include <random>

Include dependency graph for geom_algorithms_test_mec.cc:

Go to the source code of this file.

Functions
	TEST_F (GeomAlgorithmsTest, MEC_SinglePoint)
	TEST_F (GeomAlgorithmsTest, MEC_TwoPoints)
	TEST_F (GeomAlgorithmsTest, MEC_EquilateralTriangle)
	TEST_F (GeomAlgorithmsTest, MEC_RightTriangle)
	TEST_F (GeomAlgorithmsTest, MEC_Square)
	TEST_F (GeomAlgorithmsTest, MEC_RegularPentagon)
	TEST_F (GeomAlgorithmsTest, MEC_EmptyInput)
	TEST_F (GeomAlgorithmsTest, MEC_AllIdenticalPoints)
	TEST_F (GeomAlgorithmsTest, MEC_CollinearPoints)
	TEST_F (GeomAlgorithmsTest, MEC_DuplicatePoints)
	TEST_F (GeomAlgorithmsTest, MEC_PointAlreadyInside)
	TEST_F (GeomAlgorithmsTest, MEC_AllPointsContained)
	TEST_F (GeomAlgorithmsTest, MEC_InitializerList)
	TEST_F (GeomAlgorithmsTest, MEC_FromTwoPoints)
	TEST_F (GeomAlgorithmsTest, MEC_FromThreePointsCollinear)
	TEST_F (GeomAlgorithmsTest, MEC_PointsOnKnownCircle)
	TEST_F (GeomAlgorithmsTest, MEC_GridPoints)
	TEST_F (GeomAlgorithmsTest, MEC_RandomPoints)

Function Documentation

TEST_F() [1/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_AllIdenticalPoints
	)

Definition at line 170 of file geom_algorithms_test_mec.cc.

References Aleph::DynList< T >::append(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [2/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_AllPointsContained
	)

Definition at line 247 of file geom_algorithms_test_mec.cc.

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

TEST_F() [3/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_CollinearPoints
	)

Definition at line 183 of file geom_algorithms_test_mec.cc.

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

TEST_F() [4/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_DuplicatePoints
	)

Definition at line 203 of file geom_algorithms_test_mec.cc.

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

TEST_F() [5/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_EmptyInput
	)

Definition at line 163 of file geom_algorithms_test_mec.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST_F() [6/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_EquilateralTriangle
	)

Definition at line 66 of file geom_algorithms_test_mec.cc.

References Aleph::DynList< T >::append(), Aleph::diff(), Aleph::divide_and_conquer_partition_dp(), h, and Aleph::square_root().

TEST_F() [7/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_FromThreePointsCollinear
	)

Definition at line 286 of file geom_algorithms_test_mec.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::MinimumEnclosingCircle::from_three_points().

TEST_F() [8/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_FromTwoPoints
	)

Definition at line 278 of file geom_algorithms_test_mec.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::MinimumEnclosingCircle::from_two_points().

TEST_F() [9/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_GridPoints
	)

Definition at line 323 of file geom_algorithms_test_mec.cc.

References Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), Aleph::HTList::Iterator::has_curr(), and y.

TEST_F() [10/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_InitializerList
	)

Definition at line 267 of file geom_algorithms_test_mec.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST_F() [11/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_PointAlreadyInside
	)

Definition at line 219 of file geom_algorithms_test_mec.cc.

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

TEST_F() [12/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_PointsOnKnownCircle
	)

Definition at line 296 of file geom_algorithms_test_mec.cc.

References Aleph::DynList< T >::append(), Aleph::diff(), Aleph::divide_and_conquer_partition_dp(), Aleph::HTList::Iterator::has_curr(), and r.

TEST_F() [13/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_RandomPoints
	)

Definition at line 338 of file geom_algorithms_test_mec.cc.

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

TEST_F() [14/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_RegularPentagon
	)

Definition at line 134 of file geom_algorithms_test_mec.cc.

References Aleph::DynList< T >::append(), Aleph::diff(), Aleph::divide_and_conquer_partition_dp(), Aleph::HTList::Iterator::has_curr(), and r.

TEST_F() [15/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_RightTriangle
	)

Definition at line 94 of file geom_algorithms_test_mec.cc.

References Aleph::DynList< T >::append(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [16/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_SinglePoint
	)

Definition at line 39 of file geom_algorithms_test_mec.cc.

References Aleph::DynList< T >::append(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [17/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_Square
	)

Definition at line 115 of file geom_algorithms_test_mec.cc.

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

TEST_F() [18/18]

TEST_F	(	GeomAlgorithmsTest	,
		MEC_TwoPoints
	)

Definition at line 51 of file geom_algorithms_test_mec.cc.

References Aleph::DynList< T >::append(), and Aleph::divide_and_conquer_partition_dp().