sorting.h File Reference

#include "dcel.h"

Include dependency graph for sorting.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
void	sort (struct DCEL_T *dcel)
void	clutter (struct DCEL_T *dcel)
void	set_Highest_First (struct DCEL_T *dcel, int(*f)(struct Point_T *, struct Point_T *))

Function Documentation

clutter()

void clutter

(

struct DCEL_T *

dcel

)

Definition at line 32 of file sorting.cpp.

{
    int i=0;                    // Loop counter.
    int index1=0, index2=0;     // Array indexes.

    // Set seed.
    srand(time(NULL));

    // Loop set of points.
    for (i=0; i<dcel->nVertex ;i++)
    {
        // Generate random indexes to swap.
        index1 = rand() %  dcel->nVertex;
        index2 = rand() %  dcel->nVertex;

        // Swap elements.
        swap_Vertex( dcel, index1, index2);
    }
}

set_Highest_First()

void set_Highest_First	(	struct DCEL_T *	dcel,
		int(*)(struct Point_T *, struct Point_T *)	f
	)

Definition at line 52 of file sorting.cpp.

{
    int     i=0;                // Loop counter.
    int     length=0;           // Number of vertexes in DCEL.
    int     highest_Index=0;    // Index of highest point.

    // Get number of vertexes.
    length = get_Number_Vertex( dcel);
    highest_Index=0;

    // Find index of highest point.
    for (i=1; i<length ;i++)
    {
        if ((*f) ( &dcel->vertex[i].vertex, &dcel->vertex[highest_Index].vertex))
        {
            highest_Index = i;
        }
    }

    // Swap highest vertex and vertex at position 0.
    swap_Vertex( dcel, 0, highest_Index);

#ifdef DEBUG_SORTING
    printf("Highest point at position %d.", highest_Index);
    print_Point( &dcel->vertex[0].vertex);
    fflush(NULL);
#endif
}

sort()

void sort

(

struct DCEL_T *

dcel

)

Definition at line 18 of file sorting.cpp.

{
    // Call quicksort with DCEL structure.
    quicksort( &dcel->vertex[0], &dcel->vertex[1], 0, dcel->nVertex-2);
}