Correction of hyperlinks

The link checker gave a number of redirects and incorrect links.
- the redirects have been solved ass far as possible
- the incorrect links have been checked and corrected where possible, others  have been reported through issues;
This commit is contained in:
albert-github 2021-06-04 13:52:14 +02:00
parent 4ada5baa76
commit 2a54687e77
24 changed files with 36 additions and 36 deletions

View File

@ -227,7 +227,7 @@ cases where many labels are used (more than five).
An [example](\ref Classification_example_ethz_random_forest) shows how to
use this classifier. For more details about the algorithm, please refer
to README provided in the [ETH Zurich's code archive](https://www.ethz.ch/content/dam/ethz/special-interest/baug/igp/photogrammetry-remote-sensing-dam/documents/sourcecode-and-datasets/Random%20Forest/rforest.zip).
to README provided in the [ETH Zurich's code archive](https://ethz.ch/content/dam/ethz/special-interest/baug/igp/photogrammetry-remote-sensing-dam/documents/sourcecode-and-datasets/Random%20Forest/rforest.zip).
\subsubsection Classification_ETHZ_random_forest_deprecated Deprecated IO

View File

@ -322,7 +322,7 @@ employing the authors) of this work, a pointer to the file containing its text i
<LI>\$URL\$ : canonical path to the file on github,
<LI>\$Id\$ : the release version the file is from.
</UL>
<LI> Then [SPDX license identifier](https://spdx.org/). For GPL-3+ it should be `SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial`,
<LI> Then [SPDX license identifier](https://spdx.dev/). For GPL-3+ it should be `SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial`,
and `SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial` for LGPL-3+.
<LI>Then the authors of (non-negligible parts of) this file are listed, with
optional affiliation or e-mail address.

View File

@ -204,7 +204,7 @@ length integers, and for vectors, matrices, and polynomials over the
integers and over finite fields. The optional library \ntl is used by \cgal
to speed up operations of the Polynomial package, such as GCDs. It is recommended to install \ntl with support from \gmp.
\ntl can be downloaded from <A HREF="https://www.shoup.net/ntl/">`https://www.shoup.net/ntl/`</A>.
\ntl can be downloaded from <A HREF="https://libntl.org">`https://libntl.org`</A>.
\subsection thirdpartyESBTL ESBTL
@ -225,7 +225,7 @@ code. In order to use \tbb in \cgal programs, the executables
should be linked with the CMake imported target `CGAL::TBB_support`
provided in `CGAL_TBB_support.cmake`.
The \tbb web site is <A HREF="https://www.threadingbuildingblocks.org">`https://www.threadingbuildingblocks.org`</A>.
The \tbb web site is <A HREF="https://github.com/oneapi-src/oneTBB">`https://github.com/oneapi-src/oneTBB`</A>.
\subsection thirdpartyLASlib LASlib

View File

@ -308,7 +308,7 @@ there must be a global function `halfedges(const G&)`, etc.
An example for a concept with a required traits class is `InputIterator`.
For a model of an `InputIterator` a specialization of the class
<a href="http://en.cppreference.com/w/cpp/iterator/iterator_traits"> `std::iterator_traits`</a>
<a href="https://en.cppreference.com/w/cpp/iterator/iterator_traits"> `std::iterator_traits`</a>
must exist (or the generic template must be applicable).
\section intro_further Further Reading

View File

@ -245,8 +245,8 @@ A typical `Qt` installation would consist of the following steps:
<ul>
<li>
Download and install the Qt library for open source development package for your Visual Studio version at
<a href="https://www.qt.io/download/">https://www.qt.io/download/</a>
(here is the direct link to the <a href="https://www1.qt.io/offline-installers/">offline installers</a>).</li>
<a href="https://www.qt.io/download">https://www.qt.io/download</a>
(here is the direct link to the <a href="https://www.qt.io/offline-installers">offline installers</a>).</li>
<li>Add the environment variable `QTDIR` pointing to the place you installed Qt, e.g., `C:\dev\Qt\Qt5.13.1`,
as this will help `cmake` to find Qt.</li>
<li>Add the bin directory of Qt, e.g. add `C:\dev\Qt\Qt5.13.1\msvcXXXX_YY\bin` to `PATH`, where `XXXX_YY` is something like `vc2017_64`.

View File

@ -2142,7 +2142,7 @@ ABSTRACT = {We present the first complete, exact and efficient C++ implementatio
,month = dec
,year = {2000}
,issn = {0946-011X}
,url = {https://www.mpi-sb.mpg.de/~mehlhorn/ftp/InfiFrames.ps}
,url = {https://people.mpi-inf.mpg.de/~mehlhorn/ftp/InfiFrames.ps}
}
@InProceedings{cgal:sp-mrbee-05
@ -2373,7 +2373,7 @@ location = {Salt Lake City, Utah, USA}
howpublished = {Stefan Walk (ETH Zurich, Department of Civil,
Environmental and Geomatic Engineering, Institute of
Geodesy and Photogrammetry)},
url = {http://www.prs.igp.ethz.ch/research/Source_code_and_datasets.html},
url = {https://prs.igp.ethz.ch/research/Source_code_and_datasets.html},
year = 2014
}

View File

@ -152039,7 +152039,7 @@ pages = {179--189}
Booktitle = {53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)},
Year = {2012},
Pages = {440-449},
Url = {http://arxiv.org/abs/1110.4573}
Url = {https://arxiv.org/abs/1110.4573}
}
@article{cvl-ew-12,

View File

@ -37,7 +37,7 @@ You can access the CGAL Online Manual from the
<li><a href ="https://www.cgal.org/">CGAL Homepage</a>
<li><a href ="https://www.cgal.org/FAQ.html">FAQ</a>
<li><a href ="http://www.boost.org/doc/">Boost Documentation</a>
<li><a href ="http://en.cppreference.com/w/">STL Reference</a>
<li><a href ="https://en.cppreference.com/w/">STL Reference</a>
</ul>

View File

@ -493,7 +493,7 @@ using std::max;
// Macros to detect features of clang. We define them for the other
// compilers.
// See http://clang.llvm.org/docs/LanguageExtensions.html
// See also http://en.cppreference.com/w/cpp/experimental/feature_test
// See also https://en.cppreference.com/w/cpp/experimental/feature_test
#ifndef __has_feature
#define __has_feature(x) 0 // Compatibility with non-clang compilers.
#endif

View File

@ -542,9 +542,9 @@ cell base classes, the `MeshVertexBase_3` and
`MeshCellBase_3` concepts impose additional requirements.
Parallel algorithms require the executable to be linked against the
<a href="https://www.threadingbuildingblocks.org">Intel TBB library</a>.
<a href="https://github.com/oneapi-src/oneTBB">Intel TBB library</a>.
To control the number of threads used, the user may use the tbb::task_scheduler_init class.
See the <a href="https://www.threadingbuildingblocks.org/documentation">TBB documentation</a>
See the <a href="https://software.intel.com/content/www/us/en/develop/documentation/onetbb-documentation/top.html">TBB documentation</a>
for more details.
\section Mesh_3_section_io Input/Output

View File

@ -37,7 +37,7 @@ class Index_generator {
static int get_unique_index()
{
// initialized with 0
// http://en.cppreference.com/w/cpp/language/zero_initialization
// https://en.cppreference.com/w/cpp/language/zero_initialization
#ifdef CGAL_NO_ATOMIC
static int unique;
#else

View File

@ -742,9 +742,9 @@ Comparison between different sizes of neighbor radius.
\subsubsection Point_set_processing_3WLOP_parallel_performance Parallel Performance
A parallel version of WLOP is provided and requires the executable to be linked against the
<a href="https://www.threadingbuildingblocks.org">Intel TBB library</a>.
<a href="https://github.com/oneapi-src/oneTBB">Intel TBB library</a>.
To control the number of threads used, the user may use the tbb::task_scheduler_init class.
See the <a href="https://www.threadingbuildingblocks.org/documentation">TBB documentation</a>
See the <a href="https://software.intel.com/content/www/us/en/develop/documentation/onetbb-documentation/top.html">TBB documentation</a>
for more details. We provide below a speed-up chart generated using the parallel version of the WLOP algorithm. The machine used is a PC running Windows 7 64-bits with a 4-core i7-4700HQ@2.40GHz CPU with 8GB of RAM.
\cgalFigureBegin{Point_set_processing_3figWLOP_parallel_performance, parallel_WLOP_performance.jpg}
@ -787,9 +787,9 @@ Comparison for two smoothing methods: Left: Input, 250K points, normal-color map
Performance:
A parallel version of bilateral smoothing is provided and requires the executable to be linked against the
<a href="https://www.threadingbuildingblocks.org">Intel TBB library</a>.
<a href="https://github.com/oneapi-src/oneTBB">Intel TBB library</a>.
The number of threads used is controlled through the tbb::task_scheduler_init class.
See the <a href="https://www.threadingbuildingblocks.org/documentation">TBB documentation</a> for more details. We provide below a speed-up chart generated using the parallel version of the bilateral smoothing algorithm. The machine used is a PC running Windows 7 64-bits with a 4-core i7-4700HQ@2.40GHz CPU with 8GB of RAM.
See the <a href="https://software.intel.com/content/www/us/en/develop/documentation/onetbb-documentation/top.html">TBB documentation</a> for more details. We provide below a speed-up chart generated using the parallel version of the bilateral smoothing algorithm. The machine used is a PC running Windows 7 64-bits with a 4-core i7-4700HQ@2.40GHz CPU with 8GB of RAM.
\cgalFigureBegin{Point_set_processing_3Bilateral_smoothing_parallel_performance, parallel_bilateral_smooth_point_set_performance.jpg}
Parallel bilateral smoothing speed-up, compared to the sequential version of the algorithm.

View File

@ -178,9 +178,9 @@ compute_max_spacing(
For more details, please see section 4 in \cgalCite{ear-2013}.
A parallel version of this function is provided and requires the executable to be
linked against the <a href="https://www.threadingbuildingblocks.org">Intel TBB library</a>.
linked against the <a href="https://github.com/oneapi-src/oneTBB">Intel TBB library</a>.
To control the number of threads used, the user may use the tbb::task_scheduler_init class.
See the <a href="https://www.threadingbuildingblocks.org/documentation">TBB documentation</a>
See the <a href="https://software.intel.com/content/www/us/en/develop/documentation/onetbb-documentation/top.html">TBB documentation</a>
for more details.
\pre Normals must be unit vectors

View File

@ -341,9 +341,9 @@ compute_density_weight_for_sample_point(
For more details, please refer to \cgalCite{wlop-2009}.
A parallel version of WLOP is provided and requires the executable to be
linked against the <a href="https://www.threadingbuildingblocks.org">Intel TBB library</a>.
linked against the <a href="https://github.com/oneapi-src/oneTBB">Intel TBB library</a>.
To control the number of threads used, the user may use the tbb::task_scheduler_init class.
See the <a href="https://www.threadingbuildingblocks.org/documentation">TBB documentation</a>
See the <a href="https://software.intel.com/content/www/us/en/develop/documentation/onetbb-documentation/top.html">TBB documentation</a>
for more details.
\tparam ConcurrencyTag enables sequential versus parallel algorithm. Possible values are `Sequential_tag`,

View File

@ -1064,9 +1064,9 @@ double approximate_Hausdorff_distance(
* `tm1` and `np1` as parameter.
*
* A parallel version is provided and requires the executable to be
* linked against the <a href="https://www.threadingbuildingblocks.org">Intel TBB library</a>.
* linked against the <a href="https://github.com/oneapi-src/oneTBB">Intel TBB library</a>.
* To control the number of threads used, the user may use the `tbb::task_scheduler_init` class.
* See the <a href="https://www.threadingbuildingblocks.org/documentation">TBB documentation</a>
* See the <a href="https://software.intel.com/content/www/us/en/develop/documentation/onetbb-documentation/top.html">TBB documentation</a>
* for more details.
*
* @tparam Concurrency_tag enables sequential versus parallel algorithm.

View File

@ -209,7 +209,7 @@ The current implementation incorporates two open source solvers: \ref thirdparty
with reasonably simple structure.
In case you are reconstructing more complex objects, you may need to consider more efficient open source
solvers (e.g., <a href = "https://projects.coin-or.org/Cbc">CBC</a>) or even commercial solvers (e.g.,
<a href = "http://www.gurobi.com/">Gurobi</a>, <a href = "https://www.ibm.com/analytics/cplex-optimizer">CPLEX</a>).
<a href = "https://www.gurobi.com/">Gurobi</a>, <a href = "https://www.ibm.com/analytics/cplex-optimizer">CPLEX</a>).
The following table gives a rough idea of the performance of some solvers.
| Model | Problem Size <br>variables/constraints | Gurobi | CBC | SCIP | GLPK | LP_SOLVE |

View File

@ -135,7 +135,7 @@ namespace cpp98 {
/*!
\ingroup STLAlgos
Replacement for <a href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle">`std::random_shuffle()`</a>
Replacement for <a href="https://en.cppreference.com/w/cpp/algorithm/random_shuffle">`std::random_shuffle()`</a>
which was deprecated in C++14, and removed by C++17.
In the \stl it was replaced by `std::shuffle()`.
@ -149,7 +149,7 @@ random_shuffle(RandomAccessIterator begin, RandomAccessIterator end,
/*!
\ingroup STLAlgos
Replacement for <a href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle">`std::random_shuffle()`</a>
Replacement for <a href="https://en.cppreference.com/w/cpp/algorithm/random_shuffle">`std::random_shuffle()`</a>
which was deprecated in C++14, and removed by C++17.
In the \stl it was replaced by `std::shuffle()`.

View File

@ -98,7 +98,7 @@ The class `Concurrent_compact_container<T, Allocator>`
provides the same features, but enables concurrency-safe
`insert` and `erase` operations. Other operations are not concurrency-safe.
It requires the program to be linked against
the <a href="https://www.threadingbuildingblocks.org">Intel TBB library</a>.
the <a href="https://github.com/oneapi-src/oneTBB">Intel TBB library</a>.
\section stl_multi Multiset with Extended Functionality

View File

@ -24,7 +24,7 @@ we provide models using \ref thirdpartySCIP and \ref thirdpartyGLPK
libraries. It is also possible to derive new models from other
high performance libraries, e.g.,
<a href = "https://projects.coin-or.org/Cbc"> CBC </a>,
<a href = "http://www.gurobi.com/"> Gurobi </a>.
<a href = "https://www.gurobi.com/"> Gurobi </a>.

View File

@ -274,7 +274,7 @@ namespace CGAL {
/// `CGAL::SCIP_mixed_integer_program_traits`. Alternatively, use
/// `CGAL::Mixed_integer_program_traits` as a base to derive a new model
/// (using e.g., <a href = "https://projects.coin-or.org/Cbc"> CBC </a>,
/// <a href = "http://www.gurobi.com/"> Gurobi </a> for better
/// <a href = "https://www.gurobi.com/"> Gurobi </a> for better
/// performance).
///
/// \cond SKIP_IN_MANUAL

View File

@ -414,7 +414,7 @@ branches of each internal node can be computed in parallel, by calling
`Kd_tree::build<CGAL::Parallel_tag>()`. On a quad-core processor, the
parallel construction is experimentally 2 to 3 times faster than the
sequential version, depending on the point cloud. The parallel version
requires the executable to be linked against the <a href="https://www.threadingbuildingblocks.org">Intel TBB library</a>.
requires the executable to be linked against the <a href="https://github.com/oneapi-src/oneTBB">Intel TBB library</a>.
One query on the `kd` tree is purely sequential, but several queries
can be done in parallel.

View File

@ -370,7 +370,7 @@ The `3MF`, using the file extension `.3mf`, is an open source file format create
It is an XML-based format that aims to enhance the \ref IOStreamSTL by adding means to include
extra information such as colors.
A precise specification of the format is available at <a href="http://www.3mf.io/specification/">3mf.io</a>;
A precise specification of the format is available at <a href="https://3mf.io/specification/">3mf.io</a>;
note that only versions `1.x` are currently supported in \cgal.
<table class="iotable">

View File

@ -405,7 +405,7 @@ and when iterating over elements they will not be enumerated in the insertion or
\section sectionSurfaceMeshHistory Implementation History
This package is derived from an early version of Daniel Sieger and Mario Botsch package
<a href="http://graphics.uni-bielefeld.de/publications/imr11/"><em>%Surface_mesh</em></a>
<a href="https://graphics.uni-bielefeld.de/publications/imr11/"><em>%Surface_mesh</em></a>
\cgalCite{sieger2011design},
which is inspired from the design of <a href="https://www.openmesh.org/">OpenMesh</a> and the \cgal package
\ref PkgPolyhedron.

View File

@ -411,9 +411,9 @@ range of points will be performed in parallel, and the individual
insert/remove operations will be optionally thread-safe.
Parallel algorithms require the program to be linked against
the <a href="https://www.threadingbuildingblocks.org">Intel TBB library</a>.
the <a href="https://github.com/oneapi-src/oneTBB">Intel TBB library</a>.
To control the number of threads used, the user may use the tbb::task_scheduler_init class.
See the <a href="https://www.threadingbuildingblocks.org/documentation">TBB documentation</a>
See the <a href="https://software.intel.com/content/www/us/en/develop/documentation/onetbb-documentation/top.html">TBB documentation</a>
for more details.
\section Triangulation3secexamples Examples