DelaunayRefinement.cpp File Reference

Delaunay refinement -*- C++ -*-. More...

#include <iostream>
#include <stack>
#include <sys/time.h>
#include <limits.h>
#include <math.h>
#include <string.h>
#include <cassert>
#include "Element.h"
#include <stdlib.h>
#include <cstdio>
#include <cmath>
#include "Galois/Statistic.h"
#include "Galois/Graphs/Graph.h"
#include "Galois/Galois.h"
#include "Lonestar/Banner.h"
#include "Lonestar/CommandLine.h"
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <fstream>
#include <istream>

Classes
struct	process
Typedefs
typedef Galois::Graph::FirstGraph < Element, void, false >	Graph
typedef Galois::Graph::FirstGraph < Element, void, false > ::GraphNode	GNode
Functions
int	main (int argc, const char **argv)
Variables
static const char *	name = "Delaunay Mesh Refinement"
static const char *	description = "Refines a Delaunay triangulation mesh such that no angle in the mesh is less than 30 degrees\n"
static const char *	url = "delaunay_mesh_refinement"
static const char *	help = "<input base filename>"
Graph *	mesh

---

Detailed Description

Delaunay refinement -*- C++ -*-.

License

Galois, a framework to exploit amorphous data-parallelism in irregular programs.

Copyright (C) 2011, The University of Texas at Austin. All rights reserved. UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS SOFTWARE AND DOCUMENTATION, INCLUDING ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR ANY PARTICULAR PURPOSE, NON-INFRINGEMENT AND WARRANTIES OF PERFORMANCE, AND ANY WARRANTY THAT MIGHT OTHERWISE ARISE FROM COURSE OF DEALING OR USAGE OF TRADE. NO WARRANTY IS EITHER EXPRESS OR IMPLIED WITH RESPECT TO THE USE OF THE SOFTWARE OR DOCUMENTATION. Under no circumstances shall University be liable for incidental, special, indirect, direct or consequential damages or loss of profits, interruption of business, or related expenses which may arise from use of Software or Documentation, including but not limited to those resulting from defects in Software and/or Documentation, or loss or inaccuracy of data of any kind.

Description

Refinement of an initial, unrefined Delaunay mesh to eliminate triangles with angles < 30 degrees, using a variation of Chew's algorithm.

Author:

Milind Kulkarni <milind@purdue.edu>>

Andrew Lenharth <andrewl@lenharth.org>

---

Typedef Documentation

typedef Galois::Graph::FirstGraph<Element,void,false>::GraphNode GNode

typedef Galois::Graph::FirstGraph<Element,void,false> Graph

---

Function Documentation

int main	(	int	argc,
		const char **	argv
	)

---

Variable Documentation

const char* description = "Refines a Delaunay triangulation mesh such that no angle in the mesh is less than 30 degrees\n" [static]

const char* help = "<input base filename>" [static]

Graph* mesh

const char* name = "Delaunay Mesh Refinement" [static]

const char* url = "delaunay_mesh_refinement" [static]