Function walkSingleFace

  • walkSingleFace(graph, vertex0, vertex1, walkedEdges?): {
        angles?: number[];
        edges: string[];
        vertices: number[];
    }

  • Parameters

    • graph: FOLDExtended

      a FOLD object with the additional vertices_sectors data

    • vertex0: number

      starting vertex

    • vertex1: number

      second vertex, this sets the direction of the walk

    • Optional walkedEdges: any = {}

      memo object, to prevent walking down duplicate paths, or finding duplicate faces, this dictionary will store and check against vertex pairs "i j".

    Returns {
        angles?: number[];
        edges: string[];
        vertices: number[];
    }

    the walked face, an object arrays of numbers under "vertices", "edges", and "angles", or if you are using a global "walkedEdges" hash, if the faces was previously built, returns undefined.

    • Optional angles?: number[]
    • edges: string[]
    • vertices: number[]

    Description

    Discover a single face by walking counter-clockwise from vertex to vertex until returning from which we began. A second vertex as an input is required to tell the algorithm which direction to begin the walk from the starting vertex. An optional hash table of walked edges exists as an input in case you are trying to build more than one face, initialize an empty object and pass it in every time you call this method. If you use a global "walkedEdges" and this method is trying to build a face that was already previously built, the method will return undefined.

Settings

Member Visibility

Theme