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 | * ApproximateShapeArea.cpp
|
---|
10 | *
|
---|
11 | * Created on: Jan 30, 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 <cmath>
|
---|
23 | #include <set>
|
---|
24 | #include <vector>
|
---|
25 |
|
---|
26 | #include "Atom/TesselPoint.hpp"
|
---|
27 | #include "LinkedCell/PointCloudAdaptor.hpp"
|
---|
28 | #include "ApproximateShapeArea.hpp"
|
---|
29 | #include "Tesselation/tesselation.hpp"
|
---|
30 |
|
---|
31 | /** Constructor of class ApproximateShapeArea.
|
---|
32 | *
|
---|
33 | * @param _shape shape to calculate the surface area approximately
|
---|
34 | */
|
---|
35 | ApproximateShapeArea::ApproximateShapeArea(const Shape &_shape) :
|
---|
36 | shape(_shape)
|
---|
37 | {}
|
---|
38 |
|
---|
39 | /** Destructor of class ApproximateShapeArea.
|
---|
40 | *
|
---|
41 | */
|
---|
42 | ApproximateShapeArea::~ApproximateShapeArea()
|
---|
43 | {}
|
---|
44 |
|
---|
45 | /** Calculate the approximate surface area of the given \a shape.
|
---|
46 | *
|
---|
47 | * @return surface area approximated
|
---|
48 | */
|
---|
49 | double ApproximateShapeArea::operator()() const
|
---|
50 | {
|
---|
51 | const double distance = 2.;
|
---|
52 | const double min_area = distance*distance*distance;
|
---|
53 | const double radius = shape.getRadius();
|
---|
54 | const double surfacearea_upperbound = 4.*M_PI * radius*radius;
|
---|
55 | const size_t N = (int)(surfacearea_upperbound/min_area);
|
---|
56 | // get surface points
|
---|
57 | std::vector<Vector> SurfacePoints =
|
---|
58 | shape.getHomogeneousPointsOnSurface(N);
|
---|
59 | typedef std::set<TesselPoint *> NodeSet;
|
---|
60 | NodeSet SurfaceNodes;
|
---|
61 | for (size_t i=0;i<SurfacePoints.size();++i) {
|
---|
62 | TesselPoint * Walker = new TesselPoint();
|
---|
63 | Walker->setName(std::string("SurfaceNode")+toString(i));
|
---|
64 | Walker->setPosition(SurfacePoints[i]);
|
---|
65 | SurfaceNodes.insert(Walker);
|
---|
66 | }
|
---|
67 |
|
---|
68 | // tesselate
|
---|
69 | PointCloudAdaptor<NodeSet> cloud(&SurfaceNodes, "TesselPointSTLList");
|
---|
70 | Tesselation *tesselator = new Tesselation;
|
---|
71 | (*tesselator)(cloud, distance);
|
---|
72 |
|
---|
73 | // obtain surface area (assume angstroem)
|
---|
74 | const double surfacearea = tesselator->getAreaOfEnvelope(true);
|
---|
75 |
|
---|
76 | // clear up
|
---|
77 | delete tesselator;
|
---|
78 | for (NodeSet::iterator iter = SurfaceNodes.begin();
|
---|
79 | !SurfaceNodes.empty(); iter = SurfaceNodes.begin()) {
|
---|
80 | delete *iter;
|
---|
81 | SurfaceNodes.erase(iter);
|
---|
82 | }
|
---|
83 |
|
---|
84 | return surfacearea;
|
---|
85 | }
|
---|
86 |
|
---|