geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc File Reference

#include "geom_algorithms_test_common.h"

Include dependency graph for geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc:

Go to the source code of this file.

Functions
	TEST_F (GeomAlgorithmsTest, ConvexDecompConvexQuad)
	TEST_F (GeomAlgorithmsTest, ConvexDecompLShape)
	TEST_F (GeomAlgorithmsTest, ConvexDecompAllPartsConvex)
	TEST_F (GeomAlgorithmsTest, ConvexDecompVertexCoverage)
	TEST_F (GeomAlgorithmsTest, LineSweepBasicOrdering)
	TEST_F (GeomAlgorithmsTest, LineSweepDuplicatePositions)
	TEST_F (GeomAlgorithmsTest, LineSweepDynamicEvents)
	TEST_F (GeomAlgorithmsTest, LineSweepPeekAndClear)
	TEST_F (GeomAlgorithmsTest, LineSweepRunWithLog)
	TEST_F (GeomAlgorithmsTest, LineSweepGeometricExample)
	TEST_F (GeomAlgorithmsTest, RangeTree2DEmpty)
	TEST_F (GeomAlgorithmsTest, RangeTree2DSinglePoint)
	TEST_F (GeomAlgorithmsTest, RangeTree2DQueryAll)
	TEST_F (GeomAlgorithmsTest, RangeTree2DQueryNone)
	TEST_F (GeomAlgorithmsTest, RangeTree2DQueryPartial)
	TEST_F (GeomAlgorithmsTest, RangeTree2DDegenerateRect)
	TEST_F (GeomAlgorithmsTest, RangeTree2DBruteForce)
	TEST_F (GeomAlgorithmsTest, RangeTree2DSameX)
	TEST_F (GeomAlgorithmsTest, RangeTree2DSameY)
	TEST_F (GeomAlgorithmsTest, RangeTree2DDebugSnapshot)
	TEST_F (GeomAlgorithmsTest, RangeTree2DLargeDebugSnapshotKeepsValidChildIndices)
	TEST_F (GeomAlgorithmsTest, ConvexOffsetInwardSquare)
	TEST_F (GeomAlgorithmsTest, ConvexOffsetInwardTooLarge)
	TEST_F (GeomAlgorithmsTest, ConvexOffsetZeroDistance)
	TEST_F (GeomAlgorithmsTest, ConvexOffsetOutwardSquare)
	TEST_F (GeomAlgorithmsTest, ConvexOffsetOutwardTriangle)
	TEST_F (GeomAlgorithmsTest, ConvexOffsetOutwardCollinearTriple)
	TEST_F (GeomAlgorithmsTest, ConvexOffsetContainment)
	TEST_F (GeomAlgorithmsTest, ConvexOffsetNonConvexThrows)
	TEST_F (GeomAlgorithmsTest, ConvexOffsetOpenThrows)
	TEST_F (GeomAlgorithmsTest, VisibilityRectangleCenter)
	TEST_F (GeomAlgorithmsTest, VisibilityConvexFull)
	TEST_F (GeomAlgorithmsTest, VisibilityOutsideThrows)
	TEST_F (GeomAlgorithmsTest, VisibilityOpenThrows)
	TEST_F (GeomAlgorithmsTest, ShortestPathSamePoint)
	TEST_F (GeomAlgorithmsTest, ShortestPathDirectLineOfSight)
	TEST_F (GeomAlgorithmsTest, ShortestPathConvex)
	TEST_F (GeomAlgorithmsTest, ShortestPathLShaped)
	TEST_F (GeomAlgorithmsTest, ShortestPathOutsideThrows)
	TEST_F (GeomAlgorithmsTest, ShortestPathOpenThrows)
	TEST_F (GeomAlgorithmsTest, ShortestPathLShapedExact)
	TEST_F (GeomAlgorithmsTest, ShortestPathUShaped)
	TEST_F (GeomAlgorithmsTest, ShortestPathTwoRooms)
	TEST_F (GeomAlgorithmsTest, ShortestPathAllSegmentsInsidePolygon)
	TEST_F (GeomAlgorithmsTest, ArrangementEmpty)
	TEST_F (GeomAlgorithmsTest, ArrangementSingleSegment)
	TEST_F (GeomAlgorithmsTest, ArrangementParallelNoIntersection)
	TEST_F (GeomAlgorithmsTest, ArrangementSimpleCross)
	TEST_F (GeomAlgorithmsTest, ArrangementTriangleFromSegments)
	TEST_F (GeomAlgorithmsTest, ArrangementStarPattern)
	TEST_F (GeomAlgorithmsTest, ArrangementEulerFormula)
	TEST_F (GeomAlgorithmsTest, ArrangementHasUnboundedFace)
	TEST_F (GeomAlgorithmsTest, ArrangementBoundedFaceVertices)
	TEST_F (GeomAlgorithmsTest, RotatedEllipseAxisAligned)
	TEST_F (GeomAlgorithmsTest, RotatedEllipse90Degrees)
	TEST_F (GeomAlgorithmsTest, RotatedEllipseExtremalPoints)
	TEST_F (GeomAlgorithmsTest, RotatedEllipseExtremalPointsAfterRotation)
	TEST_F (GeomAlgorithmsTest, RotatedEllipseSample)
	TEST_F (GeomAlgorithmsTest, RotatedEllipseSegmentIntersection)
	TEST_F (GeomAlgorithmsTest, BezierQuadraticEndpoints)
	TEST_F (GeomAlgorithmsTest, BezierQuadraticMidpoint)
	TEST_F (GeomAlgorithmsTest, BezierCubicEndpoints)
	TEST_F (GeomAlgorithmsTest, BezierCubicMidpoint)
	TEST_F (GeomAlgorithmsTest, BezierSampleQuadratic)
	TEST_F (GeomAlgorithmsTest, BezierSampleCubic)
	TEST_F (GeomAlgorithmsTest, BezierSplitCubic)
	TEST_F (GeomAlgorithmsTest, BezierControlBbox)
	TEST_F (GeomAlgorithmsTest, AlphaShapeLargeAlphaEqualsDelaunay)
	TEST_F (GeomAlgorithmsTest, AlphaShapeSmallAlphaFilters)
	TEST_F (GeomAlgorithmsTest, AlphaShapeBoundaryEdges)
	TEST_F (GeomAlgorithmsTest, PowerDiagramEqualWeights)
	TEST_F (GeomAlgorithmsTest, PowerDiagramPowerCenter)
	TEST_F (GeomAlgorithmsTest, PowerDiagramWithWeights)
	TEST_F (GeomAlgorithmsTest, PowerDiagramSquare)
	TEST_F (GeomAlgorithmsTest, RegularTriangulationEqualWeightsMatchesDelaunay)
	TEST_F (GeomAlgorithmsTest, RegularTriangulationNonUniformWeights)
	TEST_F (GeomAlgorithmsTest, PowerDiagramNonUniformWeightsCorrectness)
	TEST_F (GeomAlgorithmsTest, PowerDiagramFourSitesNonUniformWeights)
	TEST_F (GeomAlgorithmsTest, BooleanIntersectionOverlappingSquares)
	TEST_F (GeomAlgorithmsTest, BooleanIntersectionDisjoint)
	TEST_F (GeomAlgorithmsTest, BooleanUnionDisjoint)
	TEST_F (GeomAlgorithmsTest, BooleanUnionOverlapping)
	TEST_F (GeomAlgorithmsTest, BooleanDifferenceNoOverlap)
	TEST_F (GeomAlgorithmsTest, ShortestPathMultipleReflexVertices)
	TEST_F (GeomAlgorithmsTest, ShortestPathSourceTargetOnBoundary)

