zpl-cull

KO | EN

gitlite — search

#javascript #hacktoberfest #typescript #llm #android #machine-learning #deep-learning #docker #nodejs #java #awesome #cli #mcp #open-source

(★ 10)

ZPL - Tree culler module

zpl-cull 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# MIGRATED TO [zpl](https://github.com/zpl-c/zpl)
# ZPL - Tree culler module
[![npm version](https://badge.fury.io/js/zpl_cull.c.svg)](https://badge.fury.io/js/zpl_cull.c)

Fast 2D/3D spatial tree culler. This module takes care of placing tree nodes into the culling zone and splitting branch into subtrees accordingly (based on simple set of conditions).
User can easily query for any list of nodes in a tree and easily retrieve a list of visible nodes user can operate on.

## Usage

```c
#define ZPL_IMPLEMENTATION
#include "zpl.h"

#define ZPLM_IMPLEMENTATION
#include "zpl_math.h"

#define ZPLC_IMPLEMENTATION
#include "zpl_cull.h"

int
main(void) {
    zplc_bounds_t b = {0};

b.centre = zplm_vec3(0, 0, 0);
    b.half_size = zplm_vec3(100, 100, 100);

zplc_t root = {0};
    zplc_init(&root, zpl_heap_allocator(), zplc_dim_2d_ev, b, 32);

zplc_node_t e1 = {0};
    e1.position.x = 20;
    zplc_insert(&root, e1);

zplc_node_t e2 = {0};
    e2.position.x = 30;
    zplc_insert(&root, e2);

zplc_node_t e3 = {0};
    e3.position.x = 35;
    zplc_insert(&root, e3);

zplc_node_t e4 = {0};
    e4.position.x = 12;
    zplc_insert(&root, e4);

zplc_bounds_t search_bounds = {
        .centre = {0,0,0},
        .half_size = {20,20,20},
    };

zpl_array_t(zplc_node_t) search_result;
    zpl_array_init(search_result, zpl_heap_allocator());

zplc_query(&root, search_bounds, &search_result);

isize result = zpl_array_count(search_result);
    ZPL_ASSERT(result == 2);

zplc_free(&root);

for (isize i = 0; i < 666; ++i) {
        zplc_node_t e = {0};
        e.position.x = 0.0001f*i;
        zplc_insert(&root, e);
    }

zpl_array_t(zplc_node_t) search_result2;
    zpl_array_init(search_result2, zpl_heap_allocator());

zplc_query(&root, search_bounds, &search_result2);
    isize c = zpl_array_count(search_result2);
    ZPL_ASSERT(zpl_array_count(search_result2) == 666);

return 0;
}
```

zpl-cull

zpl-cull 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

zpl-cull

zpl-cull 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README