public Coordinate[] GetOffsetCurve(Coordinate[] inputPts, double distance) { _distance = distance; // a zero width offset curve is empty if (distance == 0.0) { return(null); } var isRightSide = distance < 0.0; double posDistance = Math.Abs(distance); OffsetSegmentGenerator segGen = GetSegmentGenerator(posDistance); if (inputPts.Length <= 1) { ComputePointCurve(inputPts[0], segGen); } else { ComputeOffsetCurve(inputPts, isRightSide, segGen); } Coordinate[] curvePts = segGen.GetCoordinates(); // for right side line is traversed in reverse direction, so have to reverse generated line if (isRightSide) { CoordinateArrays.Reverse(curvePts); } return(curvePts); }
private void ComputePointCurve(Coordinate pt, OffsetSegmentGenerator segGen) { switch (_bufParams.EndCapStyle) { case EndCapStyle.Round: segGen.CreateCircle(pt); break; case EndCapStyle.Square: segGen.CreateSquare(pt); break; // otherwise curve is empty (e.g. for a butt cap); } }
/* * private void OLDcomputeLineBufferCurve(Coordinate[] inputPts) * { * int n = inputPts.length - 1; * * // compute points for left side of line * initSideSegments(inputPts[0], inputPts[1], Position.LEFT); * for (int i = 2; i <= n; i++) { * addNextSegment(inputPts[i], true); * } * addLastSegment(); * // add line cap for end of line * addLineEndCap(inputPts[n - 1], inputPts[n]); * * // compute points for right side of line * initSideSegments(inputPts[n], inputPts[n - 1], Position.LEFT); * for (int i = n - 2; i >= 0; i--) { * addNextSegment(inputPts[i], true); * } * addLastSegment(); * // add line cap for start of line * addLineEndCap(inputPts[1], inputPts[0]); * * vertexList.closeRing(); * } */ private void ComputeSingleSidedBufferCurve(Coordinate[] inputPts, bool isRightSide, OffsetSegmentGenerator segGen) { var distTol = SimplifyTolerance(_distance); if (isRightSide) { // add original line segGen.AddSegments(inputPts, true); //---------- compute points for right side of line // Simplify the appropriate side of the line before generating var simp2 = BufferInputLineSimplifier.Simplify(inputPts, -distTol); // MD - used for testing only (to eliminate simplification) // Coordinate[] simp2 = inputPts; var n2 = simp2.Length - 1; // since we are traversing line in opposite order, offset position is still LEFT segGen.InitSideSegments(simp2[n2], simp2[n2 - 1], Positions.Left); segGen.AddFirstSegment(); for (var i = n2 - 2; i >= 0; i--) { segGen.AddNextSegment(simp2[i], true); } } else { // add original line segGen.AddSegments(inputPts, false); //--------- compute points for left side of line // Simplify the appropriate side of the line before generating var simp1 = BufferInputLineSimplifier.Simplify(inputPts, distTol); // MD - used for testing only (to eliminate simplification) // Coordinate[] simp1 = inputPts; var n1 = simp1.Length - 1; segGen.InitSideSegments(simp1[0], simp1[1], Positions.Left); segGen.AddFirstSegment(); for (var i = 2; i <= n1; i++) { segGen.AddNextSegment(simp1[i], true); } } segGen.AddLastSegment(); segGen.CloseRing(); }
/// <summary> /// This method handles the degenerate cases of single points and lines, /// as well as rings. /// </summary> /// <returns>A Coordinate array representing the curve<br/> /// or <c>null</c> if the curve is empty</returns> public Coordinate[] GetRingCurve(Coordinate[] inputPts, Positions side, double distance) { _distance = distance; if (inputPts.Length <= 2) { return(GetLineCurve(inputPts, distance)); } // optimize creating ring for for zero distance if (distance == 0.0) { return(CopyCoordinates(inputPts)); } OffsetSegmentGenerator segGen = GetSegmentGenerator(distance); ComputeRingBufferCurve(inputPts, side, segGen); return(segGen.GetCoordinates()); }
private void ComputeLineBufferCurve(Coordinate[] inputPts, OffsetSegmentGenerator segGen) { double distTol = SimplifyTolerance(_distance); //--------- compute points for left side of line // Simplify the appropriate side of the line before generating var simp1 = BufferInputLineSimplifier.Simplify(inputPts, distTol); // MD - used for testing only (to eliminate simplification) // Coordinate[] simp1 = inputPts; int n1 = simp1.Length - 1; segGen.InitSideSegments(simp1[0], simp1[1], Positions.Left); for (int i = 2; i <= n1; i++) { segGen.AddNextSegment(simp1[i], true); } segGen.AddLastSegment(); // add line cap for end of line segGen.AddLineEndCap(simp1[n1 - 1], simp1[n1]); //---------- compute points for right side of line // Simplify the appropriate side of the line before generating var simp2 = BufferInputLineSimplifier.Simplify(inputPts, -distTol); // MD - used for testing only (to eliminate simplification) // Coordinate[] simp2 = inputPts; int n2 = simp2.Length - 1; // since we are traversing line in opposite order, offset position is still LEFT segGen.InitSideSegments(simp2[n2], simp2[n2 - 1], Positions.Left); for (int i = n2 - 2; i >= 0; i--) { segGen.AddNextSegment(simp2[i], true); } segGen.AddLastSegment(); // add line cap for start of line segGen.AddLineEndCap(simp2[1], simp2[0]); segGen.CloseRing(); }
private void ComputeRingBufferCurve(Coordinate[] inputPts, Positions side, OffsetSegmentGenerator segGen) { // simplify input line to improve performance var distTol = SimplifyTolerance(_distance); // ensure that correct side is simplified if (side == Positions.Right) { distTol = -distTol; } var simp = BufferInputLineSimplifier.Simplify(inputPts, distTol); // MD - used for testing only (to eliminate simplification) // Coordinate[] simp = inputPts; var n = simp.Length - 1; segGen.InitSideSegments(simp[n - 1], simp[0], side); for (var i = 1; i <= n; i++) { var addStartPoint = i != 1; segGen.AddNextSegment(simp[i], addStartPoint); } segGen.CloseRing(); }
/* private void OLDcomputeLineBufferCurve(Coordinate[] inputPts) { int n = inputPts.length - 1; // compute points for left side of line initSideSegments(inputPts[0], inputPts[1], Position.LEFT); for (int i = 2; i <= n; i++) { addNextSegment(inputPts[i], true); } addLastSegment(); // add line cap for end of line addLineEndCap(inputPts[n - 1], inputPts[n]); // compute points for right side of line initSideSegments(inputPts[n], inputPts[n - 1], Position.LEFT); for (int i = n - 2; i >= 0; i--) { addNextSegment(inputPts[i], true); } addLastSegment(); // add line cap for start of line addLineEndCap(inputPts[1], inputPts[0]); vertexList.closeRing(); } */ private void ComputeSingleSidedBufferCurve(Coordinate[] inputPts, bool isRightSide, OffsetSegmentGenerator segGen) { var distTol = SimplifyTolerance(_distance); if (isRightSide) { // add original line segGen.AddSegments(inputPts, true); //---------- compute points for right side of line // Simplify the appropriate side of the line before generating var simp2 = BufferInputLineSimplifier.Simplify(inputPts, -distTol); // MD - used for testing only (to eliminate simplification) // Coordinate[] simp2 = inputPts; var n2 = simp2.Length - 1; // since we are traversing line in opposite order, offset position is still LEFT segGen.InitSideSegments(simp2[n2], simp2[n2 - 1], Positions.Left); segGen.AddFirstSegment(); for (var i = n2 - 2; i >= 0; i--) { segGen.AddNextSegment(simp2[i], true); } } else { // add original line segGen.AddSegments(inputPts, false); //--------- compute points for left side of line // Simplify the appropriate side of the line before generating var simp1 = BufferInputLineSimplifier.Simplify(inputPts, distTol); // MD - used for testing only (to eliminate simplification) // Coordinate[] simp1 = inputPts; var n1 = simp1.Length - 1; segGen.InitSideSegments(simp1[0], simp1[1], Positions.Left); segGen.AddFirstSegment(); for (var i = 2; i <= n1; i++) { segGen.AddNextSegment(simp1[i], true); } } segGen.AddLastSegment(); segGen.CloseRing(); }
private void ComputeRingBufferCurve(Coordinate[] inputPts, Positions side, OffsetSegmentGenerator segGen) { // simplify input line to improve performance var distTol = SimplifyTolerance(_distance); // ensure that correct side is simplified if (side == Positions.Right) distTol = -distTol; var simp = BufferInputLineSimplifier.Simplify(inputPts, distTol); // MD - used for testing only (to eliminate simplification) // Coordinate[] simp = inputPts; var n = simp.Length - 1; segGen.InitSideSegments(simp[n - 1], simp[0], side); for (var i = 1; i <= n; i++) { var addStartPoint = i != 1; segGen.AddNextSegment(simp[i], addStartPoint); } segGen.CloseRing(); }
private void ComputePointCurve(Coordinate pt, OffsetSegmentGenerator segGen) { switch (_bufParams.EndCapStyle) { case EndCapStyle.Round: segGen.CreateCircle(pt); break; case EndCapStyle.Square: segGen.CreateSquare(pt); break; // otherwise curve is empty (e.g. for a butt cap); } }