source: molecuilder/src/linkedcell.hpp@ 4dca8e

Last change on this file since 4dca8e was 834ff3, checked in by Frederik Heber <heber@…>, 16 years ago

Huge refactoring of Tesselation routines, but not finished yet.

  • new file tesselation.cpp with all of classes tesselation, Boundary..Set and CandidatesForTesselationOB
  • new file tesselationhelper.cpp with all auxiliary functions.
  • boundary.cpp just contains super functions, combininb molecule and Tesselation pointers
  • new pointer molecule::TesselStruct
  • PointMap, LineMap, TriangleMap DistanceMap have been moved from molecules.hpp to tesselation.hpp
  • new abstract class PointCloud and TesselPoint
  • atom inherits TesselPoint
  • molecule inherits PointCloud (i.e. a set of TesselPoints) and implements all virtual functions for the chained list
  • TriangleFilesWritten is thrown out, intermediate steps are written in find_nonconvex_border and not in find_next_triangle()
  • LinkedCell class uses TesselPoint as its nodes, i.e. as long as any class inherits TesselPoint, it may make use of LinkedCell as well and a PointCloud is used to initialize
  • class atom and bond definitions have been moved to own header files

NOTE: This is not bugfree yet. Tesselation of heptan produces way too many triangles, but runs without faults or leaks.

  • Property mode set to 100644
File size: 1.4 KB
Line 
1/*
2 * linkedcell.hpp
3 *
4 * If the linked cell should be usable, the class has to inherit LCNodeSet and the nodes (containing the Vectors) have to inherit LCNode. This works well
5 * for molecule and atom classes.
6 *
7 * Created on: Aug 3, 2009
8 * Author: heber
9 */
10
11#ifndef LINKEDCELL_HPP_
12#define LINKEDCELL_HPP_
13
14using namespace std;
15
16// include config.h
17#ifdef HAVE_CONFIG_H
18#include <config.h>
19#endif
20
21#include <list>
22
23#include "defs.hpp"
24#include "helpers.hpp"
25#include "vector.hpp"
26
27class TesselPoint;
28class PointCloud;
29
30#define LinkedNodes list<TesselPoint *>
31
32/** Linked Cell class for containing Vectors in real space efficiently.
33 */
34class LinkedCell {
35 public:
36 Vector max; // upper boundary
37 Vector min; // lower boundary
38 LinkedNodes *LC; // linked cell list
39 double RADIUS; // cell edge length
40 int N[NDIM]; // number of cells per axis
41 int n[NDIM]; // temporary variable for current cell per axis
42 int index; // temporary index variable , access by index = n[0] * N[1] * N[2] + n[1] * N[2] + n[2];
43
44 LinkedCell();
45 LinkedCell(PointCloud *set, double RADIUS);
46 ~LinkedCell();
47 LinkedNodes* GetCurrentCell();
48 bool SetIndexToNode(TesselPoint *Walker);
49 bool SetIndexToVector(Vector *x);
50 bool CheckBounds();
51
52 // not implemented yet
53 bool AddNode(Vector *Walker);
54 bool DeleteNode(Vector *Walker);
55 bool MoveNode(Vector *Walker);
56};
57
58#endif /*LINKEDCELL_HPP_*/
Note: See TracBrowser for help on using the repository browser.