blob: 7d85f44daf8ed317f93ee57a576a11dd6b7d86ff (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
/*************************************************************************
* Copyright (C) 2010-2012 Tavian Barnes <tavianator@tavianator.com> *
* *
* This file is part of The Dimension Library. *
* *
* The Dimension Library is free software; you can redistribute it and/ *
* or modify it under the terms of the GNU Lesser General Public License *
* as published by the Free Software Foundation; either version 3 of the *
* License, or (at your option) any later version. *
* *
* The Dimension Library is distributed in the hope that it will be *
* useful, but WITHOUT ANY WARRANTY; without even the implied warranty *
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *
* Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU Lesser General Public *
* License along with this program. If not, see *
* <http://www.gnu.org/licenses/>. *
*************************************************************************/
/**
* @file.
* Priority R-trees. PR-trees are a data structure introduced by Arge, de Berg,
* Haverkort, and Yi, which provides asymptotically optimal worst-case lookup,
* while remaining efficient with real-world data. Their structure is derived
* from B-trees.
*/
#ifndef DMNSN_INTERNAL_PRTREE_H
#define DMNSN_INTERNAL_PRTREE_H
#include "internal.h"
#include "internal/bvh.h"
/// Create a PR-tree.
DMNSN_INTERNAL dmnsn_bvh_node *dmnsn_new_prtree(const dmnsn_array *objects);
#endif // DMNSN_INTERNAL_PRTREE_H
|
