Uses of Class
edu.mit.sketch.geom.Vertex

Packages that use Vertex
edu.mit.sketch.geom   
edu.mit.sketch.toolkit   
edu.mit.sketch.ui   
edu.mit.sketch.util   
 

Uses of Vertex in edu.mit.sketch.geom
 

Fields in edu.mit.sketch.geom declared as Vertex
 Vertex[] Segment.vertices
          vertices
 

Methods in edu.mit.sketch.geom that return Vertex
 Vertex[] GeneralPath.flatten(double flatness, int limit)
          Return an array of vertices corresponding to the flattened version of this GeneralPath
static Vertex[] Vertex.removeDuplicateVertices(Vertex[] vertices)
          Remove repeating vertices
static Vertex[] Vertex.cloneVertices(Vertex[] vertices)
          For obtaining a complete copy of an array of Vertex objects.
static Vertex[] Vertex.appendVertices(Vertex[] vertices, Vertex vertex)
          Appends the input vertices with the argument vertex
static Vertex[] Vertex.arrayListToArray(ArrayList vertices)
          Returns an array containing the elements of the Vector.
static Vertex[] Vertex.vectorToArray(Vector vertices)
          Returns an array containing the elements of the Vector.
 

Methods in edu.mit.sketch.geom with parameters of type Vertex
static Vertex[] Vertex.removeDuplicateVertices(Vertex[] vertices)
          Remove repeating vertices
static Vertex[] Vertex.cloneVertices(Vertex[] vertices)
          For obtaining a complete copy of an array of Vertex objects.
static Vertex[] Vertex.appendVertices(Vertex[] vertices, Vertex vertex)
          Appends the input vertices with the argument vertex
static double[] GeometryUtil.getIntermediateAngles(Vertex[] input_vertices)
          Find the angles that the intermediate line segments make WRT the x axis using the input_vertices
 

Constructors in edu.mit.sketch.geom with parameters of type Vertex
Vertex(Vertex vertex)
          The constructor.
Segment(Vertex[] vertices, int min, int max)
          The constructor.
 

Uses of Vertex in edu.mit.sketch.toolkit
 

Fields in edu.mit.sketch.toolkit declared as Vertex
 Vertex[] Fit.vertices
          The fit
 Vertex[] StrokeData.vertices
          The vertices in this data set.
 Vertex[] SimpleClassifier.final_fit
          Best hybrid fit
 Vertex[] SimpleClassifier.speed_fit
          Speed fit
 Vertex[] SimpleClassifier.direction_fit
          Fit based on curvature
 Vertex[] SimpleClassifier.points
          Speed original points in the stroke.
 

Methods in edu.mit.sketch.toolkit that return Vertex
 Vertex[] StrokeData.getVertices()
          Return the vertices array.
 Vertex[] StrokeData.getSpeedFit(double average_scale)
          See if the input is a polygon.
 Vertex[] StrokeData.getDirectionFit(double dd_dt_scale)
          Find the corners of the polygon using the change in the direction.
 Vertex[] StrokeData.removeRedundantEndPoints(Vertex[] input_points)
          Remove the redundant at the beginning and the end.
static Vertex[] Blackboard.decide(Vertex[] speed_fit, Vertex[] direction_fit, Point[] points, StrokeData data)
          a and b are two possible polygon matches for points.
static Vertex[] Blackboard.getCurvatureFitOld(Point[] points, Vertex[] vertices, double scale)
          Returns a curvature fit.
static Vertex[] Blackboard.getCurvatureFit(Point[] points, Vertex[] vertices, double scale)
          Returns a curvature fit.
static Vertex[] Blackboard.getContiguosExcludedPointSequence(int start_pointer, Vertex[] subset, Vertex[] superset)
          Return the sequence of contiguos point sequence that is included in superset, but is excluded in subset.
static Vertex[] Blackboard.getSymmetricDifference(Vertex[] a, Vertex[] b, Vertex[] intersection, int bias)
          Get the symmetric difference of a and b.
static Vertex[] Blackboard.overlay(Vertex[] subset, Vertex[] superset, int index_tolerance, double distance_tolerance)
          Overlay subset and superset so the vertices very close to one another are collapsed into one.
static Vertex[] Blackboard.removeCloseVertices(Vertex[] vertices, int index_tolerance, double distance_tolerance)
          Remove vertices closer than index_tolerance in indices or, distance_tolerance spatially.
static Vertex[] Blackboard.getIntersection(Vertex[] a, Vertex[] b, int bias)
          Get the common points in a and b.
static Vertex[] Blackboard.getUnion(Vertex[] a, Vertex[] b)
          Get all the points in a and b.
static Vertex[] Blackboard.insertVertex(Vertex[] vertices, Vertex vertex)
          Return the vertices obtained by inserting the input vertex to the appropriate slot in the input vertices.
 

Methods in edu.mit.sketch.toolkit with parameters of type Vertex
 Vertex[] StrokeData.removeRedundantEndPoints(Vertex[] input_points)
          Remove the redundant at the beginning and the end.
static Vertex[] Blackboard.decide(Vertex[] speed_fit, Vertex[] direction_fit, Point[] points, StrokeData data)
          a and b are two possible polygon matches for points.
static Vertex[] Blackboard.getCurvatureFitOld(Point[] points, Vertex[] vertices, double scale)
          Returns a curvature fit.