Function Documentation

TEST_F() [1/85]

TEST_F	(	GeomAlgorithmsTest	,
		AlphaShapeBoundaryEdges
	)

Definition at line 1526 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [2/85]

TEST_F	(	GeomAlgorithmsTest	,
		AlphaShapeLargeAlphaEqualsDelaunay
	)

Definition at line 1483 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [3/85]

TEST_F	(	GeomAlgorithmsTest	,
		AlphaShapeSmallAlphaFilters
	)

Definition at line 1504 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [4/85]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementBoundedFaceVertices
	)

Definition at line 1231 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [5/85]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementEmpty
	)

Definition at line 999 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and r.

TEST_F() [6/85]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementEulerFormula
	)

Definition at line 1124 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::find(), r, Aleph::Array< T >::reserve(), and V.

TEST_F() [7/85]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementHasUnboundedFace
	)

Definition at line 1206 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [8/85]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementParallelNoIntersection
	)

Definition at line 1027 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [9/85]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementSimpleCross
	)

Definition at line 1044 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [10/85]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementSingleSegment
	)

Definition at line 1011 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [11/85]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementStarPattern
	)

Definition at line 1096 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [12/85]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementTriangleFromSegments
	)

Definition at line 1068 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [13/85]

TEST_F	(	GeomAlgorithmsTest	,
		BezierControlBbox
	)

Definition at line 1467 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::BezierCurve::control_bbox().

TEST_F() [14/85]

TEST_F	(	GeomAlgorithmsTest	,
		BezierCubicEndpoints
	)

Definition at line 1403 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::BezierCurve::cubic().

TEST_F() [15/85]

TEST_F	(	GeomAlgorithmsTest	,
		BezierCubicMidpoint
	)

Definition at line 1412 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::BezierCurve::cubic().

TEST_F() [16/85]

TEST_F	(	GeomAlgorithmsTest	,
		BezierQuadraticEndpoints
	)

Definition at line 1379 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::BezierCurve::quadratic().

TEST_F() [17/85]

TEST_F	(	GeomAlgorithmsTest	,
		BezierQuadraticMidpoint
	)

Definition at line 1391 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::BezierCurve::quadratic().

TEST_F() [18/85]

TEST_F	(	GeomAlgorithmsTest	,
		BezierSampleCubic
	)

Definition at line 1435 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::BezierCurve::sample_cubic().

TEST_F() [19/85]

TEST_F	(	GeomAlgorithmsTest	,
		BezierSampleQuadratic
	)

Definition at line 1424 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::BezierCurve::sample_quadratic().

TEST_F() [20/85]

TEST_F	(	GeomAlgorithmsTest	,
		BezierSplitCubic
	)

Definition at line 1446 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::BezierCurve::cubic(), and Aleph::BezierCurve::split_cubic().

TEST_F() [21/85]

TEST_F	(	GeomAlgorithmsTest	,
		BooleanDifferenceNoOverlap
	)

Definition at line 1859 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::blossom_maximum_cardinality_matching(), Aleph::BooleanPolygonOperations::difference(), and Aleph::size().

TEST_F() [22/85]

TEST_F	(	GeomAlgorithmsTest	,
		BooleanIntersectionDisjoint
	)

Definition at line 1785 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::BooleanPolygonOperations::intersection().

TEST_F() [23/85]

TEST_F	(	GeomAlgorithmsTest	,
		BooleanIntersectionOverlappingSquares
	)

Definition at line 1757 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::blossom_maximum_cardinality_matching(), Aleph::BooleanPolygonOperations::intersection(), and Aleph::size().

TEST_F() [24/85]

TEST_F	(	GeomAlgorithmsTest	,
		BooleanUnionDisjoint
	)

Definition at line 1809 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::BooleanPolygonOperations::polygon_union().

TEST_F() [25/85]

TEST_F	(	GeomAlgorithmsTest	,
		BooleanUnionOverlapping
	)

Definition at line 1833 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::blossom_maximum_cardinality_matching(), Aleph::BooleanPolygonOperations::polygon_union(), and Aleph::size().

TEST_F() [26/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexDecompAllPartsConvex
	)

Definition at line 45 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::Polygon::close(), Aleph::Dlink::Iterator::has_curr(), and Aleph::orientation().

TEST_F() [27/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexDecompConvexQuad
	)

Definition at line 4 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [28/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexDecompLShape
	)

Definition at line 20 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::blossom_maximum_cardinality_matching(), Aleph::Polygon::close(), and Aleph::size().

TEST_F() [29/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexDecompVertexCoverage
	)

Definition at line 93 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::Polygon::close(), and Aleph::Dlink::Iterator::has_curr().

TEST_F() [30/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetContainment
	)

