mirror of https://github.com/CGAL/cgal
Fix License for examples and demo
This commit is contained in:
parent
a603535abd
commit
5e78e5b3f1
|
|
@ -1,8 +1,11 @@
|
||||||
// Copyright (c) 2003 INRIA Sophia-Antipolis (France) and
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France) and
|
||||||
// Max-Planck-Institute Saarbruecken (Germany).
|
// Max-Planck-Institute Saarbruecken (Germany).
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
// Authors : Radu Ursu
|
// $URL$
|
||||||
|
// $Id$
|
||||||
|
//
|
||||||
|
// Authors : Sylvain Pion, Radu Ursu
|
||||||
//
|
//
|
||||||
// Partially supported by the IST Programme of the EU as a Shared-cost
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
||||||
// RTD (FET Open) Project under Contract No IST-2000-26473
|
// RTD (FET Open) Project under Contract No IST-2000-26473
|
||||||
|
|
|
||||||
|
|
@ -1,9 +1,11 @@
|
||||||
// Copyright (c) 2003 INRIA Sophia-Antipolis (France) and
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France) and
|
||||||
// Max-Planck-Institute Saarbruecken (Germany).
|
// Max-Planck-Institute Saarbruecken (Germany).
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
// Authors : Sylvain Pion <Sylvain.Pion@sophia.inria.fr>
|
// $URL$
|
||||||
// Radu Ursu
|
// $Id$
|
||||||
|
//
|
||||||
|
// Authors : Sylvain Pion, Radu Ursu
|
||||||
//
|
//
|
||||||
// Partially supported by the IST Programme of the EU as a Shared-cost
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
||||||
// RTD (FET Open) Project under Contract No IST-2000-26473
|
// RTD (FET Open) Project under Contract No IST-2000-26473
|
||||||
|
|
|
||||||
|
|
@ -1,7 +1,10 @@
|
||||||
// Copyright (c) 2003 INRIA Sophia-Antipolis (France) and
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France) and
|
||||||
// Max-Planck-Institute Saarbruecken (Germany).
|
// Max-Planck-Institute Saarbruecken (Germany).
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
|
// $URL$
|
||||||
|
// $Id$
|
||||||
|
//
|
||||||
// Authors : Radu Ursu
|
// Authors : Radu Ursu
|
||||||
//
|
//
|
||||||
// Partially supported by the IST Programme of the EU as a Shared-cost
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
||||||
|
|
|
||||||
|
|
@ -1,25 +1,15 @@
|
||||||
// Copyright (c) 1997-2000 Utrecht University (The Netherlands),
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France) and
|
||||||
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
|
// Max-Planck-Institute Saarbruecken (Germany).
|
||||||
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
|
// All rights reserved.
|
||||||
// (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
|
|
||||||
// and Tel-Aviv University (Israel). All rights reserved.
|
|
||||||
//
|
|
||||||
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
|
|
||||||
// modify it under the terms of the GNU Lesser General Public License as
|
|
||||||
// published by the Free Software Foundation; version 2.1 of the License.
|
|
||||||
// See the file LICENSE.LGPL distributed with CGAL.
|
|
||||||
//
|
|
||||||
// Licensees holding a valid commercial license may use this file in
|
|
||||||
// accordance with the commercial license agreement provided with the software.
|
|
||||||
//
|
|
||||||
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
||||||
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
||||||
//
|
//
|
||||||
// $URL$
|
// $URL$
|
||||||
// $Id$
|
// $Id$
|
||||||
//
|
//
|
||||||
|
// Authors : Radu Ursu
|
||||||
//
|
//
|
||||||
// Author(s) : Radu Ursu
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
||||||
|
// RTD (FET Open) Project under Contract No IST-2000-26473
|
||||||
|
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
||||||
|
|
||||||
#ifndef CGAL_QT_WIDGET_GET_SEGMENT_H
|
#ifndef CGAL_QT_WIDGET_GET_SEGMENT_H
|
||||||
#define CGAL_QT_WIDGET_GET_SEGMENT_H
|
#define CGAL_QT_WIDGET_GET_SEGMENT_H
|
||||||
|
|
|
||||||
|
|
@ -1,15 +1,15 @@
|
||||||
// Copyright (c) 2003 INRIA Sophia-Antipolis (France)
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France)
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
// Authors : Monique Teillaud <Monique.Teillaud@sophia.inria.fr>
|
// $URL$
|
||||||
// Sylvain Pion <Sylvain.Pion@sophia.inria.fr>
|
// $Id$
|
||||||
// Radu Ursu
|
//
|
||||||
|
// Authors : Monique Teillaud, Sylvain Pion, Radu Ursu
|
||||||
//
|
//
|
||||||
// Partially supported by the IST Programme of the EU as a Shared-cost
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
||||||
// RTD (FET Open) Project under Contract No IST-2000-26473
|
// RTD (FET Open) Project under Contract No IST-2000-26473
|
||||||
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
||||||
|
|
||||||
|
|
||||||
// TODO :
|
// TODO :
|
||||||
// - Add the possibility to input full circles.
|
// - Add the possibility to input full circles.
|
||||||
// - locate the cell containing a point.
|
// - locate the cell containing a point.
|
||||||
|
|
|
||||||
|
|
@ -1,16 +1,16 @@
|
||||||
// Copyright (c) 2003 INRIA Sophia-Antipolis (France) and
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France) and
|
||||||
// Max-Planck-Institute Saarbruecken (Germany).
|
// Max-Planck-Institute Saarbruecken (Germany).
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
// Authors : Monique Teillaud <Monique.Teillaud@sophia.inria.fr>
|
// $URL$
|
||||||
// Sylvain Pion <Sylvain.Pion@sophia.inria.fr>
|
// $Id$
|
||||||
// Radu Ursu
|
//
|
||||||
|
// Authors : Monique Teillaud, Sylvain Pion, Radu Ursu
|
||||||
//
|
//
|
||||||
// Partially supported by the IST Programme of the EU as a Shared-cost
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
||||||
// RTD (FET Open) Project under Contract No IST-2000-26473
|
// RTD (FET Open) Project under Contract No IST-2000-26473
|
||||||
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
||||||
|
|
||||||
|
|
||||||
// TODO :
|
// TODO :
|
||||||
// - Add the possibility to input full circles.
|
// - Add the possibility to input full circles.
|
||||||
// - locate the cell containing a point.
|
// - locate the cell containing a point.
|
||||||
|
|
|
||||||
|
|
@ -1,16 +1,16 @@
|
||||||
// Copyright (c) 2003 INRIA Sophia-Antipolis (France) and
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France) and
|
||||||
// Max-Planck-Institute Saarbruecken (Germany).
|
// Max-Planck-Institute Saarbruecken (Germany).
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
// Authors : Monique Teillaud <Monique.Teillaud@sophia.inria.fr>
|
// $URL$
|
||||||
// Sylvain Pion <Sylvain.Pion@sophia.inria.fr>
|
// $Id$
|
||||||
// Radu Ursu
|
//
|
||||||
|
// Authors : Monique Teillaud, Sylvain Pion, Radu Ursu
|
||||||
//
|
//
|
||||||
// Partially supported by the IST Programme of the EU as a Shared-cost
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
||||||
// RTD (FET Open) Project under Contract No IST-2000-26473
|
// RTD (FET Open) Project under Contract No IST-2000-26473
|
||||||
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
||||||
|
|
||||||
|
|
||||||
// TODO :
|
// TODO :
|
||||||
// - Add the possibility to input full circles.
|
// - Add the possibility to input full circles.
|
||||||
// - locate the cell containing a point.
|
// - locate the cell containing a point.
|
||||||
|
|
|
||||||
|
|
@ -1,16 +1,16 @@
|
||||||
// Copyright (c) 2003 INRIA Sophia-Antipolis (France) and
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France) and
|
||||||
// Max-Planck-Institute Saarbruecken (Germany).
|
// Max-Planck-Institute Saarbruecken (Germany).
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
// Authors : Monique Teillaud <Monique.Teillaud@sophia.inria.fr>
|
// $URL$
|
||||||
// Sylvain Pion <Sylvain.Pion@sophia.inria.fr>
|
// $Id$
|
||||||
// Radu Ursu
|
//
|
||||||
|
// Authors : Monique Teillaud, Sylvain Pion, Radu Ursu
|
||||||
//
|
//
|
||||||
// Partially supported by the IST Programme of the EU as a Shared-cost
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
||||||
// RTD (FET Open) Project under Contract No IST-2000-26473
|
// RTD (FET Open) Project under Contract No IST-2000-26473
|
||||||
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
||||||
|
|
||||||
|
|
||||||
// TODO :
|
// TODO :
|
||||||
// - Add the possibility to input full circles.
|
// - Add the possibility to input full circles.
|
||||||
// - locate the cell containing a point.
|
// - locate the cell containing a point.
|
||||||
|
|
|
||||||
|
|
@ -1,16 +1,16 @@
|
||||||
// Copyright (c) 2003 INRIA Sophia-Antipolis (France) and
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France) and
|
||||||
// Max-Planck-Institute Saarbruecken (Germany).
|
// Max-Planck-Institute Saarbruecken (Germany).
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
// Authors : Monique Teillaud <Monique.Teillaud@sophia.inria.fr>
|
// $URL$
|
||||||
// Sylvain Pion <Sylvain.Pion@sophia.inria.fr>
|
// $Id$
|
||||||
// Radu Ursu
|
//
|
||||||
|
// Authors : Monique Teillaud, Sylvain Pion, Radu Ursu
|
||||||
//
|
//
|
||||||
// Partially supported by the IST Programme of the EU as a Shared-cost
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
||||||
// RTD (FET Open) Project under Contract No IST-2000-26473
|
// RTD (FET Open) Project under Contract No IST-2000-26473
|
||||||
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
// (CGAL - Effective Computational Geometry for Curves and Surfaces)
|
||||||
|
|
||||||
|
|
||||||
// TODO :
|
// TODO :
|
||||||
// - Add the possibility to input full circles.
|
// - Add the possibility to input full circles.
|
||||||
// - locate the cell containing a point.
|
// - locate the cell containing a point.
|
||||||
|
|
|
||||||
|
|
@ -1,10 +1,11 @@
|
||||||
// Copyright (c) 2003 INRIA Sophia-Antipolis (France) and
|
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France) and
|
||||||
// Max-Planck-Institute Saarbruecken (Germany).
|
// Max-Planck-Institute Saarbruecken (Germany).
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
// Authors : Monique Teillaud <Monique.Teillaud@sophia.inria.fr>
|
// $URL$
|
||||||
// Sylvain Pion <Sylvain.Pion@sophia.inria.fr>
|
// $Id$
|
||||||
// Radu Ursu
|
//
|
||||||
|
// Authors : Monique Teillaud, Sylvain Pion, Radu Ursu
|
||||||
//
|
//
|
||||||
// Partially supported by the IST Programme of the EU as a Shared-cost
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
||||||
// RTD (FET Open) Project under Contract No IST-2000-26473
|
// RTD (FET Open) Project under Contract No IST-2000-26473
|
||||||
|
|
|
||||||
|
|
@ -1,27 +1,3 @@
|
||||||
// Copyright (c) 2003-2008 INRIA Sophia-Antipolis (France).
|
|
||||||
// All rights reserved.
|
|
||||||
//
|
|
||||||
// This file is part of CGAL (www.cgal.org); you may redistribute it under
|
|
||||||
// the terms of the Q Public License version 1.0.
|
|
||||||
// See the file LICENSE.QPL distributed with CGAL.
|
|
||||||
//
|
|
||||||
// Licensees holding a valid commercial license may use this file in
|
|
||||||
// accordance with the commercial license agreement provided with the software.
|
|
||||||
//
|
|
||||||
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
||||||
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
||||||
//
|
|
||||||
// $URL
|
|
||||||
// $Id
|
|
||||||
//
|
|
||||||
// Author(s) : Monique Teillaud, Sylvain Pion, Pedro Machado
|
|
||||||
|
|
||||||
// Partially supported by the IST Programme of the EU as a Shared-cost
|
|
||||||
// RTD (FET Open) Project under Contract No IST-2000-26473
|
|
||||||
// (ECG - Effective Computational Geometry for Curves and Surfaces)
|
|
||||||
// and a STREP (FET Open) Project under Contract No IST-006413
|
|
||||||
// (ACS -- Algorithms for Complex Shapes)
|
|
||||||
|
|
||||||
#include <CGAL/Cartesian.h>
|
#include <CGAL/Cartesian.h>
|
||||||
#include <CGAL/point_generators_2.h>
|
#include <CGAL/point_generators_2.h>
|
||||||
#include <CGAL/MP_Float.h>
|
#include <CGAL/MP_Float.h>
|
||||||
|
|
|
||||||
|
|
@ -1,18 +1,8 @@
|
||||||
// Copyright (c) 2008 INRIA Sophia-Antipolis (France).
|
// Copyright (c) 2008 INRIA Sophia-Antipolis (France).
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
// This file is part of CGAL (www.cgal.org); you may redistribute it under
|
// $URL
|
||||||
// the terms of the Q Public License version 1.0.
|
// $Id
|
||||||
// See the file LICENSE.QPL distributed with CGAL.
|
|
||||||
//
|
|
||||||
// Licensees holding a valid commercial license may use this file in
|
|
||||||
// accordance with the commercial license agreement provided with the software.
|
|
||||||
//
|
|
||||||
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
||||||
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
||||||
//
|
|
||||||
// $URL$
|
|
||||||
// $Id$
|
|
||||||
//
|
//
|
||||||
// Author(s) : Monique Teillaud, Sylvain Pion, Pedro Machado,
|
// Author(s) : Monique Teillaud, Sylvain Pion, Pedro Machado,
|
||||||
// Julien Hazebrouck, Damien Leroy
|
// Julien Hazebrouck, Damien Leroy
|
||||||
|
|
@ -20,7 +10,6 @@
|
||||||
// Partially supported by the IST Programme of the EU as a
|
// Partially supported by the IST Programme of the EU as a
|
||||||
// STREP (FET Open) Project under Contract No IST-006413
|
// STREP (FET Open) Project under Contract No IST-006413
|
||||||
// (ACS -- Algorithms for Complex Shapes)
|
// (ACS -- Algorithms for Complex Shapes)
|
||||||
// moc_source_file: demo_circle.h
|
|
||||||
|
|
||||||
#include <CGAL/basic.h>
|
#include <CGAL/basic.h>
|
||||||
#ifdef CGAL_USE_QT
|
#ifdef CGAL_USE_QT
|
||||||
|
|
|
||||||
|
|
@ -1,18 +1,8 @@
|
||||||
// Copyright (c) 2008 INRIA Sophia-Antipolis (France).
|
// Copyright (c) 2008 INRIA Sophia-Antipolis (France).
|
||||||
// All rights reserved.
|
// All rights reserved.
|
||||||
//
|
//
|
||||||
// This file is part of CGAL (www.cgal.org); you may redistribute it under
|
// $URL
|
||||||
// the terms of the Q Public License version 1.0.
|
// $Id
|
||||||
// See the file LICENSE.QPL distributed with CGAL.
|
|
||||||
//
|
|
||||||
// Licensees holding a valid commercial license may use this file in
|
|
||||||
// accordance with the commercial license agreement provided with the software.
|
|
||||||
//
|
|
||||||
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
||||||
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
||||||
//
|
|
||||||
// $URL$
|
|
||||||
// $Id$
|
|
||||||
//
|
//
|
||||||
// Author(s) : Monique Teillaud, Sylvain Pion, Pedro Machado,
|
// Author(s) : Monique Teillaud, Sylvain Pion, Pedro Machado,
|
||||||
// Julien Hazebrouck, Damien Leroy
|
// Julien Hazebrouck, Damien Leroy
|
||||||
|
|
|
||||||
|
|
@ -1,25 +1,3 @@
|
||||||
// Copyright (c) 2008 INRIA Sophia-Antipolis (France).
|
|
||||||
// All rights reserved.
|
|
||||||
//
|
|
||||||
// This file is part of CGAL (www.cgal.org); you may redistribute it under
|
|
||||||
// the terms of the Q Public License version 1.0.
|
|
||||||
// See the file LICENSE.QPL distributed with CGAL.
|
|
||||||
//
|
|
||||||
// Licensees holding a valid commercial license may use this file in
|
|
||||||
// accordance with the commercial license agreement provided with the software.
|
|
||||||
//
|
|
||||||
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
||||||
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
||||||
//
|
|
||||||
// $URL$
|
|
||||||
// $Id$
|
|
||||||
//
|
|
||||||
// Author(s) : Monique Teillaud, Sylvain Pion, Pedro Machado
|
|
||||||
|
|
||||||
// Partially supported by the IST Programme of the EU as a
|
|
||||||
// STREP (FET Open) Project under Contract No IST-006413
|
|
||||||
// (ACS -- Algorithms for Complex Shapes)
|
|
||||||
|
|
||||||
#include <CGAL/Cartesian.h>
|
#include <CGAL/Cartesian.h>
|
||||||
#include <CGAL/Algebraic_kernel_for_spheres_2_3.h>
|
#include <CGAL/Algebraic_kernel_for_spheres_2_3.h>
|
||||||
#include <CGAL/Spherical_kernel_3.h>
|
#include <CGAL/Spherical_kernel_3.h>
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue