1 %% Copyright (c) 2011, INRA
2 %% 2005-2011, David Legland <david.legland@grignon.inra.fr>
3 %% 2011 Adapted to Octave by Juan Pablo Carbajal <carbajal@ifi.uzh.ch>
5 %% All rights reserved.
6 %% (simplified BSD License)
8 %% Redistribution and use in source and binary forms, with or without
9 %% modification, are permitted provided that the following conditions are met:
11 %% 1. Redistributions of source code must retain the above copyright notice, this
12 %% list of conditions and the following disclaimer.
14 %% 2. Redistributions in binary form must reproduce the above copyright notice,
15 %% this list of conditions and the following disclaimer in the documentation
16 %% and/or other materials provided with the distribution.
18 %% THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 %% AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 %% IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 %% ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
22 %% LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 %% CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 %% SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 %% INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 %% CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 %% ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 %% POSSIBILITY OF SUCH DAMAGE.
30 %% The views and conclusions contained in the software and documentation are
31 %% those of the authors and should not be interpreted as representing official
32 %% policies, either expressed or implied, of copyright holder.
35 %% @deftypefn {Function File} {@var{ray} = } bisector (@var{line1}, @var{line2})
36 %% @deftypefnx {Function File} {@var{ray} = } bisector (@var{p1}, @var{p2}, @var{p3})
37 %% Return the bisector of two lines, or 3 points.
39 %% Creates the bisector of the two lines, given as [x0 y0 dx dy].
41 %% create the bisector of lines (@var{p2} @var{p1}) and (@var{p2} @var{p3}).
43 %% The result has the form [x0 y0 dx dy], with [x0 y0] being the origin
44 %% point ans [dx dy] being the direction vector, normalized to have unit
47 %% @seealso{lines2d, rays2d}
50 function ray = bisector(varargin)
52 if length(varargin)==2
57 point = intersectLines(line1, line2);
59 elseif length(varargin)==3
65 line1 = createLine(p2, p1);
66 line2 = createLine(p2, p3);
69 elseif length(varargin)==1
70 % three points, given in one array
76 line1 = createLine(p2, p1);
77 line2 = createLine(p2, p3);
82 a1 = lineAngle(line1);
83 a2 = lineAngle(line2);
85 % compute bisector angle (angle of first line + half angle between lines)
86 angle = mod(a1 + mod(a2-a1+2*pi, 2*pi)/2, pi*2);
88 % create the resulting ray
89 ray = [point cos(angle) sin(angle)];
94 %! privpath = [fileparts(which('geom2d_Contents')) filesep() 'private'];
97 %! addpath (privpath,'-end')
101 %! line1 = createLine(p0, p1);
102 %! line2 = createLine(p0, p2);
103 %! ray = bisector(line1, line2);
104 %! assertElementsAlmostEqual([0 0], ray(1,1:2));
105 %! assertAlmostEqual(pi/4, lineAngle(ray));
106 %! rmpath (privpath);
109 %! addpath (privpath,'-end')
113 %! ray = bisector(p1, p0, p2);
114 %! assertElementsAlmostEqual([0 0], ray(1,1:2));
115 %! assertAlmostEqual(pi/4, lineAngle(ray));
116 %! rmpath (privpath);
119 %! addpath (privpath,'-end')
123 %! ray = bisector([p1; p0; p2]);
124 %! assertElementsAlmostEqual([0 0], ray(1,1:2));
125 %! assertAlmostEqual(pi/4, lineAngle(ray));
126 %! rmpath (privpath);