mirror of
https://github.com/nzp-team/vhlt.git
synced 2024-11-22 11:51:13 +00:00
155 lines
3.8 KiB
C++
155 lines
3.8 KiB
C++
// Copyright (C) 2000 Sean Cavanaugh
|
|
// This file is licensed under the terms of the Lesser GNU Public License
|
|
// (see LPGL.txt, or http://www.gnu.org/copyleft/lesser.txt)
|
|
|
|
#include "vis.h"
|
|
|
|
|
|
void Zones::set(UINT32 zone, const BoundingBox& bounds)
|
|
{
|
|
if (zone < m_ZoneCount)
|
|
{
|
|
m_ZoneBounds[zone] = bounds;
|
|
}
|
|
}
|
|
|
|
UINT32 Zones::getZoneFromBounds(const BoundingBox& bounds)
|
|
{
|
|
UINT32 x;
|
|
for (x=0; x<m_ZoneCount; x++)
|
|
{
|
|
if (m_ZoneBounds[x].testSuperset(bounds))
|
|
{
|
|
return x;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
UINT32 Zones::getZoneFromWinding(const Winding& winding)
|
|
{
|
|
UINT32 x;
|
|
BoundingBox bounds;
|
|
|
|
for (x=0; x<winding.m_NumPoints; x++)
|
|
{
|
|
bounds.add(winding.m_Points[x]);
|
|
}
|
|
|
|
return getZoneFromBounds(bounds);
|
|
}
|
|
|
|
// BORROWED FROM HLRAD
|
|
// TODO: Consolite into common sometime
|
|
static Winding* WindingFromFace(const dface_t* f)
|
|
{
|
|
int i;
|
|
int se;
|
|
dvertex_t* dv;
|
|
int v;
|
|
Winding* w = new Winding(f->numedges);
|
|
|
|
for (i = 0; i < f->numedges; i++)
|
|
{
|
|
se = g_dsurfedges[f->firstedge + i];
|
|
if (se < 0)
|
|
{
|
|
v = g_dedges[-se].v[1];
|
|
}
|
|
else
|
|
{
|
|
v = g_dedges[se].v[0];
|
|
}
|
|
|
|
dv = &g_dvertexes[v];
|
|
VectorCopy(dv->point, w->m_Points[i]);
|
|
}
|
|
|
|
return w;
|
|
}
|
|
|
|
Zones* MakeZones(void)
|
|
{
|
|
UINT32 x;
|
|
UINT32 func_vis_count = 0;
|
|
|
|
ParseEntities();
|
|
|
|
// Note: we arent looping through entities because we only care if it has a winding/bounding box
|
|
|
|
// First count the number of func_vis's
|
|
for (x=0; x<g_nummodels; x++)
|
|
{
|
|
entity_t* ent = EntityForModel(x);
|
|
|
|
if (!strcasecmp(ValueForKey(ent, "classname"), "func_vis"))
|
|
{
|
|
UINT32 value = atoi(ValueForKey(ent, "node"));
|
|
if (value)
|
|
{
|
|
func_vis_count++;
|
|
}
|
|
else
|
|
{
|
|
Error("func_vis with no \"node\" id\n");
|
|
}
|
|
}
|
|
}
|
|
|
|
if (!func_vis_count)
|
|
{
|
|
return NULL;
|
|
}
|
|
|
|
Zones* zones = new Zones(func_vis_count);
|
|
|
|
for (x=0; x<g_nummodels; x++)
|
|
{
|
|
dmodel_t* mod = g_dmodels + x;
|
|
entity_t* ent = EntityForModel(x);
|
|
|
|
if (!strcasecmp(ValueForKey(ent, "classname"), "func_vis"))
|
|
{
|
|
UINT32 func_vis_id = atoi(ValueForKey(ent, "node"));
|
|
|
|
{
|
|
epair_t* keyvalue;
|
|
|
|
for (keyvalue = ent->epairs; keyvalue; keyvalue = keyvalue->next)
|
|
{
|
|
UINT32 other_id = atoi(keyvalue->key);
|
|
if (other_id)
|
|
{
|
|
zones->flag(func_vis_id, other_id);
|
|
}
|
|
}
|
|
}
|
|
|
|
{
|
|
UINT32 j;
|
|
BoundingBox bounds;
|
|
dface_t* f = g_dfaces + mod->firstface;
|
|
|
|
for (j = 0; j < mod->numfaces; j++, f++)
|
|
{
|
|
Winding* w = WindingFromFace(f);
|
|
UINT32 k;
|
|
|
|
for (k = 0; k < w->m_NumPoints; k++)
|
|
{
|
|
bounds.add(w->m_Points[k]);
|
|
}
|
|
delete w;
|
|
}
|
|
|
|
zones->set(func_vis_id, bounds);
|
|
|
|
Log("Adding zone %u : mins(%4.3f %4.3f %4.3f) maxs(%4.3f %4.3f %4.3f)\n", func_vis_id,
|
|
bounds.m_Mins[0],bounds.m_Mins[1],bounds.m_Mins[2],
|
|
bounds.m_Maxs[0],bounds.m_Maxs[1],bounds.m_Maxs[2]);
|
|
}
|
|
}
|
|
}
|
|
|
|
return zones;
|
|
}
|