All Packages  This Package  Class Hierarchy  Class Search  Index

Class com.hermetica.gle.intersect
java.lang.Object
   |
   +----com.hermetica.gle.intersect

  Summary

public class  intersect
     extends java.lang.Object
{
          // Fields 1
     public static final String VERSION;

          // Constructors 1
     public intersect();

          // Methods 5
     public static boolean COLINEAR(double[], double[], double[]);
     public static final boolean CUTTING_PLANE(double[], double[], double[], double[]);
     public static final int FIND_NON_DEGENERATE_POINT(int, int, double, double[], double[][]);
     public static final double[] INNERSECT(double[], double[], double[], double[]);
     public static final double[] bisecting_plane(double[], double[], double[]);

}

Miscellaneous intersection and degenerate vector operations used by the GLE Tubing and Extrusion library.

Version:
$Id: intersect.java,v 1.1 1998/05/05 23:31:21 descarte Exp descarte $
Author:
Alligator Descartes <http://www.arcana.co.uk>




  Fields

VERSION

Summary  |  Top

   public static final String VERSION

Version information


  Constructors

intersect

Summary  |  Top

   public intersect() 

Default constructor



  Methods

FIND_NON_DEGENERATE_POINT

Summary  |  Top
   public static final int FIND_NON_DEGENERATE_POINT(int index, 
                                                     int npoints, 
                                                     double len, 
                                                     double[] diff, 
                                                     double[][] point_array) 

This macro is used in several places to cycle through a series of points to find the next non-degenerate point in a series



INNERSECT

Summary  |  Top
   public static final double[] INNERSECT(double[] p, 
                                          double[] n, 
                                          double[] v1, 
                                          double[] v2) 


bisecting_plane

Summary  |  Top
   public static final double[] bisecting_plane(double[] v1, 
                                                double[] v2, 
                                                double[] v3) 


CUTTING_PLANE

Summary  |  Top
   public static final boolean CUTTING_PLANE(double[] n, 
                                             double[] v1, 
                                             double[] v2, 
                                             double[] v3) 


COLINEAR

Summary  |  Top
   public static boolean COLINEAR(double[] v1, 
                                  double[] v2, 
                                  double[] v3) 

Returns true if the three points are colinear, else false. Note that if any two points are degenerate, then they are colinear. We are careful to make sure that the comparison is unit-less, i.e. that the lengths of the individual segments is normalized. By re-arrangement, avoid overhead of two square roots and two divides.



All Packages  This Package  Class Hierarchy  Class Search  Index
Freshly brewed Java API Documentation automatically generated with polardoc Version 1.0.6