Package dev.roanh.convexmerger.util

Interface Summary

Interface	Description
SegmentPartitionTree.PartitionTreeVisitor<T extends PartitionTree<SegmentPartitionTree.LineSegment,T>>	Interface for a function that nodes visited in a partition tree search are reported to.
SegmentPartitionTree.VisitingFunction<T extends PartitionTree<SegmentPartitionTree.LineSegment,T>>	Interface for a function that can be used to search a partition tree.

Class Summary

Class	Description
ConjugationTree<T>	Implementation of a conjugation tree inspired by the description in a paper by Herbert Edelsbrunner and Emo Welzl.
ConjugationTree.ConjugateData	Class holding data about a single conjugate line.
ConvexUtil	Class containing various utilities related to convex objects and hulls.
KDTree<T>	Implementation of a kd-tree for k = 2.
PartitionTree<T,S extends PartitionTree<T,S>>	Abstract base class for partition tree implementations.
Segment	A line segment instance with equality based on its end points.
SegmentPartitionTree<T extends PartitionTree<SegmentPartitionTree.LineSegment,T>>	Segment partition tree for efficient detection of line intersections with the stored line set.
SegmentPartitionTree.LineSegment	Represents a line segment between two end points.
SegmentPartitionTree.SegmentPartitionTreeConstructor<T extends PartitionTree<SegmentPartitionTree.LineSegment,T>>	A class that can create new instances of a segment partition tree based on a specific partition tree type.
VerticalDecomposition	Vertical decomposition of a plane containing non-overlapping convex objects.
VerticalDecomposition.DecompositionPoint	A structure to represent a point in the vertical decomposition.
VerticalDecomposition.DecompVertex	Represents a vertex in the search structure of the decomposition.
VerticalDecomposition.Line	A line instance with equality based on its end points, extended with information about decomposition trapezoids.

Enum Summary

Enum	Description
VerticalDecomposition.DecompVertexType	Enum to denote the type of a decomposition vertex.