geom_algorithms_test_triangulation_hulls_delaunay.cc File Reference

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

Include dependency graph for geom_algorithms_test_triangulation_hulls_delaunay.cc:

Go to the source code of this file.

Functions
	TEST_F (GeomAlgorithmsTest, TriangulateTriangle)
	TEST_F (GeomAlgorithmsTest, TriangulateSquare)
	TEST_F (GeomAlgorithmsTest, TriangulateSquareClockwise)
	TEST_F (GeomAlgorithmsTest, TriangulatePentagon)
	TEST_F (GeomAlgorithmsTest, TriangulateOpenPolygonThrows)
	TEST_F (GeomAlgorithmsTest, TriangulateDegenerateCollinearPolygonThrows)
	TEST_F (GeomAlgorithmsTest, TriangulateSelfIntersectingPolygonRejectedByPolygonValidation)
	TEST_F (GeomAlgorithmsTest, QuickHullTriangle)
	TEST_F (GeomAlgorithmsTest, QuickHullSquare)
	TEST_F (GeomAlgorithmsTest, QuickHullWithInterior)
	TEST_F (GeomAlgorithmsTest, GiftWrappingSquare)
	TEST_F (GeomAlgorithmsTest, BruteForceHullTriangle)
	TEST_F (GeomAlgorithmsTest, ThreePointsHull)
	TEST_F (GeomAlgorithmsTest, LegacyHullsEmptyInput)
	TEST_F (GeomAlgorithmsTest, LegacyHullsSinglePointInput)
	TEST_F (GeomAlgorithmsTest, LegacyHullsAllDuplicatePoints)
	TEST_F (GeomAlgorithmsTest, AndrewMonotonicChainSquareWithInteriorAndDuplicates)
	TEST_F (GeomAlgorithmsTest, AndrewMonotonicChainCollinearKeepsEndpoints)
	TEST_F (GeomAlgorithmsTest, GrahamScanSquareWithInteriorAndDuplicates)
	TEST_F (GeomAlgorithmsTest, GrahamScanCollinearKeepsEndpoints)
	TEST_F (GeomAlgorithmsTest, ClosestPairTwoPoints)
	TEST_F (GeomAlgorithmsTest, ClosestPairUniqueMinimum)
	TEST_F (GeomAlgorithmsTest, ClosestPairDuplicatePointsDistanceZero)
	TEST_F (GeomAlgorithmsTest, ClosestPairCollinear)
	TEST_F (GeomAlgorithmsTest, ClosestPairRequiresAtLeastTwoPoints)
	TEST_F (GeomAlgorithmsTest, RotatingCalipersSquare)
	TEST_F (GeomAlgorithmsTest, RotatingCalipersSquareMinimumWidth)
	TEST_F (GeomAlgorithmsTest, RotatingCalipersRectangle)
	TEST_F (GeomAlgorithmsTest, RotatingCalipersTwoPointDegenerate)
	TEST_F (GeomAlgorithmsTest, RotatingCalipersNonConvexThrows)
	TEST_F (GeomAlgorithmsTest, RotatingCalipersOpenPolygonThrows)
	TEST_F (GeomAlgorithmsTest, PointInPolygonConvexClassification)
	TEST_F (GeomAlgorithmsTest, PointInPolygonConcaveClassification)
	TEST_F (GeomAlgorithmsTest, PointInPolygonRequiresClosedPolygon)
	TEST_F (GeomAlgorithmsTest, ConvexPolygonIntersectionOverlapArea)
	TEST_F (GeomAlgorithmsTest, ConvexPolygonIntersectionContained)
	TEST_F (GeomAlgorithmsTest, ConvexPolygonIntersectionDisjoint)
	TEST_F (GeomAlgorithmsTest, ConvexPolygonIntersectionTouchingEdge)
	TEST_F (GeomAlgorithmsTest, ConvexPolygonIntersectionRequiresConvex)
	TEST_F (GeomAlgorithmsTest, ConvexPolygonIntersectionRequiresClosed)
	TEST_F (GeomAlgorithmsTest, HalfPlaneIntersectionFromSingleSquare)
	TEST_F (GeomAlgorithmsTest, HalfPlaneIntersectionFromSingleSquareClockwise)
	TEST_F (GeomAlgorithmsTest, HalfPlaneIntersectionTwoSquaresOverlap)
	TEST_F (GeomAlgorithmsTest, HalfPlaneIntersectionInconsistent)
	TEST_F (GeomAlgorithmsTest, HalfPlaneIntersectionUnboundedReturnsEmpty)
	TEST_F (GeomAlgorithmsTest, DelaunayTriangle)
	TEST_F (GeomAlgorithmsTest, DelaunaySquareProducesTwoTriangles)
	TEST_F (GeomAlgorithmsTest, DelaunayRemovesDuplicates)
	TEST_F (GeomAlgorithmsTest, DelaunayCollinearReturnsEmpty)
	TEST_F (GeomAlgorithmsTest, DelaunayCocircularDeterministicAcrossInputOrder)
	TEST_F (GeomAlgorithmsTest, VoronoiFromTriangle)
	TEST_F (GeomAlgorithmsTest, VoronoiFromQuadrilateralHasOneBoundedEdge)
	TEST_F (GeomAlgorithmsTest, VoronoiBoundedEdgesMatchAdjacentTriangleCircumcenters)
	TEST_F (GeomAlgorithmsTest, VoronoiClippedCellsBoundedAndContainSites)
	TEST_F (GeomAlgorithmsTest, VoronoiClippedCellsBoundedAndContainSitesClockwiseClip)
	TEST_F (GeomAlgorithmsTest, VoronoiClippedCellsRequiresConvexClip)
	TEST_F (GeomAlgorithmsTest, VoronoiClippedCellsIndexedExposeSiteAndIndex)
	TEST_F (GeomAlgorithmsTest, TriangulateHexagon)
	TEST_F (GeomAlgorithmsTest, DelaunayStressToggleEdgePerformance)
	TEST_F (GeomAlgorithmsTest, DelaunayStressGridInput)
	TEST_F (GeomAlgorithmsTest, VoronoiIncidenceIndexMatchesCircumcenters)
	TEST_F (GeomAlgorithmsTest, VoronoiIncidenceIndexStress)
	TEST_F (GeomAlgorithmsTest, TriangulatePentagonClockwise)
	TEST_F (GeomAlgorithmsTest, TriangulateHexagonClockwise)
	TEST_F (GeomAlgorithmsTest, TriangulateTriangleClockwise)
	TEST_F (GeomAlgorithmsTest, TriangulateLShapeClockwise)
	TEST_F (GeomAlgorithmsTest, HalfPlaneFromConvexTriangleCW)
	TEST_F (GeomAlgorithmsTest, HalfPlaneFromConvexPentagonCW)
	TEST_F (GeomAlgorithmsTest, HalfPlaneFromConvexPolygonDegenerateThrows)
	TEST_F (GeomAlgorithmsTest, DelaunayEmptyInput)
	TEST_F (GeomAlgorithmsTest, DelaunaySinglePoint)
	TEST_F (GeomAlgorithmsTest, DelaunayTwoPoints)
	TEST_F (GeomAlgorithmsTest, DelaunayAllDuplicates)
	TEST_F (GeomAlgorithmsTest, DelaunayTwoDistinctWithDuplicates)
	TEST_F (GeomAlgorithmsTest, VoronoiEmptyInput)
	TEST_F (GeomAlgorithmsTest, VoronoiSinglePoint)
	TEST_F (GeomAlgorithmsTest, VoronoiTwoPoints)
	TEST_F (GeomAlgorithmsTest, VoronoiCollinearPoints)
	TEST_F (GeomAlgorithmsTest, CuttingEarsCollinearEdges)
	TEST_F (GeomAlgorithmsTest, CuttingEarsManyVertices)
	TEST_F (GeomAlgorithmsTest, CuttingEarsConsecutiveReflexVertices)
	TEST_F (GeomAlgorithmsTest, ConvexHullPointsOnCircle)
	TEST_F (GeomAlgorithmsTest, ConvexHullClusteredDistribution)
	TEST_F (GeomAlgorithmsTest, ConvexHullStress100K)
	TEST_F (GeomAlgorithmsTest, DelaunayCocircularPoints)
	TEST_F (GeomAlgorithmsTest, DelaunayNearDegenerateTriangles)
	TEST_F (GeomAlgorithmsTest, DelaunayLargeDataset)