static Vertex[] Blackboard.getCurvatureFit(Point[] points, Vertex[] vertices, double scale)
          Returns a curvature fit.
static Fit[] Blackboard.getHybridFits(Vertex[] speed_fit, Vertex[] direction_fit, Point[] points)
          Computes the hybrid fits from speed_fit and direction_fit
static GeneralPath Blackboard.computeGeneralPath(Vertex[] intersection, Vertex[] superset, Fit[] fits, StrokeData data)
          Compute a GeneralPath given the information in the arguments.
static Vertex[] Blackboard.getContiguosExcludedPointSequence(int start_pointer, Vertex[] subset, Vertex[] superset)
          Return the sequence of contiguos point sequence that is included in superset, but is excluded in subset.
static double Blackboard.leastSquaresForPolygon(Vertex[] vertices, Point[] points)
          calculate the lsq error.
static boolean Blackboard.containsWithTolerance(Vertex[] vertices, Vertex vertex, int index_difference_tolerance, double distance_tolerance)
          Return true if the array contains a Vertex that is sufficiently close to the argument vertex given the tolerances.
static Vertex[] Blackboard.getSymmetricDifference(Vertex[] a, Vertex[] b, Vertex[] intersection, int bias)
          Get the symmetric difference of a and b.
static Vertex[] Blackboard.overlay(Vertex[] subset, Vertex[] superset, int index_tolerance, double distance_tolerance)
          Overlay subset and superset so the vertices very close to one another are collapsed into one.
static int Blackboard.getIndexInVertices(Vertex[] vertices, Vertex vertex, int index_difference_tolerance, double distance_tolerance)
          Return the index in subset if the array contains a Vertex that is sufficiently close to the argument vertex given the tolerances.
static Vertex[] Blackboard.removeCloseVertices(Vertex[] vertices, int index_tolerance, double distance_tolerance)
          Remove vertices closer than index_tolerance in indices or, distance_tolerance spatially.
static Vertex[] Blackboard.getIntersection(Vertex[] a, Vertex[] b, int bias)
          Get the common points in a and b.
static Vertex[] Blackboard.getUnion(Vertex[] a, Vertex[] b)
          Get all the points in a and b.
static void Blackboard.checkCertaintyBounds(Vertex[] vertices)
          See if all the certainty values are between 0 and 1.
static Vertex[] Blackboard.insertVertex(Vertex[] vertices, Vertex vertex)
          Return the vertices obtained by inserting the input vertex to the appropriate slot in the input vertices.
static Point[] Blackboard.getControlPoints(Vertex v1, Vertex v2, StrokeData data)
          Return the control points to be used for drawing a curve from v1 to v2.
static Point[] Blackboard.getControlPoints(Vertex v1, Vertex v2, StrokeData data, int left_offset, int right_offset)
          Return the control points to be used for drawing a curve from v1 to v2.
 void ObjectManager.addVertices(Vertex[] vertices)
          Adds an object to the objects vector after filtering.
 

Constructors in edu.mit.sketch.toolkit with parameters of type Vertex
Fit(Point[] original_points, Vertex[] vertices, double lsq_error)
          The constructor.
StrokeData(Vertex[] vertices)
          The constructor.
 

Uses of Vertex in edu.mit.sketch.ui
 

Fields in edu.mit.sketch.ui declared as Vertex
 Vertex[] TabletDataProcessor.final_fit
           
 Vertex[] TabletDataProcessor.speed_fit
           
 Vertex[] TabletDataProcessor.direction_fit
           
 

Methods in edu.mit.sketch.ui that return Vertex
 Vertex[] TabletDataProcessor.combineEndPoints(Vertex[] polygon)
          Combines the ends of the polygon if they are sufficiently close.
 Vertex[] TabletDataProcessor.simplifyPolygon(Vertex[] input_vertices)
          Simplify the polygon to get rid of consecutive lines which are sufficiently parallel.
 

Methods in edu.mit.sketch.ui with parameters of type Vertex
 Vertex[] TabletDataProcessor.combineEndPoints(Vertex[] polygon)
          Combines the ends of the polygon if they are sufficiently close.
 Vertex[] TabletDataProcessor.simplifyPolygon(Vertex[] input_vertices)
          Simplify the polygon to get rid of consecutive lines which are sufficiently parallel.
 void TabletGUIBehavior.displayVertices(Vertex[] vertices)
          Paint the vertices along with the path combining them
 void TabletGUIBehavior.displayVerticesAsDots(Vertex[] vertices)
          Paint the vertices along without the path combining them
 

Uses of Vertex in edu.mit.sketch.util
 

Methods in edu.mit.sketch.util that return Vertex
static Vertex[] AWTUtil.flatten(Shape shape, double flatness, int limit)
          Return an array of vertices corresponding to the flattened version of the input.
static Vertex[] AWTUtil.simplifyPolygon(Vertex[] input_vertices, double turn_angle_treshold)
          Simplify the polygon to get rid of consecutive lines which are sufficiently parallel.
 

Methods in edu.mit.sketch.util with parameters of type Vertex
static double AWTUtil.leastSquaresForPolygon(Vertex[] vertices, Point[] points)
          Calculate the lsq error.
static Vertex[] AWTUtil.simplifyPolygon(Vertex[] input_vertices, double turn_angle_treshold)
          Simplify the polygon to get rid of consecutive lines which are sufficiently parallel.