Package | Description |
---|---|
Jcg.geometry | |
Jcg.rangesearch |
Modifier and Type | Method and Description |
---|---|
Point_d[] |
PointCloud_d.boundingBox()
Compute the bounding box (enclosing all points)
|
Point_d |
PointCloud_d.max(int d)
Return the point with greatest coordinate value (in direction d)
|
Point_d |
PointCloud_d.min(int d)
Return the point with smallest coordinate value (in direction d)
|
Constructor and Description |
---|
PointCloud_d(java.util.ArrayList<Point_d> points)
Create a new point cloud (a copy) from a collection of points
|
Modifier and Type | Field and Description |
---|---|
Point_d |
PointCloud_KdTree.p |
Modifier and Type | Method and Description |
---|---|
static Point_d[] |
PointCloud_KdTree.copy(PointCloud_KdTree N,
int size) |
Point_d |
Median.findMedian(int cutDim)
Compute the median of a set of points
|
Point_d |
MedianWithSorting.findMedian(int cutDim)
Compute the median of a set of point cloud (after sorting)
cutDim = {0,1,2} => {x,y,z}
Warning: input points should not be sorted (perform a copy of input points)
|
static Point_d |
PointCloud_KdTree.mean(PointCloud_KdTree N) |
private Point_d |
MedianWithSorting.selectWithSorting(Point_d[] buffer,
int index,
int cutDim)
Sort the input array and select the i-th element
Remark: it takes O(nlog n) time
|
Modifier and Type | Method and Description |
---|---|
static <X extends Point_> |
KdTree.toList(KdTree<X> t,
java.util.ArrayList<Point_d> list) |
Modifier and Type | Method and Description |
---|---|
private Point_d |
MedianWithSorting.selectWithSorting(Point_d[] buffer,
int index,
int cutDim)
Sort the input array and select the i-th element
Remark: it takes O(nlog n) time
|
Modifier and Type | Method and Description |
---|---|
static <X extends Point_> |
KdTree.toList(KdTree<X> t,
java.util.ArrayList<Point_d> list) |
Constructor and Description |
---|
PointCloud_KdTree(Point_d p,
PointCloud_KdTree n,
boolean copy)
Constructor: add a new point to the cloud (copying or not)
|