Definition at line 575 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::blossom_maximum_cardinality_matching(), Aleph::Polygon::close(), Aleph::PointInPolygonWinding::contains(), and Aleph::Polygon::size().

TEST_F() [31/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetInwardSquare
	)

Definition at line 481 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [32/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetInwardTooLarge
	)

Definition at line 497 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [33/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetNonConvexThrows
	)

Definition at line 598 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [34/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetOpenThrows
	)

Definition at line 615 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [35/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetOutwardCollinearTriple
	)

Definition at line 557 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [36/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetOutwardSquare
	)

Definition at line 528 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [37/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetOutwardTriangle
	)

Definition at line 543 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [38/85]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetZeroDistance
	)

Definition at line 513 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [39/85]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepBasicOrdering
	)

Definition at line 126 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::LineSweepFramework< Event, CmpEvent >::enqueue(), and Aleph::Array< T >::size().

TEST_F() [40/85]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepDuplicatePositions
	)

Definition at line 151 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::LineSweepFramework< Event, CmpEvent >::enqueue().

TEST_F() [41/85]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepDynamicEvents
	)

Definition at line 178 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::LineSweepFramework< Event, CmpEvent >::enqueue().

TEST_F() [42/85]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepGeometricExample
	)

Definition at line 250 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::LineSweepFramework< Event, CmpEvent >::enqueue().

TEST_F() [43/85]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepPeekAndClear
	)

Definition at line 205 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::LineSweepFramework< Event, CmpEvent >::enqueue().

TEST_F() [44/85]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepRunWithLog
	)

Definition at line 227 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::LineSweepFramework< Event, CmpEvent >::enqueue(), and log().

TEST_F() [45/85]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramEqualWeights
	)

Definition at line 1547 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [46/85]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramFourSitesNonUniformWeights
	)

Definition at line 1712 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::and, Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::Point::distance_squared_to().

TEST_F() [47/85]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramNonUniformWeightsCorrectness
	)

Definition at line 1679 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::Point::distance_squared_to().

TEST_F() [48/85]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramPowerCenter
	)

Definition at line 1566 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Point::distance_squared_to(), and Aleph::PowerDiagram::power_center().

TEST_F() [49/85]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramSquare
	)

Definition at line 1603 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [50/85]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramWithWeights
	)

Definition at line 1586 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Point::distance_squared_to(), and Aleph::PowerDiagram::power_center().

TEST_F() [51/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DBruteForce
	)

Definition at line 376 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::DynList< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), Aleph::RangeTree2D::query(), r, Aleph::RangeTree2D::size(), and y.

TEST_F() [52/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DDebugSnapshot
	)

Definition at line 425 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::DynList< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), Aleph::RangeTree2D::debug_snapshot(), and Aleph::RangeTree2D::size().

TEST_F() [53/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DDegenerateRect
	)

Definition at line 356 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::DynList< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), and Aleph::RangeTree2D::query().

TEST_F() [54/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DEmpty
	)

Definition at line 285 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), Aleph::RangeTree2D::is_empty(), Aleph::RangeTree2D::query(), r, and Aleph::RangeTree2D::size().

TEST_F() [55/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DLargeDebugSnapshotKeepsValidChildIndices
	)

Definition at line 452 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::DynList< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), and Aleph::RangeTree2D::debug_snapshot().

TEST_F() [56/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DQueryAll
	)

Definition at line 313 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::DynList< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), Aleph::RangeTree2D::query(), and r.

TEST_F() [57/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DQueryNone
	)

Definition at line 327 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::DynList< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), Aleph::RangeTree2D::query(), and r.

TEST_F() [58/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DQueryPartial
	)

Definition at line 340 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::DynList< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), Aleph::RangeTree2D::query(), and r.

TEST_F() [59/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DSameX
	)

Definition at line 398 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::DynList< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), Aleph::RangeTree2D::query(), and r.

TEST_F() [60/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DSameY
	)

Definition at line 412 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::DynList< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), Aleph::RangeTree2D::query(), and r.

TEST_F() [61/85]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DSinglePoint
	)

Definition at line 297 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::DynList< T >::append(), Aleph::blossom_maximum_cardinality_matching(), Aleph::RangeTree2D::build(), Aleph::RangeTree2D::query(), and Aleph::RangeTree2D::size().

