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, 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, 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/83]

TEST_F	(	GeomAlgorithmsTest	,
		AlphaShapeBoundaryEdges
	)

Definition at line 1479 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [2/83]

TEST_F	(	GeomAlgorithmsTest	,
		AlphaShapeLargeAlphaEqualsDelaunay
	)

Definition at line 1436 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [3/83]

TEST_F	(	GeomAlgorithmsTest	,
		AlphaShapeSmallAlphaFilters
	)

Definition at line 1457 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [4/83]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementBoundedFaceVertices
	)

Definition at line 1205 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [5/83]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementEmpty
	)

Definition at line 973 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::divide_and_conquer_partition_dp(), and r.

TEST_F() [6/83]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementEulerFormula
	)

Definition at line 1098 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [7/83]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementHasUnboundedFace
	)

Definition at line 1180 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [8/83]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementParallelNoIntersection
	)

Definition at line 1001 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [9/83]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementSimpleCross
	)

Definition at line 1018 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [10/83]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementSingleSegment
	)

Definition at line 985 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [11/83]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementStarPattern
	)

Definition at line 1070 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [12/83]

TEST_F	(	GeomAlgorithmsTest	,
		ArrangementTriangleFromSegments
	)

Definition at line 1042 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [13/83]

TEST_F	(	GeomAlgorithmsTest	,
		BezierControlBbox
	)

Definition at line 1420 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [14/83]

TEST_F	(	GeomAlgorithmsTest	,
		BezierCubicEndpoints
	)

Definition at line 1356 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [15/83]

TEST_F	(	GeomAlgorithmsTest	,
		BezierCubicMidpoint
	)

Definition at line 1365 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [16/83]

TEST_F	(	GeomAlgorithmsTest	,
		BezierQuadraticEndpoints
	)

Definition at line 1332 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [17/83]

TEST_F	(	GeomAlgorithmsTest	,
		BezierQuadraticMidpoint
	)

Definition at line 1344 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [18/83]

TEST_F	(	GeomAlgorithmsTest	,
		BezierSampleCubic
	)

Definition at line 1388 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [19/83]

TEST_F	(	GeomAlgorithmsTest	,
		BezierSampleQuadratic
	)

Definition at line 1377 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [20/83]

TEST_F	(	GeomAlgorithmsTest	,
		BezierSplitCubic
	)

Definition at line 1399 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [21/83]

TEST_F	(	GeomAlgorithmsTest	,
		BooleanDifferenceNoOverlap
	)

Definition at line 1812 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [22/83]

TEST_F	(	GeomAlgorithmsTest	,
		BooleanIntersectionDisjoint
	)

Definition at line 1738 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [23/83]

TEST_F	(	GeomAlgorithmsTest	,
		BooleanIntersectionOverlappingSquares
	)

Definition at line 1710 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [24/83]

TEST_F	(	GeomAlgorithmsTest	,
		BooleanUnionDisjoint
	)

Definition at line 1762 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [25/83]

TEST_F	(	GeomAlgorithmsTest	,
		BooleanUnionOverlapping
	)

Definition at line 1786 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [26/83]

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::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), Aleph::Dlink::Iterator::has_curr(), and Aleph::orientation().

TEST_F() [27/83]

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::Polygon::close(), and Aleph::divide_and_conquer_partition_dp().

TEST_F() [28/83]

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::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), and Aleph::size().

TEST_F() [29/83]

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::Polygon::close(), Aleph::divide_and_conquer_partition_dp(), and Aleph::Dlink::Iterator::has_curr().

TEST_F() [30/83]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetContainment
	)

Definition at line 549 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [31/83]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetInwardSquare
	)

Definition at line 455 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [32/83]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetInwardTooLarge
	)

Definition at line 471 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [33/83]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetNonConvexThrows
	)

Definition at line 572 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [34/83]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetOpenThrows
	)

Definition at line 589 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [35/83]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetOutwardCollinearTriple
	)

Definition at line 531 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [36/83]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetOutwardSquare
	)

Definition at line 502 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [37/83]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetOutwardTriangle
	)

Definition at line 517 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [38/83]

TEST_F	(	GeomAlgorithmsTest	,
		ConvexOffsetZeroDistance
	)

Definition at line 487 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [39/83]

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::divide_and_conquer_partition_dp(), Aleph::LineSweepFramework< Event, CmpEvent >::enqueue(), and Aleph::Array< T >::size().

TEST_F() [40/83]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepDuplicatePositions
	)

Definition at line 151 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [41/83]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepDynamicEvents
	)

Definition at line 178 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [42/83]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepGeometricExample
	)

Definition at line 250 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [43/83]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepPeekAndClear
	)

Definition at line 205 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [44/83]

TEST_F	(	GeomAlgorithmsTest	,
		LineSweepRunWithLog
	)

