x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
planar_face_traversal.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\graph\planar_face_traversal.hpp
旋转
特效
属性
历史版本
//======================================================================= // Copyright (c) Aaron Windsor 2007 // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= #ifndef __PLANAR_FACE_TRAVERSAL_HPP__ #define __PLANAR_FACE_TRAVERSAL_HPP__ #include
#include
//for next and prior #include
namespace boost { struct planar_face_traversal_visitor { void begin_traversal() {} void begin_face() {} template
void next_edge(Edge e) {} template
void next_vertex(Vertex v) {} void end_face() {} void end_traversal() {} }; template
void planar_face_traversal(const Graph& g, PlanarEmbedding embedding, Visitor& visitor, EdgeIndexMap em ) { typedef typename graph_traits
::vertex_descriptor vertex_t; typedef typename graph_traits
::edge_descriptor edge_t; typedef typename graph_traits
::vertex_iterator vertex_iterator_t; typedef typename graph_traits
::edge_iterator edge_iterator_t; typedef typename property_traits
::value_type embedding_value_t; typedef typename embedding_value_t::const_iterator embedding_iterator_t; typedef typename std::vector< std::set
> distinguished_edge_storage_t; typedef typename std::vector< std::map
> distinguished_edge_to_edge_storage_t; typedef typename boost::iterator_property_map
distinguished_edge_map_t; typedef typename boost::iterator_property_map
distinguished_edge_to_edge_map_t; distinguished_edge_storage_t visited_vector(num_edges(g)); distinguished_edge_to_edge_storage_t next_edge_vector(num_edges(g)); distinguished_edge_map_t visited(visited_vector.begin(), em); distinguished_edge_to_edge_map_t next_edge(next_edge_vector.begin(), em); vertex_iterator_t vi, vi_end; typename std::vector
::iterator ei, ei_end; edge_iterator_t fi, fi_end; embedding_iterator_t pi, pi_begin, pi_end; visitor.begin_traversal(); // Initialize the next_edge property map. This map is initialized from the // PlanarEmbedding so that get(next_edge, e)[v] is the edge that comes // after e in the clockwise embedding around vertex v. for(tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi) { vertex_t v(*vi); pi_begin = embedding[v].begin(); pi_end = embedding[v].end(); for(pi = pi_begin; pi != pi_end; ++pi) { edge_t e(*pi); std::map
m = get(next_edge, e); m[v] = next(pi) == pi_end ? *pi_begin : *next(pi); put(next_edge, e, m); } } // Take a copy of the edges in the graph here, since we want to accomodate // face traversals that add edges to the graph (for triangulation, in // particular) and don't want to use invalidated edge iterators. // Also, while iterating over all edges in the graph, we single out // any self-loops, which need some special treatment in the face traversal. std::vector
self_loops; std::vector
edges_cache; std::vector
vertices_in_edge; for(tie(fi,fi_end) = edges(g); fi != fi_end; ++fi) { edge_t e(*fi); edges_cache.push_back(e); if (source(e,g) == target(e,g)) self_loops.push_back(e); } // Iterate over all edges in the graph ei_end = edges_cache.end(); for(ei = edges_cache.begin(); ei != ei_end; ++ei) { edge_t e(*ei); vertices_in_edge.clear(); vertices_in_edge.push_back(source(e,g)); vertices_in_edge.push_back(target(e,g)); typename std::vector
::iterator vi, vi_end; vi_end = vertices_in_edge.end(); //Iterate over both vertices in the current edge for(vi = vertices_in_edge.begin(); vi != vi_end; ++vi) { vertex_t v(*vi); std::set
e_visited = get(visited, e); typename std::set
::iterator e_visited_found = e_visited.find(v); if (e_visited_found == e_visited.end()) visitor.begin_face(); while (e_visited.find(v) == e_visited.end()) { visitor.next_vertex(v); visitor.next_edge(e); e_visited.insert(v); put(visited, e, e_visited); v = source(e,g) == v ? target(e,g) : source(e,g); e = get(next_edge, e)[v]; e_visited = get(visited, e); } if (e_visited_found == e_visited.end()) visitor.end_face(); } } // Iterate over all self-loops, visiting them once separately // (they've already been visited once, this visitation is for // the "inside" of the self-loop) ei_end = self_loops.end(); for(ei = self_loops.begin(); ei != ei_end; ++ei) { visitor.begin_face(); visitor.next_edge(*ei); visitor.next_vertex(source(*ei,g)); visitor.end_face(); } visitor.end_traversal(); } template
inline void planar_face_traversal(const Graph& g, PlanarEmbedding embedding, Visitor& visitor ) { planar_face_traversal(g, embedding, visitor, get(edge_index, g)); } } //namespace boost #endif //__PLANAR_FACE_TRAVERSAL_HPP__
planar_face_traversal.hpp
网页地址
文件地址
上一页
66/95
下一页
下载
( 6 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.