dcel.h File Reference

declaration of doubly-connected edge list class and helper functions More...

#include <qd_cpp/intersection.h>
#include <l/l_sys_lib.h>
#include <l/l_sys_io.h>
#include <l_cpp/l_util.h>
#include <vector>
#include <set>
#include <iosfwd>

Go to the source code of this file.

Classes
class	kjb::qd::Doubly_connected_edge_list
	data structure for a planar subdivision made by edges More...
struct	kjb::qd::Doubly_connected_edge_list::Vertex_record
struct	kjb::qd::Doubly_connected_edge_list::Edge_record
struct	kjb::qd::Doubly_connected_edge_list::Face_record

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

Functions
int	kjb::qd::is_valid (const Doubly_connected_edge_list &)
	slowly test invariants on the structure, return ERROR or NO_ERROR More...
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::vector< size_t >	kjb::qd::in_edges (const Doubly_connected_edge_list &dcel, size_t vertex_index)
	inbound half-edges at a particular vertex (specified by number) More...
size_t	kjb::qd::vertex_degree (const Doubly_connected_edge_list &d, size_t v)
	return number of segments (not edges) incident to this vertex More...
RatPoint_line_segment	kjb::qd::get_edge (const Doubly_connected_edge_list &d, size_t ei)
	get line segment represented by a DCEL edge (specified by index) 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...

Detailed Description

declaration of doubly-connected edge list class and helper functions

Author

Andrew Predoehl