Definition at line 227 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [45/83]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramEqualWeights
	)

Definition at line 1500 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [46/83]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramFourSitesNonUniformWeights
	)

Definition at line 1665 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [47/83]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramNonUniformWeightsCorrectness
	)

Definition at line 1632 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [48/83]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramPowerCenter
	)

Definition at line 1519 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::PowerDiagram::power_center().

TEST_F() [49/83]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramSquare
	)

Definition at line 1556 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [50/83]

TEST_F	(	GeomAlgorithmsTest	,
		PowerDiagramWithWeights
	)

Definition at line 1539 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::PowerDiagram::power_center().

TEST_F() [51/83]

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::RangeTree2D::build(), Aleph::divide_and_conquer_partition_dp(), Aleph::RangeTree2D::query(), r, Aleph::RangeTree2D::size(), and y.

TEST_F() [52/83]

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::RangeTree2D::build(), Aleph::RangeTree2D::debug_snapshot(), Aleph::divide_and_conquer_partition_dp(), and Aleph::RangeTree2D::size().

TEST_F() [53/83]

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::RangeTree2D::build(), Aleph::divide_and_conquer_partition_dp(), and Aleph::RangeTree2D::query().

TEST_F() [54/83]

TEST_F	(	GeomAlgorithmsTest	,
		RangeTree2DEmpty
	)

Definition at line 285 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [55/83]

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::RangeTree2D::build(), Aleph::divide_and_conquer_partition_dp(), Aleph::RangeTree2D::query(), and r.

TEST_F() [56/83]

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::RangeTree2D::build(), Aleph::divide_and_conquer_partition_dp(), Aleph::RangeTree2D::query(), and r.

TEST_F() [57/83]

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::RangeTree2D::build(), Aleph::divide_and_conquer_partition_dp(), Aleph::RangeTree2D::query(), and r.

TEST_F() [58/83]

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::RangeTree2D::build(), Aleph::divide_and_conquer_partition_dp(), Aleph::RangeTree2D::query(), and r.

TEST_F() [59/83]

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::RangeTree2D::build(), Aleph::divide_and_conquer_partition_dp(), Aleph::RangeTree2D::query(), and r.

TEST_F() [60/83]

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::RangeTree2D::build(), Aleph::divide_and_conquer_partition_dp(), Aleph::RangeTree2D::query(), and Aleph::RangeTree2D::size().

TEST_F() [61/83]

TEST_F	(	GeomAlgorithmsTest	,
		RegularTriangulationEqualWeightsMatchesDelaunay
	)

Definition at line 1574 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [62/83]

TEST_F	(	GeomAlgorithmsTest	,
		RegularTriangulationNonUniformWeights
	)

Definition at line 1601 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [63/83]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipse90Degrees
	)

Definition at line 1256 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [64/83]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipseAxisAligned
	)

Definition at line 1233 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [65/83]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipseExtremalPoints
	)

Definition at line 1276 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [66/83]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipseSample
	)

Definition at line 1289 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [67/83]

TEST_F	(	GeomAlgorithmsTest	,
		RotatedEllipseSegmentIntersection
	)

Definition at line 1305 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [68/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathAllSegmentsInsidePolygon
	)

Definition at line 917 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::and, Aleph::divide_and_conquer_partition_dp(), 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() [69/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathConvex
	)

Definition at line 695 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [70/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathDirectLineOfSight
	)

Definition at line 679 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [71/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathLShaped
	)

Definition at line 710 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [72/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathLShapedExact
	)

Definition at line 764 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [73/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathMultipleReflexVertices
	)

Definition at line 1839 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [74/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathOpenThrows
	)

Definition at line 748 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [75/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathOutsideThrows
	)

Definition at line 734 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [76/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathSamePoint
	)

Definition at line 664 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [77/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathSourceTargetOnBoundary
	)

Definition at line 1911 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [78/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathTwoRooms
	)

Definition at line 857 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

References Aleph::Polygon::add_vertex(), Aleph::and, Aleph::divide_and_conquer_partition_dp(), 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() [79/83]

TEST_F	(	GeomAlgorithmsTest	,
		ShortestPathUShaped
	)

Definition at line 800 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [80/83]

TEST_F	(	GeomAlgorithmsTest	,
		VisibilityConvexFull
	)

Definition at line 620 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [81/83]

TEST_F	(	GeomAlgorithmsTest	,
		VisibilityOpenThrows
	)

Definition at line 649 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [82/83]

TEST_F	(	GeomAlgorithmsTest	,
		VisibilityOutsideThrows
	)

Definition at line 635 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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

TEST_F() [83/83]

TEST_F	(	GeomAlgorithmsTest	,
		VisibilityRectangleCenter
	)

Definition at line 603 of file geom_algorithms_test_decomp_rangetree_visibility_shortestpath_arrangement.cc.

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