Uses of Class java.awt.geom.Area.Segment

Overview

Package

Class

Use

Deprecated

Index

Home >> All >> java >> awt >> [ geom overview ]

PREV NEXT

Uses of Class
java.awt.geom.Area.Segment

Uses of Area.Segment in java.awt.geom

Subclasses of Area.Segment in java.awt.geom

private class Area.CubicSegment
          Cubic Bezier curve segment

private class Area.LineSegment


private class Area.QuadSegment
          Quadratic Bezier curve segment Note: Most peers don't support quadratics directly, so it might make sense to represent them as cubics internally and just be done with it.

Fields in java.awt.geom declared as Area.Segment

(package private) Area.Segment Area.Intersection.seg


(package private) Area.Segment Area.Segment.next


(package private) Area.Segment Area.Segment.node

Methods in java.awt.geom that return Area.Segment

(package private) Area.Segment Area.Segment.cloneSegmentList()
          Clones this path

(package private) Area.Segment Area.Segment.getTopLeft()
          Return the segment with the top-leftmost first point

(package private) Area.Segment Area.LineSegment.lastCoLinear()
          Return the last segment colinear with this one.

Methods in java.awt.geom with parameters of type Area.Segment

private int Area.createNodes(Area.Segment A, Area.Segment B)
          Find the intersections of two separate closed paths, A and B, split the segments at the intersection points, and create nodes pointing from one to the other

private int Area.createNodesSelf(Area.Segment A)
          Find the intersections of a path with itself.

(package private) abstract int Area.Segment.splitIntersections(Area.Segment b)


(package private) abstract boolean Area.Segment.equals(Area.Segment b)
          Compare two segments.

(package private) void Area.Segment.insert(Area.Segment v)
          Inserts a Segment after this one

(package private) int Area.Segment.createNode(Area.Segment b, Area.Intersection i)
          Creates a node between this segment and segment b at the given intersection

protected int Area.Segment.createNodes(Area.Segment b, Area.Intersection[] x)
          Creates multiple nodes from a list of intersections, This must be done in the order of ascending parameters, and the parameters must be recalculated in accordance with each split.

(package private) boolean Area.Segment.pathEquals(Area.Segment B)
          Determines if two paths are equal.

(package private) boolean Area.LineSegment.equals(Area.Segment b)
          Compare two segments.

(package private) boolean Area.LineSegment.hasIntersections(Area.Segment b)
          Returns if the line has intersections.

(package private) int Area.LineSegment.splitIntersections(Area.Segment b)
          Splits intersections into nodes, This one handles line-line, line-quadratic, line-cubic

(package private) boolean Area.QuadSegment.equals(Area.Segment b)
          Compare two segments.

(package private) int Area.QuadSegment.splitIntersections(Area.Segment b)
          Splits intersections into nodes, This one handles quadratic-quadratic only, Quadratic-line is passed on to the LineSegment class, Quadratic-cubic is passed on to the CubicSegment class

(package private) boolean Area.CubicSegment.equals(Area.Segment b)
          Compare two segments.

(package private) int Area.CubicSegment.splitIntersections(Area.Segment b)
          Splits intersections into nodes, This one handles cubic-cubic and cubic-quadratic intersections