84 lines
2.9 KiB
C++
84 lines
2.9 KiB
C++
|
// Begin License:
|
||
|
// Copyright (C) 2006-2008 Tobias Sargeant (tobias.sargeant@gmail.com).
|
||
|
// All rights reserved.
|
||
|
//
|
||
|
// This file is part of the Carve CSG Library (http://carve-csg.com/)
|
||
|
//
|
||
|
// This file may be used under the terms of the GNU General Public
|
||
|
// License version 2.0 as published by the Free Software Foundation
|
||
|
// and appearing in the file LICENSE.GPL2 included in the packaging of
|
||
|
// this file.
|
||
|
//
|
||
|
// This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
|
||
|
// INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
|
||
|
// A PARTICULAR PURPOSE.
|
||
|
// End:
|
||
|
|
||
|
|
||
|
#pragma once
|
||
|
|
||
|
|
||
|
static inline bool facesAreCoplanar(const carve::poly::Polyhedron::face_t *a, const carve::poly::Polyhedron::face_t *b) {
|
||
|
carve::geom3d::Ray temp;
|
||
|
// XXX: Find a better definition. This may be a source of problems
|
||
|
// if floating point inaccuracies cause an incorrect answer.
|
||
|
return !carve::geom3d::planeIntersection(a->plane_eqn, b->plane_eqn, temp);
|
||
|
}
|
||
|
|
||
|
#if defined(CARVE_DEBUG)
|
||
|
|
||
|
#include <carve/debug_hooks.hpp>
|
||
|
|
||
|
#endif
|
||
|
|
||
|
namespace carve {
|
||
|
namespace csg {
|
||
|
|
||
|
static inline const carve::poly::Polyhedron::vertex_t *map_vertex(const VVMap &vmap, const carve::poly::Polyhedron::vertex_t *v) {
|
||
|
VVMap::const_iterator i = vmap.find(v);
|
||
|
if (i == vmap.end()) return v;
|
||
|
return (*i).second;
|
||
|
}
|
||
|
|
||
|
#if defined(CARVE_DEBUG)
|
||
|
|
||
|
class IntersectDebugHooks;
|
||
|
extern IntersectDebugHooks *g_debug;
|
||
|
|
||
|
#define HOOK(x) do { if (g_debug) { g_debug->x } } while(0)
|
||
|
|
||
|
static inline void drawFaceLoopList(const FaceLoopList &ll,
|
||
|
float rF, float gF, float bF, float aF,
|
||
|
float rB, float gB, float bB, float aB,
|
||
|
bool lit) {
|
||
|
for (FaceLoop *flb = ll.head; flb; flb = flb->next) {
|
||
|
const carve::poly::Polyhedron::face_t *f = (flb->orig_face);
|
||
|
std::vector<const carve::poly::Polyhedron::vertex_t *> &loop = flb->vertices;
|
||
|
HOOK(drawFaceLoop2(loop, f->plane_eqn.N, rF, gF, bF, aF, rB, gB, bB, aB, true, lit););
|
||
|
HOOK(drawFaceLoopWireframe(loop, f->plane_eqn.N, 1, 1, 1, 0.1f););
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static inline void drawFaceLoopListWireframe(const FaceLoopList &ll) {
|
||
|
for (FaceLoop *flb = ll.head; flb; flb = flb->next) {
|
||
|
const carve::poly::Polyhedron::face_t *f = (flb->orig_face);
|
||
|
std::vector<const carve::poly::Polyhedron::vertex_t *> &loop = flb->vertices;
|
||
|
HOOK(drawFaceLoopWireframe(loop, f->plane_eqn.N, 1, 1, 1, 0.1f););
|
||
|
}
|
||
|
}
|
||
|
|
||
|
template<typename T>
|
||
|
static inline void drawEdges(T begin, T end,
|
||
|
float rB, float gB, float bB, float aB,
|
||
|
float rE, float gE, float bE, float aE,
|
||
|
float w) {
|
||
|
for (; begin != end; ++begin) {
|
||
|
HOOK(drawEdge((*begin).first, (*begin).second, rB, gB, bB, aB, rE, gE, bE, aE, w););
|
||
|
}
|
||
|
}
|
||
|
|
||
|
#endif
|
||
|
|
||
|
}
|
||
|
}
|