| Package | Description | 
|---|---|
| Jcg.schnyderwoods | |
| Jcg.util | 
| Modifier and Type | Method and Description | 
|---|---|
DListNode<Halfedge<Point_>> | 
PlanarTriSchnyderWood.vertexRemoval(DListNode<Halfedge<Point_>> node)
It removes a vertex from the cut-border (vertex conquest)
 It updates the cut-border, assigning color and orientation to edges 
 | 
| Modifier and Type | Method and Description | 
|---|---|
void | 
PlanarTriSchnyderWood.addToCutBorder(Halfedge<Point_> e,
              DListNode<Halfedge<Point_>> node)
Add a half-edge to the cut-border, at a given position (in the cut-border)
 Update all concerned information (colors, existent chords, boundary vertices, ...) 
 | 
DListNode<Halfedge<Point_>> | 
PlanarTriSchnyderWood.vertexRemoval(DListNode<Halfedge<Point_>> node)
It removes a vertex from the cut-border (vertex conquest)
 It updates the cut-border, assigning color and orientation to edges 
 | 
| Modifier and Type | Method and Description | 
|---|---|
DListNode<X> | 
DLinkedList.getFirst()
Return the first node of the list
 The result is a null reference if the list is empty 
 | 
DListNode<X> | 
DLinkedList.getLast()
Return the first node of the list
 The result is a null reference if the list is empty 
 | 
DListNode<X> | 
DListNode.getNext()  | 
DListNode<X> | 
DListNode.getPrev()  | 
| Modifier and Type | Method and Description | 
|---|---|
void | 
DLinkedList.delete(DListNode<X> pNode)
Remove a given node from the list 
 | 
void | 
DLinkedList.insertAfter(DListNode<X> pNode,
           X el)
Insert a new element after a given node in the list 
 | 
void | 
DLinkedList.insertBefore(DListNode<X> pNode,
            X el)
Insert a new element before a given node in the list 
 | 
void | 
DListNode.setNext(DListNode<X> next)  | 
void | 
DListNode.setPrev(DListNode<X> prev)  | 
| Constructor and Description | 
|---|
DListNode(X element,
         DListNode<X> next,
         DListNode<X> previous)  | 
DListNode(X element,
         DListNode<X> next,
         DListNode<X> previous)  |