mantao/Plots.jl
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

directed_curve

Browse Source
This commit is contained in:
Thomas Breloff 2016-02-20 20:57:56 -05:00
parent 86fe244d95
commit 9da4083096
1 changed files with 8 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/components.jl
View File

@ -280,17 +280,21 @@ end
mn = mean(p,q) mn = mean(p,q)
# these points give the initial/final "rise" # these points give the initial/final "rise"
yoffset = max(0.3, min(1.0, abs(mn[2]-p[2]))) yoffset = max(0.4, min(1.0, abs(mn[2]-p[2])))
firstoffset = P2(0, yoffset) firstoffset = P2(0, yoffset)
uppery = p + firstoffset uppery = p + firstoffset
lowery = q - firstoffset lowery = q - firstoffset
# try to figure out when to loop around vs just connecting straight # try to figure out when to loop around vs just connecting straight
# TODO: choose loop direction based on sign of p[1]?? # TODO: choose loop direction based on sign of p[1]??
insideoffset = P2(0.2,0) insideoffset = P2(0.5, 0)
inside = [] inside = []
if abs(p[1]-q[1]) <= 0.1 && p[2] >= q[2] x_close_together = abs(p[1] - q[1]) <= 0.1
inside = [uppery+insideoffset, lowery+insideoffset] p_is_higher = p[2] >= q[2]
if x_close_together && p_is_higher
# add curve points which will create a loop
sgn = p[1] < 0 ? -1 : 1
inside = [uppery + sgn * insideoffset, lowery + sgn * insideoffset]
end end
BezierCurve([p, uppery, inside..., lowery, q]) BezierCurve([p, uppery, inside..., lowery, q])