dcel.cpp File Reference

Implementation of doubly-connected edge list class. More...

#include <l/l_sys_def.h>
#include <qd_cpp/dcel.h>
#include <l/l_sys_lib.h>
#include <l_cpp/l_util.h>
#include <set>
#include <map>

Namespaces
	kjb
	Classes and functions for dealing with trajectory files.
	kjb::qd
	support for the path algorithm I call the quasi-Dijkstra method.

Functions
std::vector< size_t >	kjb::qd::out_edges (const Doubly_connected_edge_list &, size_t)
	outbound half-edges at a particular vertex (specified by number) More...
std::vector< size_t >	kjb::qd::twin_edges (const Doubly_connected_edge_list &, const std::vector< size_t > &)
	Get the indices of twin edges of a given set of edges. More...
std::ostream &	kjb::qd::operator<< (std::ostream &, const kjb::qd::Doubly_connected_edge_list &)
	Print a text representation of the DCEL tables (but not the cache) More...
int	kjb::qd::is_valid (const Doubly_connected_edge_list &)
	slowly test invariants on the structure, return ERROR or NO_ERROR More...

Detailed Description

Implementation of doubly-connected edge list class.

Author

Andrew Predoehl

Implementation note: the DCEL sometimes has its edge next and prev fields are sometimes broken across various function calls.