File: dgConvexHull3d.h

package info (click to toggle)
scummvm 2.9.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 450,580 kB
  • sloc: cpp: 4,299,825; asm: 28,322; python: 12,901; sh: 11,302; java: 9,289; xml: 7,895; perl: 2,639; ansic: 2,465; yacc: 1,670; javascript: 1,020; makefile: 933; lex: 578; awk: 275; objc: 82; sed: 11; php: 1
file content (112 lines) | stat: -rw-r--r-- 4,339 bytes parent folder | download | duplicates (3)
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
/* Copyright (c) <2003-2011> <Julio Jerez, Newton Game Dynamics>
*
* This software is provided 'as-is', without any express or implied
* warranty. In no event will the authors be held liable for any damages
* arising from the use of this software.
*
* Permission is granted to anyone to use this software for any purpose,
* including commercial applications, and to alter it and redistribute it
* freely, subject to the following restrictions:
*
* 1. The origin of this software must not be misrepresented; you must not
* claim that you wrote the original software. If you use this software
* in a product, an acknowledgment in the product documentation would be
* appreciated but is not required.
*
* 2. Altered source versions must be plainly marked as such, and must not be
* misrepresented as being the original software.
*
* 3. This notice may not be removed or altered from any source distribution.
*/

#ifndef __DG_CONVEXHULL_3D__
#define __DG_CONVEXHULL_3D__

#include "dgStdafx.h"
#include "dgList.h"
#include "dgArray.h"
#include "dgPlane.h"
#include "dgVector.h"
#include "dgMatrix.h"
#include "dgQuaternion.h"

class dgMemoryAllocator;
class dgAABBPointTree3d;

class dgConvexHull3DFace {
public:
	dgConvexHull3DFace();
	dgInt32 m_index[3];

private:
	dgFloat64 Evalue(const dgBigVector *const pointArray, const dgBigVector &point) const;
	dgBigPlane GetPlaneEquation(const dgBigVector *const pointArray) const;

	mutable dgInt32 m_mark;
	dgList<dgConvexHull3DFace>::dgListNode *m_twin[3];
	friend class dgConvexHull3d;
};

class dgHullVertex;

class dgConvexHull3d: public dgList<dgConvexHull3DFace> {
public:
	dgConvexHull3d(dgMemoryAllocator *const allocator, const dgFloat64 *const vertexCloud, dgInt32 strideInBytes, dgInt32 count, dgFloat64 distTol, dgInt32 maxVertexCount = 0x7fffffff);
	virtual ~dgConvexHull3d();

	dgInt32 GetVertexCount() const;
	const dgBigVector *GetVertexPool() const;
	const dgBigVector &GetVertex(dgInt32 i) const;

	dgFloat64 GetDiagonal() const;
	dgFloat64 RayCastBruteForce(const dgBigVector &localP0, const dgBigVector &localP1) const;
	dgFloat64 RayCast(const dgBigVector &localP0, const dgBigVector &localP1, const dgConvexHull3DFace **firstFaceGuess = NULL) const;

	void CalculateVolumeAndSurfaceArea(dgFloat64 &volume, dgFloat64 &surcafeArea) const;

protected:

	dgConvexHull3d(dgMemoryAllocator *const allocator);
	void BuildHull(const dgFloat64 *const vertexCloud, dgInt32 strideInBytes, dgInt32 count, dgFloat64 distTol, dgInt32 maxVertexCount);

	dgFloat64 FaceRayCast(const dgConvexHull3DFace *const face, const dgBigVector &origin, const dgBigVector &dist, dgFloat64 &normalProjection) const;


	virtual dgListNode *AddFace(dgInt32 i0, dgInt32 i1, dgInt32 i2);
	virtual void DeleteFace(dgListNode *const node) ;
	virtual dgInt32 InitVertexArray(dgHullVertex *const points, const dgFloat64 *const vertexCloud, dgInt32 strideInBytes, dgInt32 count, void *memoryPool, dgInt32 maxMemSize);

	void CalculateConvexHull(dgAABBPointTree3d *vertexTree, dgHullVertex *const points, dgInt32 count, dgFloat64 distTol, dgInt32 maxVertexCount);
	dgInt32 BuildNormalList(dgBigVector *const normalArray) const;
	dgInt32 SupportVertex(dgAABBPointTree3d **const tree, const dgHullVertex *const points, const dgBigVector &dir) const;
	dgFloat64 TetrahedrumVolume(const dgBigVector &p0, const dgBigVector &p1, const dgBigVector &p2, const dgBigVector &p3) const;
	void TessellateTriangle(dgInt32 level, const dgVector &p0, const dgVector &p1, const dgVector &p2, dgInt32 &count, dgBigVector *const ouput, dgInt32 &start) const;

	dgAABBPointTree3d *BuildTree(dgAABBPointTree3d *const parent, dgHullVertex *const points, dgInt32 count, dgInt32 baseIndex, dgInt8 **const memoryPool, dgInt32 &maxMemSize) const;
	static dgInt32 ConvexCompareVertex(const dgHullVertex *const  A, const dgHullVertex *const B, void *const context);
	bool Sanity() const;

	mutable dgInt32 m_mark;
	dgInt32 m_count;
	dgFloat64 m_diag;
	dgArray<dgBigVector> m_points;
};


inline dgInt32 dgConvexHull3d::GetVertexCount() const {
	return m_count;
}

inline const dgBigVector *dgConvexHull3d::GetVertexPool() const {
	return &m_points[0];
}

inline const dgBigVector &dgConvexHull3d::GetVertex(dgInt32 index) const {
	return m_points[index];
}

inline dgFloat64 dgConvexHull3d::GetDiagonal() const {
	return m_diag;
}

#endif