Function Documentation

TEST_F() [1/87]

TEST_F	(	GeomAlgorithmsTest	,
		AndrewMonotonicChainCollinearKeepsEndpoints
	)

Definition at line 278 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::TestVisual::add_polygon_vertices(), Aleph::Array< T >::append(), Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), Aleph::TestVisual::emit_case_svg(), Aleph::HTList::Iterator::has_curr(), and Aleph::TestVisual::SvgScene::points.

TEST_F() [2/87]

TEST_F	(	GeomAlgorithmsTest	,
		AndrewMonotonicChainSquareWithInteriorAndDuplicates
	)

Definition at line 255 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [3/87]

TEST_F	(	GeomAlgorithmsTest	,
		BruteForceHullTriangle
	)

Definition at line 174 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [4/87]

TEST_F	(	GeomAlgorithmsTest	,
		ClosestPairCollinear
	)

Definition at line 423 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [5/87]

TEST_F	(	GeomAlgorithmsTest	,
		ClosestPairDuplicatePointsDistanceZero
	)

Definition at line 396 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Array< T >::append(), Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), Aleph::TestVisual::emit_case_svg(), Aleph::HTList::Iterator::has_curr(), and Aleph::TestVisual::SvgScene::points.

TEST_F() [6/87]

TEST_F	(	GeomAlgorithmsTest	,
		ClosestPairRequiresAtLeastTwoPoints
	)

