Store a set of points, identifying points that are nearer than a certain very small distance. More...

Inherits dal::dynamic_tas< T, pks >.

Public Member Functions
void	clear (void)
	reset the array, remove all points

size_type	search_node (const base_node &pt, const scalar_type radius=0) const
	Search a node in the array. More...

size_type	add_node (const base_node &pt, const scalar_type radius=0, bool remove_duplicated_nodes=true)
	Add a point to the array or identify it with a very close existing point. More...

Detailed Description

Store a set of points, identifying points that are nearer than a certain very small distance.

Definition at line 52 of file bgeot_node_tab.h.

Member Function Documentation

size_type bgeot::node_tab::search_node	(	const base_node &	pt,
		const scalar_type	radius = `0`
	)		const

Search a node in the array.

return its index if it exists or size_type(-1) otherwise.

Definition at line 56 of file bgeot_node_tab.cc.

size_type bgeot::node_tab::add_node	(	const base_node &	pt,
		const scalar_type	radius = `0`,
		bool	remove_duplicated_nodes = `true`
	)

Add a point to the array or identify it with a very close existing point.

If remove_duplicated_nodes = false, the identification of close existing points will be omitted and the point simply added to the array.

Definition at line 95 of file bgeot_node_tab.cc.

The documentation for this class was generated from the following files: