---

gugr::contour_node Struct Reference

#include <gugr_contour.h>

List of all members.

Public Methods
	contour_node (bool aside)
bool	hasOwner (void *o)
void	get_polyline (gul::polyline< gul::point2< guar::rational > > &pl)
void	get_polyline_joined (gul::polyline< gul::point2< guar::rational > > &pl)
void	Insert (contour_node *achild)
void	dump (int indent)
Public Attributes
int	nVerts
Ptr< vertex >	verts
Ptr< line >	lines
int	nOwners
Ptr< void *>	owners
bool	side
bool	hole
contour_node *	parent
RefMap< void >	childs
segment *	hseg
segment *	seg
bool	hseg_firstref
contour_node *	next
contour_node *	prev

---

Constructor & Destructor Documentation

gugr::contour_node::contour_node (  bool    aside )  [inline]

Definition at line 160 of file gugr_contour.h. References nOwners, and side. Referenced by dump(), and Insert(). { parent = 0; side = aside; nOwners = 0; }

---

Member Function Documentation

void gugr::contour_node::dump (  int    indent )  [inline]

Definition at line 265 of file gugr_contour.h. References childs, and contour_node(). { RefMap<void>::Node mn; int i; for( i = 0; i < indent; i++ ) std::cout << " "; std::cout << "contour " << (void *)this << "\n"; for( i = 0; i < indent; i++ ) std::cout << " "; std::cout << "parent = " << (void *)parent << "\n"; for( i = 0; i < indent; i++ ) std::cout << " "; std::cout << "childs = (\n"; mn = childs.First(); while( !mn.IsEmpty() ) { for( i = 0; i < indent; i++ ) std::cout << " "; std::cout << " " << mn.key() << "\n"; mn = childs.Successor( mn ); } for( i = 0; i < indent; i++ ) std::cout << " "; std::cout << ")\n\n"; // recursion, dump childs mn = childs.First(); while( !mn.IsEmpty() ) { ((contour_node *)mn.key())->dump(indent+4); mn = childs.Successor( mn ); } }

void gugr::contour_node::get_polyline (  gul::polyline< gul::point2< guar::rational > > &    pl )  [inline]

Definition at line 178 of file gugr_contour.h. References nVerts, and verts. { int i; pl.P.reserve_pool(nVerts); pl.n = nVerts; for( i = 0; i < nVerts; i++ ) pl.P[i] = verts[i].v(); }

void gugr::contour_node::get_polyline_joined (  gul::polyline< gul::point2< guar::rational > > &    pl )  [inline]

Definition at line 189 of file gugr_contour.h. References lines, nVerts, and verts. { int i,j,i1,iend; pl.P.reserve_pool(nVerts); pl.n = nVerts; // find a point which is not in the midst of a series of // colinear points i1 = nVerts-1; for( i = 0; i < nVerts; i++ ) { if( (compare(lines[i].dx(),lines[i1].dx())!=0) || (compare(lines[i].dy(),lines[i1].dy())!=0) ) break; i1 = i; } if( i == nVerts ) // not found { pl.n = 0; // everything is colinear, so whole contour is unnecessary return; } pl.P[0] = verts[i].v(); // DumpPS<float>::dump_point(pl.P[0]); i1 = iend = i; i++; if( i >= nVerts ) i = 0; j = 1; for(;;) { // search next point which is not colinear while( i != iend ) { if( (compare(lines[i].dx(),lines[i1].dx())!=0) || (compare(lines[i].dy(),lines[i1].dy())!=0) ) break; i++; if( i >= nVerts ) i = 0; // wrap around } // start point of contour reached again if( i == iend ) break; pl.P[j] = verts[i].v(); // DumpPS<float>::dump_point(pl.P[j]); i1 = i; i++; if( i >= nVerts ) i = 0; // wrap around j++; } pl.n = j; }

bool gugr::contour_node::hasOwner (  void *    o )  [inline]

Definition at line 166 of file gugr_contour.h. References nOwners, and owners. { int i; for( i=0; i < nOwners; i++ ) { if( owners[i] == o ) return true; } return false; }

void gugr::contour_node::Insert (  contour_node *    achild )  [inline]

Definition at line 249 of file gugr_contour.h. References childs, gugr::compare_pointer_to_pointer(), contour_node(), and side. { int side; RefMap<void>::Node pos,child; side = childs.SearchNode( (void *)achild, compare_pointer_to_pointer, &pos ); if( side != 0 ) { child = childs.NewNode((void *)achild); achild->parent = this; childs.InsertNode( child, pos, side ); } }

---

Member Data Documentation

RefMap<void> gugr::contour_node::childs

Definition at line 150 of file gugr_contour.h. Referenced by dump(), and Insert().

bool gugr::contour_node::hole

Definition at line 147 of file gugr_contour.h.

segment* gugr::contour_node::hseg

Definition at line 152 of file gugr_contour.h.

bool gugr::contour_node::hseg_firstref

Definition at line 155 of file gugr_contour.h.

Ptr<line> gugr::contour_node::lines

Definition at line 141 of file gugr_contour.h. Referenced by get_polyline_joined().

contour_node* gugr::contour_node::next

Definition at line 157 of file gugr_contour.h.

int gugr::contour_node::nOwners

Definition at line 143 of file gugr_contour.h. Referenced by contour_node(), and hasOwner().

int gugr::contour_node::nVerts

Definition at line 138 of file gugr_contour.h. Referenced by get_polyline(), and get_polyline_joined().

Ptr<void*> gugr::contour_node::owners

Definition at line 144 of file gugr_contour.h. Referenced by hasOwner().

contour_node* gugr::contour_node::parent

Definition at line 149 of file gugr_contour.h.

contour_node* gugr::contour_node::prev

Definition at line 158 of file gugr_contour.h.

segment* gugr::contour_node::seg

Definition at line 153 of file gugr_contour.h.

bool gugr::contour_node::side

Definition at line 146 of file gugr_contour.h. Referenced by contour_node(), and Insert().

Ptr<vertex> gugr::contour_node::verts

Definition at line 139 of file gugr_contour.h. Referenced by get_polyline(), and get_polyline_joined().

---

The documentation for this struct was generated from the following file:

• gugr_contour.h

---