[baac79] | 1 | /*
|
---|
| 2 | * Project: MoleCuilder
|
---|
| 3 | * Description: creates and alters molecular systems
|
---|
| 4 | * Copyright (C) 2012 University of Bonn. All rights reserved.
|
---|
| 5 | * Please see the LICENSE file or "Copyright notice" in builder.cpp for details.
|
---|
| 6 | */
|
---|
| 7 |
|
---|
| 8 | /*
|
---|
| 9 | * IsVoidNode_FillPredicate.cpp
|
---|
| 10 | *
|
---|
| 11 | * Created on: Jan 16, 2012
|
---|
| 12 | * Author: heber
|
---|
| 13 | */
|
---|
| 14 |
|
---|
| 15 | // include config.h
|
---|
| 16 | #ifdef HAVE_CONFIG_H
|
---|
| 17 | #include <config.h>
|
---|
| 18 | #endif
|
---|
| 19 |
|
---|
| 20 | #include "CodePatterns/MemDebug.hpp"
|
---|
| 21 |
|
---|
| 22 | #include <boost/bind.hpp>
|
---|
| 23 |
|
---|
| 24 | #include "IsVoidNode_FillPredicate.hpp"
|
---|
| 25 |
|
---|
| 26 | #include "CodePatterns/Log.hpp"
|
---|
| 27 |
|
---|
| 28 | #include "Atom/TesselPoint.hpp"
|
---|
| 29 | #include "LinkedCell/LinkedCell_View.hpp"
|
---|
| 30 | #include "Shapes/ShapeOps.hpp"
|
---|
| 31 | #include "Tesselation/tesselation.hpp"
|
---|
| 32 | #include "World.hpp"
|
---|
| 33 |
|
---|
| 34 | #include "AnyFillPredicate.hpp"
|
---|
| 35 | #include "FillPredicate.hpp"
|
---|
| 36 |
|
---|
| 37 | /** Checks whether a given node \a n in the domain is empty with respect to the
|
---|
| 38 | * given \a shape.
|
---|
| 39 | *
|
---|
| 40 | * @param LC View of a linked cell structure for finding neighbors quickly
|
---|
| 41 | * @param shape shape as a sort of placeholder
|
---|
| 42 | * @param n point where to center the placeholder
|
---|
| 43 | * @return true - placeholder at node contains no points,
|
---|
| 44 | * false - there is at least one point contained
|
---|
| 45 | */
|
---|
| 46 | bool IsVoidNode(const LinkedCell::LinkedCell_View &LC, const Shape &shape, const Node &n)
|
---|
| 47 | {
|
---|
| 48 | LOG(1, "INFO: Node is " << n << ".");
|
---|
| 49 | LOG(1, "INFO: Original shape is at " << shape.getCenter() << " with radius of "
|
---|
| 50 | << shape.getRadius() << ".");
|
---|
| 51 | const Shape shapeAtn = translate(shape, n);
|
---|
| 52 | LOG(1, "INFO: Translated shape is at " << shapeAtn.getCenter() << ".");
|
---|
| 53 | LinkedCell::LinkedList neighborlist = LC.getAllNeighbors(
|
---|
| 54 | shapeAtn.getRadius(), shapeAtn.getCenter());
|
---|
| 55 | LOG(1, "INFO: we have " << neighborlist.size() << " possible neighbors.");
|
---|
| 56 | LinkedCell::LinkedList::const_iterator neighboriter =
|
---|
| 57 | std::find_if(neighborlist.begin(), neighborlist.end(),
|
---|
| 58 | boost::bind(&Shape::isInside, shapeAtn,
|
---|
| 59 | boost::bind(&TesselPoint::getPosition, _1) ));
|
---|
| 60 | return neighboriter == neighborlist.end();
|
---|
| 61 | }
|
---|
| 62 |
|
---|
| 63 | FillPredicate IsVoidNode_FillPredicate(const Shape &_shape)
|
---|
| 64 | {
|
---|
| 65 | // copy _shape !
|
---|
| 66 | const LinkedCell::LinkedCell_View LC = World::getInstance().getLinkedCell(_shape.getRadius());
|
---|
| 67 | AnyFillPredicate::FillPredicator function = boost::bind(&IsVoidNode, LC, _shape, _1);
|
---|
| 68 | LOG(1, "INFO: Create IsVoidNode_FillPredicate from shape at "
|
---|
| 69 | << _shape.getCenter() << " and radius " << _shape.getRadius() << ".");
|
---|
| 70 | FillPredicate::impl_ptr impl(new AnyFillPredicate(function));
|
---|
| 71 | return FillPredicate(impl);
|
---|
| 72 | }
|
---|