Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
00001 #ifndef H_GEOMETRY_TWO_D_LINESEGMENT 00002 #define H_GEOMETRY_TWO_D_LINESEGMENT 00003 00004 #include "point.h" 00005 namespace geometry { 00006 namespace two_d { 00007 00008 template<typename T> 00009 struct LineSegment { 00010 Point<T> begin; 00011 Point<T> end; 00012 LineSegment() { 00013 } 00014 LineSegment(Point<T> b, Point<T> e) { 00015 begin = b; 00016 end = e; 00017 } 00018 }; 00019 00020 } // namespace two_d 00021 } // namespace geometry 00022 #endif