TEST_F() [62/85]

TEST_F	(	GeomAlgorithmsTest	,
		RegularTriangulationEqualWeightsMatchesDelaunay
	)

Definition at line 1621 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [63/85]

TEST_F	(	GeomAlgorithmsTest	,
		RegularTriangulationNonUniformWeights
	)

Definition at line 1648 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Array< T >::append(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::orientation().

TEST_F() [64/85]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipse90Degrees
	)

Definition at line 1282 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::RotatedEllipse::contains(), and Aleph::RotatedEllipse::on_boundary().

TEST_F() [65/85]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipseAxisAligned
	)

Definition at line 1259 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::RotatedEllipse::contains(), Aleph::RotatedEllipse::on_boundary(), and Aleph::RotatedEllipse::strictly_contains().

TEST_F() [66/85]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipseExtremalPoints
	)

Definition at line 1302 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::RotatedEllipse::extremal_points().

TEST_F() [67/85]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipseExtremalPointsAfterRotation
	)

Definition at line 1314 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::RotatedEllipse::extremal_points(), __gmp_expr< mpq_t, mpq_t >::get_d(), and Aleph::RotatedEllipse::radius_value().

TEST_F() [68/85]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipseSample
	)

Definition at line 1336 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::RotatedEllipse::sample().

TEST_F() [69/85]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipseSegmentIntersection
	)

Definition at line 1352 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::geom_number_to_double(), Aleph::RotatedEllipse::intersection_with(), Aleph::RotatedEllipse::intersects_with(), and y1().

TEST_F() [70/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathAllSegmentsInsidePolygon
	)

Definition at line 943 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::and, Aleph::blossom_maximum_cardinality_matching(), Aleph::DynList< T >::Iterator::get_curr(), Aleph::Polygon::Segment_Iterator::has_curr(), Aleph::HTList::Iterator::has_curr(), Aleph::Segment::intersects_properly_with(), and Aleph::HTList::Iterator::next_ne().

TEST_F() [71/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathConvex
	)

Definition at line 721 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [72/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathDirectLineOfSight
	)

Definition at line 705 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [73/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathLShaped
	)

Definition at line 736 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [74/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathLShapedExact
	)

Definition at line 790 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::blossom_maximum_cardinality_matching(), and Aleph::HTList::Iterator::has_curr().

TEST_F() [75/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathMultipleReflexVertices
	)

Definition at line 1886 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::blossom_maximum_cardinality_matching(), Aleph::Polygon::close(), Aleph::Point::get_x(), Aleph::Point::get_y(), Aleph::PointInPolygonWinding::locate(), and sqrt().

TEST_F() [76/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathOpenThrows
	)

Definition at line 774 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [77/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathOutsideThrows
	)

Definition at line 760 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [78/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathSamePoint
	)

Definition at line 690 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [79/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathSourceTargetOnBoundary
	)

Definition at line 1958 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [80/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathTwoRooms
	)

Definition at line 883 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::and, Aleph::blossom_maximum_cardinality_matching(), Aleph::DynList< T >::Iterator::get_curr(), Aleph::Polygon::Segment_Iterator::has_curr(), Aleph::HTList::Iterator::has_curr(), Aleph::Segment::intersects_properly_with(), and Aleph::HTList::Iterator::next_ne().

TEST_F() [81/85]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathUShaped
	)

Definition at line 826 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::and, Aleph::blossom_maximum_cardinality_matching(), Aleph::Polygon::Segment_Iterator::has_curr(), Aleph::HTList::Iterator::has_curr(), and Aleph::Segment::intersects_properly_with().

TEST_F() [82/85]

TEST_F	(	GeomAlgorithmsTest	,
		VisibilityConvexFull
	)

Definition at line 646 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [83/85]

TEST_F	(	GeomAlgorithmsTest	,
		VisibilityOpenThrows
	)

Definition at line 675 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [84/85]

TEST_F	(	GeomAlgorithmsTest	,
		VisibilityOutsideThrows
	)

Definition at line 661 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [85/85]

TEST_F	(	GeomAlgorithmsTest	,
		VisibilityRectangleCenter
	)

Definition at line 629 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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