MRSL DecompUtil Library
0.1
An implementaion of convex decomposition over point cloud
Main Page
Classes
Files
Class List
Class Index
Class Hierarchy
Class Members
All
Functions
Variables
a
c
d
e
f
g
h
i
l
p
s
v
- a -
add() :
Polyhedron< Dim >
add_local_bbox() :
LineSegment< Dim >
,
SeedDecomp< Dim >
- c -
C() :
Ellipsoid< Dim >
cal_closest_dist() :
IterativeDecomp< Dim >
cal_normals() :
Polyhedron< Dim >
closest_hyperplane() :
Ellipsoid< Dim >
closest_point() :
Ellipsoid< Dim >
- d -
d() :
Ellipsoid< Dim >
DecompBase() :
DecompBase< Dim >
dilate() :
DecompBase< Dim >
,
EllipsoidDecomp< Dim >
,
LineSegment< Dim >
,
SeedDecomp< Dim >
dilate_iter() :
IterativeDecomp< Dim >
dist() :
Ellipsoid< Dim >
,
Hyperplane< Dim >
downsample() :
IterativeDecomp< Dim >
- e -
EllipsoidDecomp() :
EllipsoidDecomp< Dim >
- f -
find_ellipsoid() :
LineSegment< Dim >
- g -
get_constraints() :
EllipsoidDecomp< Dim >
get_ellipsoid() :
DecompBase< Dim >
get_ellipsoids() :
EllipsoidDecomp< Dim >
get_line_segment() :
LineSegment< Dim >
get_obs() :
DecompBase< Dim >
get_path() :
EllipsoidDecomp< Dim >
get_polyhedron() :
DecompBase< Dim >
get_polyhedrons() :
EllipsoidDecomp< Dim >
get_seed() :
SeedDecomp< Dim >
- h -
hyperplanes() :
Polyhedron< Dim >
- i -
inside() :
Ellipsoid< Dim >
,
LinearConstraint< Dim >
,
Polyhedron< Dim >
IterativeDecomp() :
IterativeDecomp< Dim >
- l -
LinearConstraint() :
LinearConstraint< Dim >
LineSegment() :
LineSegment< Dim >
- p -
points_inside() :
Ellipsoid< Dim >
,
Polyhedron< Dim >
Polyhedron() :
Polyhedron< Dim >
- s -
sample() :
Ellipsoid< Dim >
SeedDecomp() :
SeedDecomp< Dim >
set_local_bbox() :
DecompBase< Dim >
,
EllipsoidDecomp< Dim >
set_obs() :
DecompBase< Dim >
,
EllipsoidDecomp< Dim >
shrink() :
DecompBase< Dim >
signed_dist() :
Hyperplane< Dim >
simplify() :
IterativeDecomp< Dim >
- v -
volume() :
Ellipsoid< Dim >
Generated by
1.8.11