clip_polyhedron.f90 File Reference

Data Types
type	mod_cg3_clip_polyhedron::t_incidence_graph

Modules
module	mod_cg3_clip_polyhedron

Functions/Subroutines
pure subroutine, public	mod_cg3_clip_polyhedron::cg3_polyhedron_clipping (polyhedron, clip_polyhedron, clipped_polyhedron, is_empty, is_clipped)
	Clip a convex polyhedron with a convex polyhedron.
pure subroutine, public	mod_cg3_clip_polyhedron::cg3_plane_polyhedron_clipping (polyhedron, normal, origin, clipped_polyhedron, is_empty, is_cut)
	Clip a convex polyhedron with a plane (half-space) using Sugihara's algorithm.
pure subroutine	mod_cg3_clip_polyhedron::partition_polyhedron (polyhedron, normal, origin, partition, clipped_polyhedron)
	Reconstruct the part of the polyhedron that belongs to the half-space.
pure subroutine	mod_cg3_clip_polyhedron::edge_plane_intersection (polyhedron, p1, p2, normal, origin, end_id, intersection_point)
	Compute the intersection of a plane and an edge.
pure subroutine	mod_cg3_clip_polyhedron::combinatorial_partition (graph, partition)
	Partition the vertex-graph of a polyhedron with the Sugihara's algorithm.
pure recursive subroutine	mod_cg3_clip_polyhedron::depth_first_search_partition (graph, partition, is_visited, new_partition, inside_flag, i)
logical pure function	mod_cg3_clip_polyhedron::is_connected (graph, sub_graph, inside_flag)
pure recursive subroutine	mod_cg3_clip_polyhedron::depth_first_search (graph, sub_graph, is_visited, inside_flag, i)