Definition at line 444 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [7/87]

TEST_F	(	GeomAlgorithmsTest	,
		ClosestPairTwoPoints
	)

Definition at line 363 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [8/87]

TEST_F	(	GeomAlgorithmsTest	,
		ClosestPairUniqueMinimum
	)

Definition at line 378 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [9/87]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexHullClusteredDistribution
	)

Definition at line 1729 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), offset, and rng.

TEST_F() [10/87]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexHullPointsOnCircle
	)

Definition at line 1690 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References cos(), Aleph::divide_and_conquer_partition_dp(), N, and sin().

TEST_F() [11/87]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexHullStress100K
	)

Definition at line 1761 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and rng.

TEST_F() [12/87]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexPolygonIntersectionContained
	)

Definition at line 633 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [13/87]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexPolygonIntersectionDisjoint
	)

Definition at line 660 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [14/87]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexPolygonIntersectionOverlapArea
	)

Definition at line 605 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [15/87]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexPolygonIntersectionRequiresClosed
	)

Definition at line 742 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [16/87]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexPolygonIntersectionRequiresConvex
	)

Definition at line 719 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [17/87]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexPolygonIntersectionTouchingEdge
	)

Definition at line 683 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::TestVisual::add_polygon_vertices(), Aleph::Polygon::add_vertex(), Aleph::Polygon::append(), Aleph::Array< T >::append(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), Aleph::TestVisual::emit_case_svg(), Aleph::TestVisual::SvgScene::polygons, and r.

TEST_F() [18/87]

TEST_F	(	GeomAlgorithmsTest	,
		CuttingEarsCollinearEdges
	)

Definition at line 1580 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), and triangle_area().

TEST_F() [19/87]

TEST_F	(	GeomAlgorithmsTest	,
		CuttingEarsConsecutiveReflexVertices
	)

Definition at line 1648 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), cos(), Aleph::divide_and_conquer_partition_dp(), sin(), and triangle_area().

TEST_F() [20/87]

TEST_F	(	GeomAlgorithmsTest	,
		CuttingEarsManyVertices
	)

Definition at line 1610 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), cos(), Aleph::divide_and_conquer_partition_dp(), __gmp_expr< mpq_t, mpq_t >::get_d(), N, poly_area(), polygon_area(), sin(), triangle_area(), and y.

TEST_F() [21/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayAllDuplicates
	)

Definition at line 1512 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [22/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayCocircularDeterministicAcrossInputOrder
	)

Definition at line 932 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Array< T >::append(), Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), Aleph::TestVisual::emit_case_svg(), and Aleph::TestVisual::SvgScene::points.

TEST_F() [23/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayCocircularPoints
	)

Definition at line 1787 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References cos(), Aleph::divide_and_conquer_partition_dp(), N, Aleph::orientation(), r, and sin().

TEST_F() [24/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayCollinearReturnsEmpty
	)

Definition at line 922 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [25/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayEmptyInput
	)

