geom_algorithms_test_cdt.cc File Reference

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

Include dependency graph for geom_algorithms_test_cdt.cc:

Go to the source code of this file.

Functions
static bool	cdt_has_edge (const ConstrainedDelaunayTriangulation::Result &r, const size_t u, const size_t v)
static size_t	find_site (const Array< Point > &sites, const Point &p)
static bool	has_constrained_edge (const ConstrainedDelaunayTriangulation::Result &r, const Point &p, const Point &q)
static bool	check_delaunay_for_non_constrained (const ConstrainedDelaunayTriangulation::Result &r)
	TEST_F (GeomAlgorithmsTest, CDT_TriangleNoConstraints)
	TEST_F (GeomAlgorithmsTest, CDT_SquareWithForcedDiagonal)
	TEST_F (GeomAlgorithmsTest, CDT_ConstraintAlreadyInDT)
	TEST_F (GeomAlgorithmsTest, CDT_ConstraintCrossingDTEdge)
	TEST_F (GeomAlgorithmsTest, CDT_MultipleConstraints)
	TEST_F (GeomAlgorithmsTest, CDT_PLSGChain)
	TEST_F (GeomAlgorithmsTest, CDT_EmptyInput)
	TEST_F (GeomAlgorithmsTest, CDT_LessThan3Points)
	TEST_F (GeomAlgorithmsTest, CDT_CollinearPoints)
	TEST_F (GeomAlgorithmsTest, CDT_OnlyConstraintEndpoints)
	TEST_F (GeomAlgorithmsTest, CDT_PointOnConstraintInterior)
	TEST_F (GeomAlgorithmsTest, CDT_DuplicatePoints)
	TEST_F (GeomAlgorithmsTest, CDT_DuplicateConstraints)
	TEST_F (GeomAlgorithmsTest, CDT_AllConstraintsPresent)
	TEST_F (GeomAlgorithmsTest, CDT_DelaunayPropertyForNonConstrained)
	TEST_F (GeomAlgorithmsTest, CDT_AllPointsPresent)
	TEST_F (GeomAlgorithmsTest, CDT_CCWWinding)
	TEST_F (GeomAlgorithmsTest, CDT_GridWithDiagonalConstraints)
	TEST_F (GeomAlgorithmsTest, CDT_PolygonBoundaryAsConstraints)
	TEST_F (GeomAlgorithmsTest, CDT_AsTrianglesConversion)
	TEST_F (GeomAlgorithmsTest, CDT_InitializerListOverload)
	TEST_F (GeomAlgorithmsTest, CDT_DelaunayCheckOnLargerSet)

Function Documentation

cdt_has_edge()

static bool cdt_has_edge ( const ConstrainedDelaunayTriangulation::Result &  r, const size_t  u, const size_t  v  )

static

Definition at line 7 of file geom_algorithms_test_cdt.cc.

References Aleph::and, Aleph::divide_and_conquer_partition_dp(), and r.

Referenced by TEST_F(), TEST_F(), TEST_F(), and TEST_F().

check_delaunay_for_non_constrained()

static bool check_delaunay_for_non_constrained ( const ConstrainedDelaunayTriangulation::Result &  r )

static

Definition at line 56 of file geom_algorithms_test_cdt.cc.

References Aleph::and, Aleph::Array< T >::append(), Aleph::divide_and_conquer_partition_dp(), Aleph::in_circle_determinant(), Aleph::orientation(), and r.

Referenced by TEST_F(), and TEST_F().

find_site()

static size_t find_site ( const Array< Point > &  sites, const Point &  p  )

static

Definition at line 26 of file geom_algorithms_test_cdt.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::Array< T >::size().

Referenced by has_constrained_edge(), TEST_F(), TEST_F(), TEST_F(), and TEST_F().

has_constrained_edge()

static bool has_constrained_edge ( const ConstrainedDelaunayTriangulation::Result &  r, const Point &  p, const Point &  q  )

static

Definition at line 35 of file geom_algorithms_test_cdt.cc.

References Aleph::and, Aleph::divide_and_conquer_partition_dp(), find_site(), and r.

Referenced by TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), and TEST_F().

TEST_F() [1/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_AllConstraintsPresent
	)

Definition at line 411 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [2/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_AllPointsPresent
	)

Definition at line 466 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [3/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_AsTrianglesConversion
	)

Definition at line 573 of file geom_algorithms_test_cdt.cc.

References Aleph::DynList< T >::append(), Aleph::ConstrainedDelaunayTriangulation::as_triangles(), Aleph::divide_and_conquer_partition_dp(), and Aleph::HTList::size().

TEST_F() [4/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_CCWWinding
	)

Definition at line 487 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [5/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_CollinearPoints
	)

Definition at line 307 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [6/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_ConstraintAlreadyInDT
	)

Definition at line 183 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [7/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_ConstraintCrossingDTEdge
	)

Definition at line 201 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [8/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_DelaunayCheckOnLargerSet
	)

Definition at line 602 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [9/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_DelaunayPropertyForNonConstrained
	)

Definition at line 447 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [10/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_DuplicateConstraints
	)

Definition at line 387 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [11/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_DuplicatePoints
	)

Definition at line 370 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [12/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_EmptyInput
	)

Definition at line 282 of file geom_algorithms_test_cdt.cc.

References Aleph::divide_and_conquer_partition_dp().

TEST_F() [13/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_GridWithDiagonalConstraints
	)

Definition at line 516 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [14/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_InitializerListOverload
	)

Definition at line 590 of file geom_algorithms_test_cdt.cc.

References Aleph::divide_and_conquer_partition_dp(), and has_constrained_edge().

TEST_F() [15/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_LessThan3Points
	)

Definition at line 293 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [16/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_MultipleConstraints
	)

Definition at line 225 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [17/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_OnlyConstraintEndpoints
	)

Definition at line 322 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [18/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_PLSGChain
	)

Definition at line 251 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [19/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_PointOnConstraintInterior
	)

Definition at line 345 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [20/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_PolygonBoundaryAsConstraints
	)

Definition at line 543 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [21/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_SquareWithForcedDiagonal
	)

Definition at line 157 of file geom_algorithms_test_cdt.cc.

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

TEST_F() [22/22]

TEST_F	(	GeomAlgorithmsTest	,
		CDT_TriangleNoConstraints
	)

Definition at line 140 of file geom_algorithms_test_cdt.cc.

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