如何保存类的实例列表？

发布于 2024-09-08 21:52:15 字数 135 浏览 2 评论 0原文

我正在用 C++ 编写光线跟踪器，需要能够检查场景中每个对象的交集（稍后会进行优化），为此，我需要保留类实例的运行列表。创建新实例时更新的指针列表将不起作用，因为据我所知，在初始化后无法增加数组的大小。如果有的话，我真的很想要一个内置的（C++）解决方案。

原文

分享到QQ

分享到微博

如果你对这篇内容有疑问，欢迎到本站社区发帖提问参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。

发布评论

需要登录才能够评论，你可以免费注册一个本站的账号。

落花浅忆 2024-09-15 21:52:15

您可以使用任意数量的 STL 容器。

STL 容器参考

回复收藏 0 原文

太阳哥哥 2024-09-15 21:52:15

创建一个指向场景中对象的指针的向量（或集）作为静态类成员，并让所有的构造函数将this插入到集合，dtor 从集合中删除 this：

// really pseudo-code -- not intended to compile as-is, but I hope it helps
// convey the general idea.
//
class scene_object { 
    static std::set<scene_object const *> instances;
public:

    scene_object() : { instances.insert(this); }
    scene_object(scene_object const &other) { instances.insert(this); }
    // probably more ctors here...

    ~scene_object() { instances.delete(this); }
};

std::set<scene_object> scene_object::instances;

Create a vector (or set) of pointers to the objects in your scene as a static class member, and have all your ctors insert this into the collection, and the dtor delete this from the collection:

// really pseudo-code -- not intended to compile as-is, but I hope it helps
// convey the general idea.
//
class scene_object { 
    static std::set<scene_object const *> instances;
public:

    scene_object() : { instances.insert(this); }
    scene_object(scene_object const &other) { instances.insert(this); }
    // probably more ctors here...

    ~scene_object() { instances.delete(this); }
};

std::set<scene_object> scene_object::instances;

回复收藏 0 原文

酷遇一生 2024-09-15 21:52:15

我正在用 C++ 编写光线追踪器，需要能够检查场景中每个对象的相交 [...]

标准方法是空间图。最常见的是使用八叉树，因为它们可以表达 3 维空间中的位置。简而言之，空间树看起来像这样：

struct SpatialNode {
    SpatialNode * children[8];
    std::vector<object*> objects;
};

每个节点都有一个（隐式或显式）位置和大小。当一个新对象被添加到世界场景中时，树会遍历子对象（它们占据由 xy、yz 和 zx 平面分割的八分圆：上面 4 个，下面 4 个；左边 4 个，右边 4 个；后面 4 个），前面的4）并且该对象仅添加到可以完全包含它的最小节点。（显然，您需要能够计算对象的尺寸以及它们是否可以完全包含在给定区域内。）

这样做的好处是相当快（实际上只有被检查的树的部分）相关），无论是在填充它还是在搜索它。您可以在 Wikipedia、GameDev.net 和其他地方阅读有关它的多篇文章。

I'm writing a raytracer in C++ and need to be able to check intersections with every object in a scene [...]

The standard approach is a spatial graph. Most commonly, octrees are used, since they can express location in 3-dimensional space. Trivially, the spatial tree would look something like this:

struct SpatialNode {
    SpatialNode * children[8];
    std::vector<object*> objects;
};

Each node has an (implicit or explicit) position and size. When a new object is added to the world scene, the tree is walked through the children (which occupy the octants that are split by the x-y, y-z, and z-x planes: 4 above, 4 below; 4 left, 4 right; 4 behind, 4 in front) and the object is added only to the smallest node that can fully contain it. (Obviously, you'll need to be able to calculate the dimensions of your object and whether they can be fully contained within a given region.)

This has the benefit of being fairly fast (only the portions of the tree that are examined are actually relevant), both in populating it and in searching it. There are several articles on it that you can read at Wikipedia, GameDev.net, and elsewhere.

回复收藏 0 原文