f6f411bff01b79f2b25db100c500573614e5203c
1 #define __LINE_GEOMETRY_C__
3 /*
4 * Routines for dealing with lines (intersections, etc.)
5 *
6 * Authors:
7 * Maximilian Albert <Anhalter42@gmx.de>
8 *
9 * Copyright (C) 2007 authors
10 *
11 * Released under GNU GPL, read the file 'COPYING' for more information
12 */
14 #include "line-geometry.h"
15 #include "inkscape.h"
16 #include "desktop-style.h"
17 #include "desktop-handles.h"
18 #include "display/sp-canvas.h"
19 #include "display/sodipodi-ctrl.h"
20 //#include "display/curve.cpp"
22 namespace Box3D {
24 /**
25 * Draw a line beginning at 'start'. If is_endpoint is true, use 'vec' as the endpoint
26 * of the segment. Otherwise interpret it as the direction of the line.
27 * FIXME: Think of a better way to distinguish between the two constructors of lines.
28 */
29 Line::Line(NR::Point const &start, NR::Point const &vec, bool is_endpoint) {
30 pt = start;
31 if (is_endpoint)
32 v_dir = vec - start;
33 else
34 v_dir = vec;
35 normal = v_dir.ccw();
36 d0 = NR::dot(normal, pt);
37 }
39 Line::Line(Line const &line) {
40 pt = line.pt;
41 v_dir = line.v_dir;
42 normal = line.normal;
43 d0 = line.d0;
44 }
46 Line &Line::operator=(Line const &line) {
47 pt = line.pt;
48 v_dir = line.v_dir;
49 normal = line.normal;
50 d0 = line.d0;
52 return *this;
53 }
55 NR::Maybe<NR::Point> Line::intersect(Line const &line) {
56 NR::Coord denom = NR::dot(v_dir, line.normal);
57 NR::Maybe<NR::Point> no_point = NR::Nothing();
58 g_return_val_if_fail(fabs(denom) > 1e-6, no_point );
60 NR::Coord lambda = (line.d0 - NR::dot(pt, line.normal)) / denom;
61 return pt + lambda * v_dir;
62 }
64 void Line::set_direction(NR::Point const &dir)
65 {
66 v_dir = dir;
67 normal = v_dir.ccw();
68 d0 = NR::dot(normal, pt);
69 }
71 NR::Point Line::closest_to(NR::Point const &pt)
72 {
73 /* return the intersection of this line with a perpendicular line passing through pt */
74 NR::Maybe<NR::Point> result = this->intersect(Line(pt, (this->v_dir).ccw(), false));
75 g_return_val_if_fail (result, NR::Point (0.0, 0.0));
76 return *result;
77 }
79 double Line::lambda (NR::Point const pt)
80 {
81 double sign = (NR::dot (pt - this->pt, this->v_dir) > 0) ? 1.0 : -1.0;
82 double lambda = sign * NR::L2 (pt - this->pt);
83 // FIXME: It may speed things up (but how much?) if we assume that
84 // pt lies on the line and thus skip the following test
85 NR::Point test = point_from_lambda (lambda);
86 if (!pts_coincide (pt, test)) {
87 g_warning ("Point does not lie on line.\n");
88 return 0;
89 }
90 return lambda;
91 }
93 inline static double determinant (NR::Point const &a, NR::Point const &b)
94 {
95 return (a[NR::X] * b[NR::Y] - a[NR::Y] * b[NR::X]);
96 }
98 /* The coordinates of w with respect to the basis {v1, v2} */
99 std::pair<double, double> coordinates (NR::Point const &v1, NR::Point const &v2, NR::Point const &w)
100 {
101 double det = determinant (v1, v2);;
102 if (fabs (det) < epsilon) {
103 g_warning ("Vectors do not form a basis.\n");
104 return std::make_pair (0.0, 0.0);
105 }
107 double lambda1 = determinant (w, v2) / det;
108 double lambda2 = determinant (v1, w) / det;
109 return std::make_pair (lambda1, lambda2);
110 }
112 /* whether w lies inside the sector spanned by v1 and v2 */
113 bool lies_in_sector (NR::Point const &v1, NR::Point const &v2, NR::Point const &w)
114 {
115 std::pair<double, double> coords = coordinates (v1, v2, w);
116 return (coords.first >= 0 and coords.second >= 0);
117 }
119 static double pos_angle (NR::Point A, NR::Point B)
120 {
121 return fabs (NR::atan2 (A) - NR::atan2 (B));
122 }
124 /*
125 * Returns the two corners of the quadrangle A, B, C, D spanning the edge that is hit by a semiline
126 * starting at pt and going into direction dir.
127 * If none of the sides is hit, it returns a pair containing two identical points.
128 */
129 std::pair<NR::Point, NR::Point>
130 side_of_intersection (NR::Point const &A, NR::Point const &B, NR::Point const &C, NR::Point const &D,
131 NR::Point const &pt, NR::Point const &dir)
132 {
133 NR::Point dir_A (A - pt);
134 NR::Point dir_B (B - pt);
135 NR::Point dir_C (C - pt);
136 NR::Point dir_D (D - pt);
138 std::pair<NR::Point, NR::Point> result;
139 double angle = -1;
140 double tmp_angle;
142 if (lies_in_sector (dir_A, dir_B, dir)) {
143 result = std::make_pair (A, B);
144 angle = pos_angle (dir_A, dir_B);
145 }
146 if (lies_in_sector (dir_B, dir_C, dir)) {
147 tmp_angle = pos_angle (dir_B, dir_C);
148 if (tmp_angle > angle) {
149 angle = tmp_angle;
150 result = std::make_pair (B, C);
151 }
152 }
153 if (lies_in_sector (dir_C, dir_D, dir)) {
154 tmp_angle = pos_angle (dir_C, dir_D);
155 if (tmp_angle > angle) {
156 angle = tmp_angle;
157 result = std::make_pair (C, D);
158 }
159 }
160 if (lies_in_sector (dir_D, dir_A, dir)) {
161 tmp_angle = pos_angle (dir_D, dir_A);
162 if (tmp_angle > angle) {
163 angle = tmp_angle;
164 result = std::make_pair (D, A);
165 }
166 }
167 if (angle == -1) {
168 // no intersection found; return a pair containing two identical points
169 return std::make_pair (A, A);
170 } else {
171 return result;
172 }
173 }
175 double cross_ratio (NR::Point const &A, NR::Point const &B, NR::Point const &C, NR::Point const &D)
176 {
177 Line line (A, D);
178 double lambda_A = line.lambda (A);
179 double lambda_B = line.lambda (B);
180 double lambda_C = line.lambda (C);
181 double lambda_D = line.lambda (D);
183 if (fabs (lambda_D - lambda_A) < epsilon || fabs (lambda_C - lambda_B) < epsilon) {
184 // FIXME: What should we return if the cross ratio can't be computed?
185 return 0;
186 //return NR_HUGE;
187 }
188 return (((lambda_C - lambda_A) / (lambda_D - lambda_A)) * ((lambda_D - lambda_B) / (lambda_C - lambda_B)));
189 }
191 double cross_ratio (VanishingPoint const &V, NR::Point const &B, NR::Point const &C, NR::Point const &D)
192 {
193 if (V.is_finite()) {
194 return cross_ratio (V.get_pos(), B, C, D);
195 } else {
196 Line line (B, D);
197 double lambda_B = line.lambda (B);
198 double lambda_C = line.lambda (C);
199 double lambda_D = line.lambda (D);
201 if (fabs (lambda_C - lambda_B) < epsilon) {
202 // FIXME: What should we return if the cross ratio can't be computed?
203 return 0;
204 //return NR_HUGE;
205 }
206 return (lambda_D - lambda_B) / (lambda_C - lambda_B);
207 }
208 }
210 NR::Point fourth_pt_with_given_cross_ratio (NR::Point const &A, NR::Point const &C, NR::Point const &D, double gamma)
211 {
212 Line line (A, D);
213 double lambda_A = line.lambda (A);
214 double lambda_C = line.lambda (C);
215 double lambda_D = line.lambda (D);
217 double beta = (lambda_C - lambda_A) / (lambda_D - lambda_A);
218 if (fabs (beta - gamma) < epsilon) {
219 // FIXME: How to handle the case when the point can't be computed?
220 // g_warning ("Cannot compute point with given cross ratio.\n");
221 return NR::Point (0.0, 0.0);
222 }
223 return line.point_from_lambda ((beta * lambda_D - gamma * lambda_C) / (beta - gamma));
224 }
226 void create_canvas_point(NR::Point const &pos, double size, guint32 rgba)
227 {
228 SPDesktop *desktop = inkscape_active_desktop();
229 SPCanvasItem * canvas_pt = sp_canvas_item_new(sp_desktop_controls(desktop), SP_TYPE_CTRL,
230 "size", size,
231 "filled", 1,
232 "fill_color", rgba,
233 "stroked", 1,
234 "stroke_color", 0x000000ff,
235 NULL);
236 SP_CTRL(canvas_pt)->moveto(pos);
237 }
239 void create_canvas_line(NR::Point const &p1, NR::Point const &p2, guint32 rgba)
240 {
241 SPDesktop *desktop = inkscape_active_desktop();
242 SPCanvasItem *line = sp_canvas_item_new(sp_desktop_controls(desktop),
243 SP_TYPE_CTRLLINE, NULL);
244 sp_ctrlline_set_coords(SP_CTRLLINE(line), p1, p2);
245 sp_ctrlline_set_rgba32 (SP_CTRLLINE(line), rgba);
246 sp_canvas_item_show (line);
247 }
249 } // namespace Box3D
251 /*
252 Local Variables:
253 mode:c++
254 c-file-style:"stroustrup"
255 c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
256 indent-tabs-mode:nil
257 fill-column:99
258 End:
259 */
260 // vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:encoding=utf-8:textwidth=99 :