/usr/include/CGAL/squared_distance_utils.h is in libcgal-dev 4.11-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 | // Copyright (c) 1998
// Utrecht University (The Netherlands),
// ETH Zurich (Switzerland),
// INRIA Sophia-Antipolis (France),
// Max-Planck-Institute Saarbruecken (Germany),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 3 of the License,
// or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
//
//
// Author(s) : Geert-Jan Giezeman
#ifndef CGAL_SQUARED_DISTANCE_UTILS_H
#define CGAL_SQUARED_DISTANCE_UTILS_H
#include <CGAL/determinant.h>
#include <CGAL/wmult.h>
namespace CGAL {
namespace internal {
template <class K>
bool is_null(const typename K::Vector_2 &v, const K&)
{
typedef typename K::RT RT;
return v.hx()==RT(0) && v.hy()==RT(0);
}
template <class K>
typename K::RT
wdot(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K&)
{
return (u.hx()*v.hx() + u.hy()*v.hy());
}
template <class K>
typename K::RT wdot_tag(const typename K::Point_2 &p,
const typename K::Point_2 &q,
const typename K::Point_2 &r,
const K&,
const Cartesian_tag&)
{
return (p.x() - q.x()) * (r.x() - q.x())
+ (p.y() - q.y()) * (r.y() - q.y());
}
template <class K>
typename K::RT wdot_tag(const typename K::Point_2 &p,
const typename K::Point_2 &q,
const typename K::Point_2 &r,
const K&,
const Homogeneous_tag&)
{
return (p.hx() * q.hw() - q.hx() * p.hw())
* (r.hx() * q.hw() - q.hx() * r.hw())
+ (p.hy() * q.hw() - q.hy() * p.hw())
* (r.hy() * q.hw() - q.hy() * r.hw());
}
template <class K>
typename K::RT wdot(const typename K::Point_2 &p,
const typename K::Point_2 &q,
const typename K::Point_2 &r,
const K& k)
{
typedef typename K::Kernel_tag Tag;
Tag tag;
return wdot_tag(p, q, r, k, tag);
}
template <class K>
typename K::RT
wcross(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K&)
{
return (typename K::RT)(u.hx()*v.hy() - u.hy()*v.hx());
}
template <class K>
inline
typename K::RT
wcross_tag(const typename K::Point_2 &p,
const typename K::Point_2 &q,
const typename K::Point_2 &r,
const K&,
const Homogeneous_tag&)
{
return CGAL::determinant(
p.hx(), q.hx(), r.hx(),
p.hy(), q.hy(), r.hy(),
p.hw(), q.hw(), r.hw());
}
template <class K>
inline
typename K::FT
wcross_tag(const typename K::Point_2 &p,
const typename K::Point_2 &q,
const typename K::Point_2 &r,
const K&,
const Cartesian_tag&)
{
return (q.x()-p.x())*(r.y()-q.y()) - (q.y()-p.y())*(r.x()-q.x());
}
template <class K>
typename K::RT wcross(const typename K::Point_2 &p,
const typename K::Point_2 &q,
const typename K::Point_2 &r,
const K& k)
{
typedef typename K::Kernel_tag Tag;
Tag tag;
return wcross_tag(p, q, r, k, tag);
}
template <class K>
inline bool is_acute_angle(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K& k)
{
typedef typename K::RT RT;
return RT(wdot(u, v, k)) > RT(0) ;
}
template <class K>
inline bool is_straight_angle(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K& k)
{
typedef typename K::RT RT;
return RT(wdot(u, v, k)) == RT(0) ;
}
template <class K>
inline bool is_obtuse_angle(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K& k)
{
typedef typename K::RT RT;
return RT(wdot(u, v, k)) < RT(0) ;
}
template <class K>
inline bool is_acute_angle(const typename K::Point_2 &p,
const typename K::Point_2 &q,
const typename K::Point_2 &r,
const K& k)
{
typedef typename K::RT RT;
return RT(wdot(p, q, r, k)) > RT(0) ;
}
template <class K>
inline bool is_straight_angle(const typename K::Point_2 &p,
const typename K::Point_2 &q,
const typename K::Point_2 &r,
const K& k)
{
typedef typename K::RT RT;
return RT(wdot(p, q, r, k)) == RT(0) ;
}
template <class K>
inline bool is_obtuse_angle(const typename K::Point_2 &p,
const typename K::Point_2 &q,
const typename K::Point_2 &r,
const K& k)
{
typedef typename K::RT RT;
return RT(wdot(p, q, r, k)) < RT(0) ;
}
template <class K>
inline bool counterclockwise(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K& k)
{
typedef typename K::RT RT;
return RT(wcross(u,v, k)) > RT(0);
}
template <class K>
inline bool left_turn(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K& k)
{
typedef typename K::RT RT;
return RT(wcross(u,v, k)) > RT(0);
}
template <class K>
inline bool clockwise(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K& k)
{
typedef typename K::RT RT;
return RT(wcross(u,v, k)) < RT(0);
}
template <class K>
inline bool right_turn(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K& k)
{
typedef typename K::RT RT;
return RT(wcross(u,v, k)) < RT(0);
}
template <class K>
inline bool collinear(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K& k)
{
typedef typename K::RT RT;
return RT(wcross(u,v, k)) == RT(0);
}
/*
the ordertype, right_turn, left_turn and collinear routines for points are
defined elsewhere.
*/
template <class K>
inline
bool
same_direction_tag(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K&,
const Cartesian_tag&)
{
typedef typename K::FT FT;
const FT& ux = u.x();
const FT& uy = u.y();
if (CGAL_NTS abs(ux) > CGAL_NTS abs(uy)) {
return CGAL_NTS sign(ux) == CGAL_NTS sign(v.x());
} else {
return CGAL_NTS sign(uy) == CGAL_NTS sign(v.y());
}
}
template <class K>
inline
bool
same_direction_tag(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K&,
const Homogeneous_tag&)
{
typedef typename K::RT RT;
const RT& uhx = u.hx();
const RT& uhy = u.hy();
if (CGAL_NTS abs(uhx) > CGAL_NTS abs(uhy)) {
return CGAL_NTS sign(uhx) == CGAL_NTS sign(v.hx());
} else {
return CGAL_NTS sign(uhy) == CGAL_NTS sign(v.hy());
}
}
template <class K>
inline
bool
same_direction(const typename K::Vector_2 &u,
const typename K::Vector_2 &v,
const K& k)
{
typedef typename K::Kernel_tag Tag;
Tag tag;
return same_direction_tag(u,v, k, tag);
}
} // namespace internal
} //namespace CGAL
#endif // CGAL_SQUARED_DISTANCE_UTILS_H
|