25 #ifndef CGAL_OPT_SIMPLE_CARTESIAN_POINT_2_H
26 #define CGAL_OPT_SIMPLE_CARTESIAN_POINT_2_H
50 int id()
const {
return (
int)
this; }
52 FT
hx()
const {
return x(); }
53 FT
hy()
const {
return y(); }
54 FT
hw()
const {
return FT(1); }
57 const FT&
x()
const {
return _x; }
58 const FT&
y()
const {
return _y; }
59 FT&
x() {
return _x; }
60 FT&
y() {
return _y; }
64 return (i == 0) ?
x() :
y();
69 return (i == 0) ?
x() :
y();
98 #include <CGAL/SimpleCartesian/VectorS2.h>
100 #include <CGAL/Bbox_2.h>
105 template <
class FT >
111 template <
class FT >
117 template <
class FT >
123 template <
class FT >
128 template <
class FT >
134 template <
class FT >
140 template <
class FT >
147 #ifndef CGAL_NO_OSTREAM_INSERT_POINTS2
148 template <
class FT >
150 operator<<(std::ostream& os, const PointS2<FT>& p)
155 return os << p.x() <<
' ' << p.y();
161 return os <<
"PointS2(" << p.x() <<
", " << p.y() <<
')';
164 #endif // CGAL_NO_OSTREAM_INSERT_POINTS2
166 #ifndef CGAL_NO_ISTREAM_EXTRACT_POINTS2
167 template <
class FT >
188 #endif // CGAL_NO_ISTREAM_EXTRACT_POINTS2
192 #endif // CGAL_OPT_SIMPLE_CARTESIAN_POINT_2_H
Self & operator+=(const Vector &v)
FT cartesian(int i) const
Aff_transformationS2< FT > Aff_transformation
PointS2(const FT &hx, const FT &hy, const FT &hw)
void int int REAL REAL * y
#define CGAL_kernel_assertion_msg(EX, MSG)
bool lexicographically_xy_smaller(const Point_2< R > &p, const Point_2< R > &q)
Iterator_from_circulator< C, Ref, Ptr > operator+(Dist n, const Iterator_from_circulator< C, Ref, Ptr > &circ)
Self & operator=(const Self &p)
const FT & operator[](int i) const
bool operator<(const Self &p) const
*********************************************************************Illinois Open Source License ****University of Illinois NCSA **Open Source License University of Illinois All rights reserved ****Developed free of to any person **obtaining a copy of this software and associated documentation to deal with the Software without including without limitation the rights to and or **sell copies of the and to permit persons to whom the **Software is furnished to do subject to the following this list of conditions and the following disclaimers ****Redistributions in binary form must reproduce the above **copyright this list of conditions and the following **disclaimers in the documentation and or other materials **provided with the distribution ****Neither the names of the Center for Simulation of Advanced the University of nor the names of its **contributors may be used to endorse or promote products derived **from this Software without specific prior written permission ****THE SOFTWARE IS PROVIDED AS WITHOUT WARRANTY OF ANY **EXPRESS OR INCLUDING BUT NOT LIMITED TO THE WARRANTIES **OF FITNESS FOR A PARTICULAR PURPOSE AND **NONINFRINGEMENT IN NO EVENT SHALL THE CONTRIBUTORS OR **COPYRIGHT HOLDERS BE LIABLE FOR ANY DAMAGES OR OTHER WHETHER IN AN ACTION OF TORT OR **ARISING OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE **USE OR OTHER DEALINGS WITH THE SOFTWARE v
Self & operator-=(const Vector &v)
const FT & cartesian(int i) const
void write(std::ostream &os, const T &t, const io_Read_write &)
bool operator==(const Origin &) const
Self transform(const Aff_transformation &t) const
FT homogeneous(int i) const
bool operator==(const Self &p) const
void read(std::istream &is, T &t, const io_Read_write &)
#define CGAL_BEGIN_NAMESPACE
PointS2(const FT &x, const FT &y)
#define CGAL_END_NAMESPACE
#define CGAL_kernel_precondition(EX)
Point_2< R > operator-(const Origin &o, const Vector_2< R > &v)