|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.stanford.rsl.konrad.geometry.General
public abstract class General
All kinds of geometric routines that are not specific to some geometric object or interact on a set of these.
Field Summary | |
---|---|
static SimpleVector |
E_X
|
static SimpleVector |
E_Y
|
static SimpleVector |
E_Z
|
Constructor Summary | |
---|---|
General()
|
Method Summary | |
---|---|
double |
angle(SimpleVector a,
SimpleVector b)
Computes the angle between two vectors; |
static boolean |
areColinear(SimpleVector v1,
SimpleVector v2,
double delta)
|
static SimpleVector |
augmentToHomgeneous(SimpleVector v)
|
static SimpleMatrix |
createHomAffineMotionMatrix(SimpleMatrix A)
|
static SimpleMatrix |
createHomAffineMotionMatrix(SimpleMatrix A,
SimpleVector t)
|
static SimpleMatrix |
createHomAffineMotionMatrix(SimpleVector t)
|
static java.util.ArrayList<Triangle> |
createTrianglesFromPlanarPointSet(java.util.ArrayList<PointND> points)
Creates a triangle mesh for a planar set of points. |
static SimpleVector |
crossProduct(SimpleVector v1,
SimpleVector v2)
|
static double |
euclideanDistance(SimpleVector v1,
SimpleVector v2)
|
static java.util.ArrayList<PointND> |
extractCandidatePoints(ij.process.ImageProcessor houghSpace,
double offset)
Extract points from an ImageProcessor which exceed a certain value |
static java.util.ArrayList<PointND> |
extractClusterCenter(java.util.ArrayList<PointND> pointList,
double distance)
Extracts cluster centers from an ordered List of points. |
static PointND |
getGeometricCenter(java.util.ArrayList<PointND> list)
Compute the geometric center of a set of points |
static PointND |
getGeometricCenter(java.util.Iterator<PointND> list)
Compute the geometric center of an iterator of points |
static PointND |
getGeometricCenter(PointND[] pts)
|
static boolean |
intersectRayWithCuboid(SimpleVector origin,
SimpleVector dir,
SimpleVector cubmin,
SimpleVector cubmax,
double[] distanceNearAndFar)
Computes the two intersections of a ray with a cuboid, called entry and exit point where the ray is specified by the given line origin and ray direction. |
static java.util.ArrayList<PointND> |
intersectRayWithCuboid(StraightLine line,
PointND min,
PointND max)
|
static boolean |
isNormalizeMode()
|
static boolean |
isWithinCuboid(PointND point,
PointND min,
PointND max)
Method to check whether a point is within a given cubiod defined by min and max. |
static SimpleVector |
normalizeFromHomogeneous(SimpleVector v)
|
static void |
setNormalizeMode(boolean mode)
|
static void |
splitHomAffineMotionMatrix(SimpleMatrix At,
SimpleMatrix A,
SimpleVector t)
|
static double |
toDegrees(double radians)
|
static double |
toRadians(double degrees)
|
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
public static final SimpleVector E_X
public static final SimpleVector E_Y
public static final SimpleVector E_Z
Constructor Detail |
---|
public General()
Method Detail |
---|
public static boolean isNormalizeMode()
public static void setNormalizeMode(boolean mode)
public static SimpleVector crossProduct(SimpleVector v1, SimpleVector v2)
public static boolean areColinear(SimpleVector v1, SimpleVector v2, double delta)
public double angle(SimpleVector a, SimpleVector b)
a
- b
-
public static double euclideanDistance(SimpleVector v1, SimpleVector v2)
public static SimpleVector augmentToHomgeneous(SimpleVector v)
public static SimpleVector normalizeFromHomogeneous(SimpleVector v)
public static SimpleMatrix createHomAffineMotionMatrix(SimpleMatrix A, SimpleVector t)
public static SimpleMatrix createHomAffineMotionMatrix(SimpleMatrix A)
public static SimpleMatrix createHomAffineMotionMatrix(SimpleVector t)
public static double toRadians(double degrees)
public static double toDegrees(double radians)
public static void splitHomAffineMotionMatrix(SimpleMatrix At, SimpleMatrix A, SimpleVector t)
public static java.util.ArrayList<PointND> intersectRayWithCuboid(StraightLine line, PointND min, PointND max)
public static boolean isWithinCuboid(PointND point, PointND min, PointND max)
point
- the pointmin
- the minimum coordinate of the cuboidmax
- the maximum coordinate of the cuboid.
public static boolean intersectRayWithCuboid(SimpleVector origin, SimpleVector dir, SimpleVector cubmin, SimpleVector cubmax, double[] distanceNearAndFar)
origin
- The ray origin in world coordinates.dir
- The normalized(!) ray direction (corresponding to a specific pixel) in world coordinates [rd_x rd_y rd_z].cubmin
- The cuboid's minimal planes given as [min_x, min_y, min_z] in world
coordinates.cubmax
- The cuboid's maximal planes given as [max_x, max_y, max_z] in world
coordinates.distanceNearAndFar
- Return values. In case of a hit: Positive distances (in world
coordinate units) of nearest and farthest plane intersection.
public static PointND getGeometricCenter(java.util.ArrayList<PointND> list)
list
- the set of points
public static PointND getGeometricCenter(java.util.Iterator<PointND> list)
list
- the set of points
public static java.util.ArrayList<PointND> extractCandidatePoints(ij.process.ImageProcessor houghSpace, double offset)
houghSpace
- the ImageProcessoroffset
- the threshold for extraction
public static java.util.ArrayList<PointND> extractClusterCenter(java.util.ArrayList<PointND> pointList, double distance)
pointList
- the list of candidate pointsdistance
- the minimal distance between clusters
public static PointND getGeometricCenter(PointND[] pts)
public static java.util.ArrayList<Triangle> createTrianglesFromPlanarPointSet(java.util.ArrayList<PointND> points)
points
- the points
ConvexHull
,
SurfaceBSpline
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |