![]() |
#include <CGAL/Line_arc_3.h>
| |||
Construct the line segment supported by l, whose source
is p1, and whose target is p2.
| |||
| Line_arc_3<SphericalKernel> la ( Line_3<SphericalKernel> l, Point_3<SphericalKernel> p1, Point_3<SphericalKernel> p2); | |||
|
Same.
| |||
| Line_arc_3<SphericalKernel> la ( Segment_3<SphericalKernel> s); | |||
| Line_3<SphericalKernel> | la.supporting_line () | |
| Circular_arc_point_3<SphericalKernel> | ||
| la.source () | ||
| Circular_arc_point_3<SphericalKernel> | ||
| la.target () | ||
| Circular_arc_point_3<SphericalKernel> | ||
| la.min () | Constructs the minimum vertex according to the lexicographic ordering of coordinates. | |
| Circular_arc_point_3<SphericalKernel> | ||
| la.max () | Same for the maximum vertex. | |
| bool | la.is_vertical () | Returns true iff the segment is vertical. |
| istream& | std::istream& is >> Line_arc_3 & ca | |
| ostream& | std::ostream& os << Line_arc_3 ca | |
The format for input/output is, for each line arc: a Line_3 (the supporting line) and two Circular_arc_point_3 (the two endpoints), under the condition that the endpoints are actually lying on the line.
CGAL::Circular_arc_point_3<SphericalKernel>
CGAL::Circular_arc_3<SphericalKernel>