viktorljung
94 lines
2.6 KiB
C++
94 lines
2.6 KiB
C++
/*
|
|
* Copyright (c) 2013 Google, Inc.
|
|
*
|
|
* 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 B2_VORONOI_DIAGRAM
|
|
#define B2_VORONOI_DIAGRAM
|
|
|
|
#include <Box2D/Common/b2Math.h>
|
|
|
|
class b2StackAllocator;
|
|
struct b2AABB;
|
|
|
|
/// A field representing the nearest generator from each point.
|
|
class b2VoronoiDiagram
|
|
{
|
|
|
|
public:
|
|
|
|
b2VoronoiDiagram(b2StackAllocator* allocator, int32 generatorCapacity);
|
|
~b2VoronoiDiagram();
|
|
|
|
/// Add a generator.
|
|
/// @param the position of the generator.
|
|
/// @param a tag used to identify the generator in callback functions.
|
|
/// @param whether to callback for nodes associated with the generator.
|
|
void AddGenerator(const b2Vec2& center, int32 tag, bool necessary);
|
|
|
|
/// Generate the Voronoi diagram. It is rasterized with a given interval
|
|
/// in the same range as the necessary generators exist.
|
|
/// @param the interval of the diagram.
|
|
/// @param margin for which the range of the diagram is extended.
|
|
void Generate(float32 radius, float32 margin);
|
|
|
|
/// Callback used by GetNodes().
|
|
class NodeCallback
|
|
{
|
|
public:
|
|
virtual ~NodeCallback() {}
|
|
/// Receive tags for generators associated with a node.
|
|
virtual void operator()(int32 a, int32 b, int32 c) = 0;
|
|
};
|
|
|
|
/// Enumerate all nodes that contain at least one necessary generator.
|
|
/// @param a callback function object called for each node.
|
|
void GetNodes(NodeCallback& callback) const;
|
|
|
|
private:
|
|
|
|
struct Generator
|
|
{
|
|
b2Vec2 center;
|
|
int32 tag;
|
|
bool necessary;
|
|
};
|
|
|
|
struct b2VoronoiDiagramTask
|
|
{
|
|
int32 m_x, m_y, m_i;
|
|
Generator* m_generator;
|
|
|
|
b2VoronoiDiagramTask() {}
|
|
b2VoronoiDiagramTask(int32 x, int32 y, int32 i, Generator* g)
|
|
{
|
|
m_x = x;
|
|
m_y = y;
|
|
m_i = i;
|
|
m_generator = g;
|
|
}
|
|
};
|
|
|
|
b2StackAllocator *m_allocator;
|
|
Generator* m_generatorBuffer;
|
|
int32 m_generatorCapacity;
|
|
int32 m_generatorCount;
|
|
int32 m_countX, m_countY;
|
|
Generator** m_diagram;
|
|
|
|
};
|
|
|
|
#endif
|