Definition at line 1481 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [26/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayLargeDataset
	)

Definition at line 1859 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), N, Aleph::orientation(), r, and rng.

TEST_F() [27/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayNearDegenerateTriangles
	)

Definition at line 1816 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [28/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayRemovesDuplicates
	)

Definition at line 911 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [29/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunaySinglePoint
	)

Definition at line 1492 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [30/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunaySquareProducesTwoTriangles
	)

Definition at line 891 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [31/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayStressGridInput
	)

Definition at line 1237 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [32/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayStressToggleEdgePerformance
	)

Definition at line 1201 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [33/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayTriangle
	)

Definition at line 877 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [34/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayTwoDistinctWithDuplicates
	)

Definition at line 1522 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [35/87]

TEST_F	(	GeomAlgorithmsTest	,
		DelaunayTwoPoints
	)

Definition at line 1502 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [36/87]

TEST_F	(	GeomAlgorithmsTest	,
		GiftWrappingSquare
	)

Definition at line 159 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [37/87]

TEST_F	(	GeomAlgorithmsTest	,
		GrahamScanCollinearKeepsEndpoints
	)

Definition at line 332 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::TestVisual::add_polygon_vertices(), Aleph::Array< T >::append(), Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), Aleph::TestVisual::emit_case_svg(), Aleph::HTList::Iterator::has_curr(), and Aleph::TestVisual::SvgScene::points.

TEST_F() [38/87]

TEST_F	(	GeomAlgorithmsTest	,
		GrahamScanSquareWithInteriorAndDuplicates
	)

Definition at line 309 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [39/87]

TEST_F	(	GeomAlgorithmsTest	,
		HalfPlaneFromConvexPentagonCW
	)

Definition at line 1441 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::divide_and_conquer_partition_dp(), Aleph::HalfPlaneIntersection::from_convex_polygon(), and r.

TEST_F() [40/87]

TEST_F	(	GeomAlgorithmsTest	,
		HalfPlaneFromConvexPolygonDegenerateThrows
	)

Definition at line 1462 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::divide_and_conquer_partition_dp(), and Aleph::HalfPlaneIntersection::from_convex_polygon().

TEST_F() [41/87]

TEST_F	(	GeomAlgorithmsTest	,
		HalfPlaneFromConvexTriangleCW
	)

Definition at line 1418 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::divide_and_conquer_partition_dp(), Aleph::HalfPlaneIntersection::from_convex_polygon(), and r.

TEST_F() [42/87]

TEST_F	(	GeomAlgorithmsTest	,
		HalfPlaneIntersectionFromSingleSquare
	)

Definition at line 762 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), Aleph::HalfPlaneIntersection::from_convex_polygon(), and r.

TEST_F() [43/87]

TEST_F	(	GeomAlgorithmsTest	,
		HalfPlaneIntersectionFromSingleSquareClockwise
	)

Definition at line 785 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::divide_and_conquer_partition_dp(), Aleph::HalfPlaneIntersection::from_convex_polygon(), and r.

TEST_F() [44/87]

TEST_F	(	GeomAlgorithmsTest	,
		HalfPlaneIntersectionInconsistent
	)

Definition at line 841 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Array< T >::append(), Aleph::divide_and_conquer_partition_dp(), Aleph::TestVisual::emit_case_svg(), r, and Aleph::TestVisual::SvgScene::segments.

TEST_F() [45/87]

TEST_F	(	GeomAlgorithmsTest	,
		HalfPlaneIntersectionTwoSquaresOverlap
	)

Definition at line 808 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), Aleph::HalfPlaneIntersection::from_convex_polygon(), and r.

TEST_F() [46/87]

TEST_F	(	GeomAlgorithmsTest	,
		HalfPlaneIntersectionUnboundedReturnsEmpty
	)

Definition at line 864 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [47/87]

TEST_F	(	GeomAlgorithmsTest	,
		LegacyHullsAllDuplicatePoints
	)

Definition at line 238 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [48/87]

TEST_F	(	GeomAlgorithmsTest	,
		LegacyHullsEmptyInput
	)

Definition at line 202 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [49/87]

TEST_F	(	GeomAlgorithmsTest	,
		LegacyHullsSinglePointInput
	)

Definition at line 216 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [50/87]

TEST_F	(	GeomAlgorithmsTest	,
		PointInPolygonConcaveClassification
	)

