File size: 14,549 Bytes
5a600cf | 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 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2026 OpenFOAM Foundation
\\/ M anipulation |
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
Class
Foam::boundSphere
Description
The smallest sphere enclosing a given set of points
SourceFiles
boundSphereI.H
boundSphereTemplates.C
\*---------------------------------------------------------------------------*/
#ifndef boundSphere_H
#define boundSphere_H
#include "point.H"
#include "nil.H"
#include "randomGenerator.H"
#include "RemoteData.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace Foam
{
// Forward declaration of friend functions and operators
class boundSphere;
bool operator==(const boundSphere&, const boundSphere&);
bool operator!=(const boundSphere&, const boundSphere&);
Istream& operator>>(Istream&, boundSphere&);
Ostream& operator<<(Ostream&, const boundSphere&);
/*---------------------------------------------------------------------------*\
Class boundSphere Declaration
\*---------------------------------------------------------------------------*/
class boundSphere
{
// Private Data
//- The centre
point c_;
//- The radius squared
scalar rSqr_;
// Private Type Definitions
//- For a given List type, return the corresponding UList-type
template<class PointList>
using PointUList =
typename std::conditional
<
std::is_base_of<UList<point>, PointList>::value,
UList<point>,
typename std::conditional
<
std::is_base_of<UIndirectList<point>, PointList>::value,
UIndirectList<point>,
nil
>::type
>::type;
// Private Classes
//- A structure to manage a fixed set of local points and a growing
// list of added remote points and provides indexing into these sets
// as if they were in a single contiguous list. It is used when
// constructing global bound spheres. A global bound sphere is
// calculated by first constructing the local bound sphere and then
// synchronising the limiting set of outermost points. These points
// are then added to the list and the process is repeated until
// no more points are added and all processes arrive at the same
// set of boundary points.
template<class PointList>
class LocalAndRemotePoints
{
const PointList& locals_;
DynamicList<RemoteData<point>> remotes_;
HashTable<label, remote, Hash<remote>> remoteTable_;
public:
inline LocalAndRemotePoints(const PointList& locals)
:
locals_(locals)
{}
inline label nRemotes() const
{
return remotes_.size();
}
inline const point& operator[](const label i) const
{
return
i < locals_.size()
? locals_[i]
: remotes_[i - locals_.size()].data;
}
inline RemoteData<point> operator()(const label i) const
{
return
i < locals_.size()
? RemoteData<point>(Pstream::myProcNo(), i, locals_[i])
: remotes_[i - locals_.size()];
}
inline bool found(const remote& r) const
{
if (r.proci == Pstream::myProcNo()) return true;
return remoteTable_.found(r);
}
inline label insert(const RemoteData<point>& rp)
{
if (rp.proci == Pstream::myProcNo()) return rp.elementi;
if (remoteTable_.found(rp)) return remoteTable_[rp];
return insertNoCheck(rp);
}
inline label insertNoCheck(const RemoteData<point>& rp)
{
remotes_.append(rp);
remoteTable_.insert(rp, remotes_.size() - 1);
return locals_.size() + remotes_.size();
}
};
// Private Constructor
//- Construct from components
inline boundSphere(const point& c, const scalar rSqr);
// Private Static Member Functions
//- Cast a List to the corresponding UList-type
template<class PointList>
static inline PointUList<PointList> pointUList(const PointList&);
//- Sort boundary point indices
static inline void sortBoundaryPis(FixedList<label, 4>&);
//- Sort boundary remote point indices
template<class Remote>
static inline void sortBoundaryPis(FixedList<Remote, 4>&);
//- ...
struct implementation
{
//- Return the sphere intersecting the given set of up to four points
template<class PointList>
static boundSphere intersect
(
const PointList& ps,
const FixedList<label, 4>& pis,
const label nPs
);
//- Return the sphere bounding the given set of up to four points
template<class PointList>
static boundSphere trivial
(
const PointList& ps,
const FixedList<label, 4>& pis,
const label nPs,
FixedList<label, 4>& boundaryPis
);
//- Return the sphere bounding the given set of points using an
// inefficient brute-force method
template<class PointList>
static boundSphere bruteForce
(
const PointList& ps,
FixedList<label, 4>& boundaryPis
);
//- Inner/recursive implementation of Welzl's algorithm
template<class PointList, class DLPermutation>
static boundSphere Welzl
(
const PointList& ps,
DLPermutation& pis,
const typename DLPermutation::const_iterator& pisEnd,
FixedList<label, 4>& boundaryPis,
const label nBoundaryPs
);
//- Return the sphere bounding the given set of points using Welzl's
// algorithm. Constructs the local sphere containing the points on
// this processor only.
template<class PointList>
static boundSphere local
(
const PointList& ps,
randomGenerator& rndGen,
FixedList<label, 4>& boundaryPis
);
//- Return the sphere bounding the given set of points using Welzl's
// algorithm. Constructs the global sphere containing the points on
// all processors.
template<class PointList>
static boundSphere global
(
const PointList& ps,
randomGenerator& rndGen,
FixedList<RemoteData<point>, 4>& boundaryPis,
const bool strict
);
//- ...
};
public:
// Constructors
//- Construct a null/invalid sphere
inline boundSphere();
//- Construct given a point and a radius
static inline boundSphere cr(const point& c, const scalar r);
//- Construct given a point and a radius
static inline boundSphere cr(const Tuple2<point, scalar>& cr);
//- Construct given a point and a radius squared
static inline boundSphere crSqr(const point& c, const scalar rSqr);
//- Construct given a point and a radius squared
static inline boundSphere crSqr(const Tuple2<point, scalar>& crSqr);
// Member Functions
//- Return the centre
inline const point& c() const;
//- Return the radius squared
inline scalar rSqr() const;
//- Return the radius
inline scalar r() const;
//- Return whether this sphere is valid
inline bool valid() const;
//- Return whether this sphere contains a given point
inline bool contains(const point& p) const;
//- Expand the sphere by the given factor
inline void inflate(const scalar s);
// Static Member Functions
//- Return whether two spheres overlap
static inline bool overlap(const boundSphere& a, const boundSphere& b);
//- Return the sphere intersecting the given set of up to four points
template<class PointList>
static inline boundSphere intersect
(
const PointList& ps,
const FixedList<label, 4>& pis,
const label nPs
);
//- Return the sphere bounding the given set of up to four points
template<class PointList>
static inline boundSphere trivial
(
const PointList& ps,
const FixedList<label, 4>& pis,
const label nPs
);
//- Return the sphere bounding the given set of up to four points
template<class PointList>
static inline boundSphere trivial
(
const PointList& ps,
const FixedList<label, 4>& pis,
const label nPs,
FixedList<label, 4>& boundaryPis
);
//- Return the sphere bounding the given set of points using an
// inefficient brute-force method
template<class PointList>
static inline boundSphere bruteForce
(
const PointList& ps
);
//- Return the sphere bounding the given set of points using an
// inefficient brute-force method
template<class PointList>
static inline boundSphere bruteForce
(
const PointList& ps,
FixedList<label, 4>& boundaryPis
);
//- Return the sphere bounding the given set of points using Welzl's
// algorithm. Constructs the local sphere containing the points on
// this processor only.
template<class PointList>
static inline boundSphere local
(
const PointList& ps
);
//- Return the sphere bounding the given set of points using Welzl's
// algorithm. Constructs the local sphere containing the points on
// this processor only.
template<class PointList>
static inline boundSphere local
(
const PointList& ps,
randomGenerator& rndGen
);
//- Return the sphere bounding the given set of points using Welzl's
// algorithm. Constructs the local sphere containing the points on
// this processor only.
template<class PointList>
static inline boundSphere local
(
const PointList& ps,
FixedList<label, 4>& boundaryPis
);
//- Return the sphere bounding the given set of points using Welzl's
// algorithm. Constructs the local sphere containing the points on
// this processor only.
template<class PointList>
static inline boundSphere local
(
const PointList& ps,
randomGenerator& rndGen,
FixedList<label, 4>& boundaryPis
);
//- Return the sphere bounding the given set of points using Welzl's
// algorithm. Constructs the global sphere containing the points on
// all processors.
template<class PointList>
static inline boundSphere global
(
const PointList& ps,
const bool strict = false
);
//- Return the sphere bounding the given set of points using Welzl's
// algorithm. Constructs the global sphere containing the points on
// all processors.
template<class PointList>
static inline boundSphere global
(
const PointList& ps,
randomGenerator& rndGen,
const bool strict = false
);
//- Return the sphere bounding the given set of points using Welzl's
// algorithm. Constructs the global sphere containing the points on
// all processors.
template<class PointList>
static inline boundSphere global
(
const PointList& ps,
FixedList<RemoteData<point>, 4>& boundaryPis,
const bool strict = false
);
//- Return the sphere bounding the given set of points using Welzl's
// algorithm. Constructs the global sphere containing the points on
// all processors.
template<class PointList>
static inline boundSphere global
(
const PointList& ps,
randomGenerator& rndGen,
FixedList<RemoteData<point>, 4>& boundaryPis,
const bool strict = false
);
// Friend Operators
//- Equality comparison
inline friend bool operator==(const boundSphere&, const boundSphere&);
//- Inequality comparison
inline friend bool operator!=(const boundSphere&, const boundSphere&);
// IOstream operators
//- Read from stream
friend Istream& operator>>(Istream&, boundSphere&);
//- Write to stream
friend Ostream& operator<<(Ostream&, const boundSphere&);
};
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
} // End namespace Foam
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#include "boundSphereI.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#endif
// ************************************************************************* //
|