mirror of https://github.com/CGAL/cgal
5e6b0c3704
|
||
|---|---|---|
| .. | ||
| README | ||
| amer_a.bps | ||
| amer_b.bps | ||
| amer_c.bps | ||
| amer_d.bps | ||
| amer_e.bps | ||
| amer_f.bps | ||
| amer_g.bps | ||
| amer_h.bps | ||
| amer_i.bps | ||
| amer_j.bps | ||
| amer_k.bps | ||
| bezier_traits_adapter.cpp | ||
| bezier_traits_adapter2.cpp | ||
| bso_rational_nt.h | ||
| char_g.bps | ||
| char_g.dat | ||
| char_m.bps | ||
| char_m.dat | ||
| circle_segment.cpp | ||
| conic_traits_adapter.cpp | ||
| connect_polygon.cpp | ||
| do_intersect.cpp | ||
| dxf_union.cpp | ||
| input_0.bps | ||
| input_1.bps | ||
| pgn_holes.dat | ||
| print_utils.h | ||
| sequence.cpp | ||
| set_union.cpp | ||
| simple_join_intersect.cpp | ||
| symmetric_difference.cpp | ||
| test.dxf | ||
README
example1 - (do_intersect) Determining whether two polygons intersect. example2 - (intersection) Computing the intersection of two triangles. example3 - (sequence) Computing a sequence of Boolean Set-Operations. example4 - (circle_segment) Handling circles and linear segments concurrently. example5 - (traits_adaptor) Using the traits adaptor. example6 - (set_union) Computing the union of two sets of general polygons.