Definition at line 573 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [51/87]

TEST_F	(	GeomAlgorithmsTest	,
		PointInPolygonConvexClassification
	)

Definition at line 550 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [52/87]

TEST_F	(	GeomAlgorithmsTest	,
		PointInPolygonRequiresClosedPolygon
	)

Definition at line 593 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [53/87]

TEST_F	(	GeomAlgorithmsTest	,
		QuickHullSquare
	)

Definition at line 128 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [54/87]

TEST_F	(	GeomAlgorithmsTest	,
		QuickHullTriangle
	)

Definition at line 114 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [55/87]

TEST_F	(	GeomAlgorithmsTest	,
		QuickHullWithInterior
	)

Definition at line 143 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [56/87]

TEST_F	(	GeomAlgorithmsTest	,
		RotatingCalipersNonConvexThrows
	)

Definition at line 520 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [57/87]

TEST_F	(	GeomAlgorithmsTest	,
		RotatingCalipersOpenPolygonThrows
	)

Definition at line 536 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [58/87]

TEST_F	(	GeomAlgorithmsTest	,
		RotatingCalipersRectangle
	)

Definition at line 488 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::RotatingCalipersConvexPolygon::diameter(), Aleph::divide_and_conquer_partition_dp(), and w.

TEST_F() [59/87]

TEST_F	(	GeomAlgorithmsTest	,
		RotatingCalipersSquare
	)

Definition at line 454 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::RotatingCalipersConvexPolygon::diameter(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [60/87]

TEST_F	(	GeomAlgorithmsTest	,
		RotatingCalipersSquareMinimumWidth
	)

Definition at line 473 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), Aleph::RotatingCalipersConvexPolygon::minimum_width(), and w.

TEST_F() [61/87]

TEST_F	(	GeomAlgorithmsTest	,
		RotatingCalipersTwoPointDegenerate
	)

Definition at line 506 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [62/87]

TEST_F	(	GeomAlgorithmsTest	,
		ThreePointsHull
	)

Definition at line 188 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [63/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulateDegenerateCollinearPolygonThrows
	)

Definition at line 82 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [64/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulateHexagon
	)

Definition at line 1177 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [65/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulateHexagonClockwise
	)

Definition at line 1361 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [66/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulateLShapeClockwise
	)

Definition at line 1396 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [67/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulateOpenPolygonThrows
	)

Definition at line 69 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [68/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulatePentagon
	)

Definition at line 52 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [69/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulatePentagonClockwise
	)

Definition at line 1343 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [70/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulateSelfIntersectingPolygonRejectedByPolygonValidation
	)

Definition at line 100 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [71/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulateSquare
	)

Definition at line 20 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [72/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulateSquareClockwise
	)

Definition at line 36 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [73/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulateTriangle
	)

Definition at line 5 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [74/87]

TEST_F	(	GeomAlgorithmsTest	,
		TriangulateTriangleClockwise
	)

Definition at line 1380 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::Polygon::add_vertex(), Aleph::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [75/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiBoundedEdgesMatchAdjacentTriangleCircumcenters
	)

Definition at line 1028 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [76/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiClippedCellsBoundedAndContainSites
	)

Definition at line 1078 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [77/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiClippedCellsBoundedAndContainSitesClockwiseClip
	)

Definition at line 1104 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [78/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiClippedCellsIndexedExposeSiteAndIndex
	)

Definition at line 1148 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [79/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiClippedCellsRequiresConvexClip
	)

Definition at line 1130 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [80/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiCollinearPoints
	)

Definition at line 1568 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [81/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiEmptyInput
	)

Definition at line 1534 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [82/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiFromQuadrilateralHasOneBoundedEdge
	)

Definition at line 1003 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [83/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiFromTriangle
	)

Definition at line 976 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [84/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiIncidenceIndexMatchesCircumcenters
	)

Definition at line 1265 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [85/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiIncidenceIndexStress
	)

Definition at line 1312 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

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

TEST_F() [86/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiSinglePoint
	)

Definition at line 1547 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [87/87]

TEST_F	(	GeomAlgorithmsTest	,
		VoronoiTwoPoints
	)

Definition at line 1558 of file geom_algorithms_test_triangulation_hulls_delaunay.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.