partitioning.h 4.2 KB
Newer Older
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
39
40
41
42
43
44
45
46
47
48
/* The copyright in this software is being made available under the BSD
 * Licence, included below.  This software may be subject to other third
 * party and contributor rights, including patent rights, and no such
 * rights are granted under this licence.
 *
 * Copyright (c) 2017-2018, ISO/IEC
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * * Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 *
 * * Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 *
 * * Neither the name of the ISO/IEC nor the names of its contributors
 *   may be used to endorse or promote products derived from this
 *   software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#pragma once

#include <cstdint>
#include <vector>

#include "PCCMath.h"
#include "PCCPointSet.h"
#include "hls.h"

namespace pcc {

//============================================================================

49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
enum class PartitionMethod
{
  // Don't partition input
  kNone = 0,

  // Partition according to uniform geometry
  kUniformGeom = 2,

  // Partition according to the depth of octree
  kOctreeUniform = 3,
};

//============================================================================

struct PartitionParams {
  // Method for partitioning a point cloud
  PartitionMethod method;

  // Depth of octree used in partitioning
  int octreeDepth;

  // Maximum number of points per slice
  int sliceMaxPoints;

  // Minimum number of points per slice
  int sliceMinPoints;

  // Baseline tile width. (0 => disabled)
  int tileSize;
};

//============================================================================

82
83
84
85
86
87
88
89
90
91
92
struct Partition {
  // The *_slice_id to encode this partition with
  int sliceId;

  // The identifier of the tileset that describes the bounding box of all
  // slices with the same tile_id.  A value of -1 indicates no tile_id
  // mapping.
  int tileId;

  // The value of geom_box_origin for this partition, using the
  // translated+scaled co-ordinate system.
93
  Vec3<int> origin;
94
95
96
97
98
99
100
101
102
103
104
105
106
107

  // Point indexes of the source point cloud that form this partition.
  std::vector<int32_t> pointIndexes;
};

//----------------------------------------------------------------------------

struct PartitionSet {
  TileInventory tileInventory;
  std::vector<Partition> slices;
};

//============================================================================

108
std::vector<Partition> partitionByUniformGeom(
109
110
111
112
  const PartitionParams& params,
  const PCCPointSet3& cloud,
  int tileID,
  int paritionBoundaryLog2);
113
114
115
116
117
118
119
120

std::vector<Partition> partitionByOctreeDepth(
  const PartitionParams& params,
  const PCCPointSet3& cloud,
  int tileID,
  bool splitByDepth = false);

//============================================================================
121

122
123
std::vector<std::vector<int32_t>>
tilePartition(const PartitionParams& params, const PCCPointSet3& cloud);
124

125
126
//============================================================================

127
128
129
130
131
132
133
void refineSlices(
  const PartitionParams& params,
  const PCCPointSet3& inputPointCloud,
  std::vector<Partition>& slices);

//============================================================================

134
}  // namespace pcc