util.h File Reference

#include "common.h"
#include "gcv/defines.h"
#include "rt/geom.h"
#include "rt/tree.h"

Include dependency graph for util.h:

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

Go to the source code of this file.

Data Structures
struct	gcv_region_end_data

Functions
struct rt_bot_internal *	gcv_facetize (struct db_i *db, const struct db_full_path *path, const struct bn_tol *tol, const struct bg_tess_tol *tess_tol)
int	gcv_bot_is_solid (const struct rt_bot_internal *bot)
int	gcv_bot_is_closed_fan (const struct rt_bot_internal *bot)
int	gcv_bot_is_orientable (const struct rt_bot_internal *bot)
union tree *	gcv_region_end (struct db_tree_state *tsp, const struct db_full_path *pathp, union tree *curtree, void *client_data)
union tree *	gcv_region_end_mc (struct db_tree_state *tsp, const struct db_full_path *pathp, union tree *curtree, void *client_data)
union tree *	gcv_bottess_region_end (struct db_tree_state *tsp, const struct db_full_path *pathp, union tree *curtree, void *client_data)
union tree *	gcv_bottess (int argc, const char **argv, struct db_i *dbip, struct bg_tess_tol *ttol)

Detailed Description

Utility functions provided by the LIBGCV geometry conversion library.

Definition in file util.h.

Function Documentation

gcv_facetize()

struct rt_bot_internal * gcv_facetize	(	struct db_i *	db,
		const struct db_full_path *	path,
		const struct bn_tol *	tol,
		const struct bg_tess_tol *	tess_tol
	)

gcv_bot_is_solid()

int gcv_bot_is_solid

(

const struct rt_bot_internal *

bot

)

gcv_bot_is_closed_fan()

int gcv_bot_is_closed_fan

(

const struct rt_bot_internal *

bot

)

gcv_bot_is_orientable()

int gcv_bot_is_orientable

(

const struct rt_bot_internal *

bot

)

gcv_region_end()

union tree * gcv_region_end	(	struct db_tree_state *	tsp,
		const struct db_full_path *	pathp,
		union tree *	curtree,
		void *	client_data
	)

Perform Boolean evaluation on a tree of tessellated leaf nodes.

Usually specified as the db_walk_tree() region_end callback, calling this routine for each positive region encountered.

The client_data parameter is expected to point to a struct gcv_region_end_data.

gcv_region_end_mc()

union tree * gcv_region_end_mc	(	struct db_tree_state *	tsp,
		const struct db_full_path *	pathp,
		union tree *	curtree,
		void *	client_data
	)

Exact same as gcv_region_end, except using the marching cubes algorithm.

gcv_bottess_region_end()

union tree * gcv_bottess_region_end	(	struct db_tree_state *	tsp,
		const struct db_full_path *	pathp,
		union tree *	curtree,
		void *	client_data
	)

gcv_bottess()

union tree * gcv_bottess	(	int	argc,
		const char **	argv,
		struct db_i *	dbip,
		struct bg_tess_tol *	ttol
	)