GraphComponent
Class Face

java.lang.Object
  GraphComponent.Face

public class Face
extends java.lang.Object

Title: GraphDrawing

Description: Bangladesh University of engineering and technology

Copyright: Copyright (c) 2008

Company: Bangladesh University of engineering and technology

Constructor Summary

Face()

Method Summary

static GraphNode	addNodeInList(GraphNode[] graphNode, boolean outerface, int inlist, int location, int node)
static GraphNode[]	getAllFaces(GraphNode[] graphNode) u,v is an anticlockwise edge on outer face the function returns all unique faces in an linked list of nodes
static GraphNode	getInnerFace(GraphNode[] graphNode, int u, int v) given planar adjacency list and edge u and v list in anticlockwise order the function returns the face in an seperate linked list of node
static GraphNode	getOuterFace(GraphNode[] graphNode, int u, int v) given planar adjacency list and edge u and v list in anticlockwise order the function returns the face in an seperate linked list of node
static GraphNode	triangulate(GraphNode[] graphNode)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Face

public Face()

Method Detail

getInnerFace

public static GraphNode getInnerFace(GraphNode[] graphNode,
                                     int u,
                                     int v)

given planar adjacency list and edge u and v list in anticlockwise order the function returns the face in an seperate linked list of node

Parameters:

graphNode - GraphNode[]

u - int

v - int

getOuterFace

public static GraphNode getOuterFace(GraphNode[] graphNode,
                                     int u,
                                     int v)

given planar adjacency list and edge u and v list in anticlockwise order the function returns the face in an seperate linked list of node

Parameters:

graphNode - GraphNode[]

u - int

v - int

getAllFaces

public static GraphNode[] getAllFaces(GraphNode[] graphNode)

u,v is an anticlockwise edge on outer face the function returns all unique faces in an linked list of nodes

Parameters:

graphNode - GraphNode[]

u - int

v - int

addNodeInList

public static GraphNode addNodeInList(GraphNode[] graphNode,
                                      boolean outerface,
                                      int inlist,
                                      int location,
                                      int node)

triangulate

public static GraphNode triangulate(GraphNode[] graphNode)

Parameters:

graphNode - GraphNode[]