scalarMultiple | Data.Geometry.Vector, Data.Geometry |
scaleBy | Data.Geometry.Transformation, Data.Geometry |
scaled | Data.Geometry.Vector, Data.Geometry |
scaleUniformlyBy | Data.Geometry.Transformation, Data.Geometry |
scaling | Data.Geometry.Transformation, Data.Geometry |
screenDimensions | Graphics.Camera |
search | |
1 (Function) | Data.Geometry.IntervalTree |
2 (Function) | Data.Geometry.SegmentTree.Generic, Data.Geometry.SegmentTree |
3 (Function) | Data.Geometry.RangeTree.Generic |
4 (Function) | Data.Geometry.RangeTree |
search' | |
1 (Function) | Data.Geometry.RangeTree.Generic |
2 (Function) | Data.Geometry.RangeTree |
search'' | Data.Geometry.RangeTree.Generic |
searchKDTree | Data.Geometry.KDTree |
searchKDTree' | Data.Geometry.KDTree |
seg | Algorithms.Geometry.PolygonTriangulation.TriangulateMonotone |
segmentLength | Data.Geometry.LineSegment, Data.Geometry |
SegmentTree | |
1 (Type/Class) | Data.Geometry.SegmentTree.Generic, Data.Geometry.SegmentTree |
2 (Data Constructor) | Data.Geometry.SegmentTree.Generic, Data.Geometry.SegmentTree |
separatingLine | Algorithms.Geometry.RedBlueSeparator.RIC |
separatingLine' | Algorithms.Geometry.RedBlueSeparator.RIC |
separatingLine'' | Algorithms.Geometry.RedBlueSeparator.RIC |
Set' | Algorithms.Geometry.LineSegmentIntersection.Types |
shiftLeft | Data.Geometry.Interval, Data.Geometry.LineSegment, Data.Geometry |
shiftLeft' | Data.Geometry.Interval, Data.Geometry.LineSegment, Data.Geometry |
shiftRight | Data.Geometry.Interval, Data.Geometry.LineSegment, Data.Geometry |
ShortSide | Algorithms.Geometry.WellSeparatedPairDecomposition.Types |
shortSide | Algorithms.Geometry.WellSeparatedPairDecomposition.Types |
shouldSplitZeros | Data.Geometry.QuadTree |
showDT | Algorithms.Geometry.DelaunayTriangulation.Types |
sideDirections | Data.Geometry.Box.Sides, Data.Geometry.Box |
sideIntersections | Data.Geometry.Arrangement.Internal |
Sides | |
1 (Type/Class) | Data.Geometry.Box.Sides, Data.Geometry.Box |
2 (Data Constructor) | Data.Geometry.Box.Sides, Data.Geometry.Box |
sides | Data.Geometry.Box.Sides, Data.Geometry.Box |
sides' | Data.Geometry.Box.Sides, Data.Geometry.Box |
sideSegments | Data.Geometry.Triangle |
SideTest | Data.Geometry.Line.Internal, Data.Geometry.Line, Data.Geometry |
sideTest | Algorithms.Geometry.SoS |
sideTest' | Algorithms.Geometry.SoS |
SideTestUpDown | Data.Geometry.Line.Internal, Data.Geometry.Line, Data.Geometry |
Sign | |
1 (Type/Class) | Algorithms.Geometry.SoS |
2 (Type/Class) | Data.Geometry.QuadTree |
signDet | Algorithms.Geometry.SoS |
signedArea | Data.Geometry.Polygon, Data.Geometry |
signFromTerms | Algorithms.Geometry.SoS |
signOf | Algorithms.Geometry.SoS.Symbolic |
signorm | Data.Geometry.Vector, Data.Geometry |
Signs | Data.Geometry.QuadTree |
Simple | Data.Geometry.Polygon, Data.Geometry |
SimplePolygon | |
1 (Type/Class) | Data.Geometry.Polygon, Data.Geometry |
2 (Data Constructor) | Data.Geometry.Polygon, Data.Geometry |
simplePolygon | Data.Geometry.Polygon.Convex |
Single | Algorithms.Geometry.LinearProgramming.Types |
SingPeano | Data.Geometry.Vector.VectorFamilyPeano |
size | Data.Geometry.Box.Internal, Data.Geometry.Box |
size' | Algorithms.Geometry.DelaunayTriangulation.DivideAndConquer |
skewX | Data.Geometry.Transformation, Data.Geometry |
Slab | |
1 (Type/Class) | Data.Geometry.Slab |
2 (Data Constructor) | Data.Geometry.Slab |
smallestEnclosingDisk | |
1 (Function) | Algorithms.Geometry.SmallestEnclosingBall.Naive |
2 (Function) | Algorithms.Geometry.SmallestEnclosingBall.RIC |
smallestEnclosingDisk' | Algorithms.Geometry.SmallestEnclosingBall.RIC |
smallestEnclosingDiskWithPoint | Algorithms.Geometry.SmallestEnclosingBall.RIC |
smallestEnclosingDiskWithPoints | Algorithms.Geometry.SmallestEnclosingBall.RIC |
snap | Data.Geometry.BezierSpline |
snd' | Algorithms.Geometry.DelaunayTriangulation.Types |
snoc | |
1 (Function) | Data.Geometry.Vector.VectorFixed |
2 (Function) | Data.Geometry.Vector.VectorFamily, Data.Geometry.Vector, Data.Geometry |
solveBoundedLinearProgram | Algorithms.Geometry.LinearProgramming.LP2DRIC |
solveBoundedLinearProgram' | Algorithms.Geometry.LinearProgramming.LP2DRIC |
SomePolygon | Data.Geometry.Polygon, Data.Geometry |
sortAround | Data.Geometry.Point, Data.Geometry |
sortAround' | Algorithms.Geometry.DelaunayTriangulation.Naive |
SoS | Algorithms.Geometry.SoS |
South | Data.Geometry.Directions |
south | Data.Geometry.Box.Sides, Data.Geometry.Box |
SouthEast | Data.Geometry.Directions |
southEast | Data.Geometry.Box.Corners, Data.Geometry.QuadTree.Quadrants, Data.Geometry.Box |
SouthWest | Data.Geometry.Directions |
southWest | Data.Geometry.Box.Corners, Data.Geometry.QuadTree.Quadrants, Data.Geometry.Box |
Sphere | |
1 (Type/Class) | Data.Geometry.Ball |
2 (Data Constructor) | Data.Geometry.Ball |
Split | |
1 (Type/Class) | Data.Geometry.QuadTree.Split |
2 (Type/Class) | Data.Geometry.KDTree |
3 (Data Constructor) | Data.Geometry.KDTree |
4 (Data Constructor) | Algorithms.Geometry.PolygonTriangulation.MakeMonotone |
split | |
1 (Function) | Data.Geometry.BezierSpline |
2 (Function) | Algorithms.Geometry.PolyLineSimplification.DouglasPeucker |
Split' | Data.Geometry.KDTree |
splitCell | Data.Geometry.QuadTree.Cell |
splitDim | Algorithms.Geometry.WellSeparatedPairDecomposition.Types |
splitOn | Data.Geometry.KDTree |
splitPoint | |
1 (Function) | Data.Geometry.IntervalTree |
2 (Function) | Data.Geometry.SegmentTree.Generic, Data.Geometry.SegmentTree |
splitPolygon | Algorithms.Geometry.PolygonTriangulation.TriangulateMonotone |
Splitter | Data.Geometry.QuadTree.Split |
SplitTree | Algorithms.Geometry.WellSeparatedPairDecomposition.Types |
sqDistanceTo | Data.Geometry.Line.Internal, Data.Geometry.Line, Data.Geometry |
sqDistanceToArg | Data.Geometry.Line.Internal, Data.Geometry.Line, Data.Geometry |
sqDistanceToSeg | Data.Geometry.LineSegment, Data.Geometry |
sqDistanceToSegArg | Data.Geometry.LineSegment, Data.Geometry |
squaredEuclideanDist | Data.Geometry.Point, Data.Geometry |
squaredRadius | Data.Geometry.Ball |
SS | Data.Geometry.Vector.VectorFamilyPeano |
ST | |
1 (Type/Class) | Algorithms.Geometry.DelaunayTriangulation.Types |
2 (Data Constructor) | Algorithms.Geometry.DelaunayTriangulation.Types |
ST' | Algorithms.Geometry.DelaunayTriangulation.Types |
stab | |
1 (Function) | Data.Geometry.IntervalTree |
2 (Function) | Data.Geometry.SegmentTree.Generic, Data.Geometry.SegmentTree |
Stack | Algorithms.Geometry.PolygonTriangulation.TriangulateMonotone |
Start | |
1 (Data Constructor) | Algorithms.Geometry.LineSegmentIntersection.BentleyOttmann |
2 (Data Constructor) | Algorithms.Geometry.PolygonTriangulation.MakeMonotone |
start | Data.Geometry.Interval, Data.Geometry.LineSegment, Data.Geometry |
StartCore | Data.Geometry.Interval, Data.Geometry.LineSegment, Data.Geometry |
StartExtra | Data.Geometry.Interval, Data.Geometry.LineSegment, Data.Geometry |
startingCell | Data.Geometry.QuadTree |
startPoint | Data.Geometry.HalfLine |
startSegs | Algorithms.Geometry.LineSegmentIntersection.BentleyOttmann |
StatusStructure | Algorithms.Geometry.LineSegmentIntersection.BentleyOttmann |
steepestCcwFrom | Algorithms.Geometry.ConvexHull.JarvisMarch |
steepestCwFrom | Algorithms.Geometry.ConvexHull.JarvisMarch |
strictVerticalSeparatingLine | Algorithms.Geometry.RedBlueSeparator.RIC |
subBezier | Data.Geometry.BezierSpline |
subdivision | Data.Geometry.Arrangement.Internal, Data.Geometry.Arrangement |
SubLine | |
1 (Type/Class) | Data.Geometry.SubLine |
2 (Data Constructor) | Data.Geometry.SubLine |
subRange | Data.Geometry.SubLine |
succ' | Algorithms.Geometry.DelaunayTriangulation.DivideAndConquer |
suitableBase | Algorithms.Geometry.SoS.Symbolic |
sumV | Data.Geometry.Vector, Data.Geometry |
supportingLine | Data.Geometry.Line.Internal, Data.Geometry.Line, Data.Geometry |
supportingPlane | Data.Geometry.HyperPlane |
sweep | Algorithms.Geometry.LineSegmentIntersection.BentleyOttmann |
Symbolic | Algorithms.Geometry.SoS.Symbolic |
symbolic | Algorithms.Geometry.SoS.Symbolic |
SZ | Data.Geometry.Vector.VectorFamilyPeano |