songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #7115 from MaelRL/T3-test_cleaning-GF 

(Partial) Cleaning of Triangulation_3 tests

# Conflicts:
#	Kernel_23/include/CGAL/Kernel/interface_macros.h
This commit is contained in:
Laurent Rineau 2022-12-13 15:24:38 +01:00
parent b240dbab67 ecced44ee7
commit 20c67be903
512 changed files with 10452 additions and 8991 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
.github/install.sh vendored
View File

@ -1,5 +1,4 @@
#!/bin/bash
sudo add-apt-repository ppa:mikhailnov/pulseeffects -y
sudo apt-get update
sudo apt-get install -y libmpfr-dev \
libeigen3-dev qtbase5-dev libqt5sql5-sqlite libqt5opengl5-dev qtscript5-dev \

24
.github/workflows/build_doc.yml vendored
View File

@ -47,15 +47,7 @@ jobs:
//get pullrequest url
const pr_number = context.payload.issue.number
return pr_number
- uses: actions/checkout@v3
name: "checkout branch"
if: steps.get_round.outputs.result != 'stop'
with:
repository: ${{ github.repository }}
ref: refs/pull/${{ steps.get_pr_number.outputs.result }}/merge
token: ${{ secrets.PUSH_TO_CGAL_GITHUB_IO_TOKEN }}
fetch-depth: 2
- name: Emoji-comment
uses: actions/github-script@v6
if: steps.get_round.outputs.result != 'stop'
@ -67,6 +59,16 @@ jobs:
repo: context.repo.repo,
content: 'rocket'
})
- uses: actions/checkout@v3
name: "checkout branch"
if: steps.get_round.outputs.result != 'stop'
with:
repository: ${{ github.repository }}
ref: refs/pull/${{ steps.get_pr_number.outputs.result }}/merge
token: ${{ secrets.PUSH_TO_CGAL_GITHUB_IO_TOKEN }}
fetch-depth: 2
- name: install dependencies
if: steps.get_round.outputs.result != 'stop'
run: |
@ -151,11 +153,13 @@ jobs:
});
- name: Post error
env:
ERRORMSG: ${{steps.build_and_run.outputs.DoxygenError}}
uses: actions/github-script@v6
if: ${{ failure() && steps.get_round.outputs.result != 'stop' }}
with:
script: |
const error = "${{steps.build_and_run.outputs.DoxygenError}}"
const error = process.env.ERRORMSG
const msg = "There was an error while building the doc: \n"+error
github.rest.issues.createComment({
owner: "CGAL",

4
AABB_tree/demo/AABB_tree/resources/about.html
View File

@ -2,8 +2,8 @@
<body>
<h2>AABB Tree Demo</h2>
<p>Copyright &copy;2009
<a href="http://www-sop.inria.fr/">INRIA Sophia Antipolis - Mediterranee<a/></p>
<p>This application illustrates the AABB tree component
<a href="https://www.inria.fr/fr/centre-inria-universite-cote-azur">INRIA Sophia Antipolis - Mediterranee<a/></p>
<p>This application illustrates the AABB tree component
of <a href="https://www.cgal.org/">CGAL</a>, applied to polyhedron
facets and edges.</p>
<p>See also the following chapters of the manual:

168
Advancing_front_surface_reconstruction/include/CGAL/Advancing_front_surface_reconstruction.h
View File

@ -370,19 +370,19 @@ namespace CGAL {
coord_type K, min_K;
const coord_type eps;
const coord_type inv_eps_2; // 1/(eps^2)
const coord_type eps_3; // test de ^3 donc points tel 1e-7 soit petit
const coord_type eps_3; // tests using cubed eps so points such that 1e-7 is small
const criteria STANDBY_CANDIDATE;
const criteria STANDBY_CANDIDATE_BIS;
const criteria NOT_VALID_CANDIDATE;
//---------------------------------------------------------------------
//Pour une visu correcte
//pour retenir les facettes selectionnees
// For a correct visualization
// to retain the selected facets
int _vh_number;
int _facet_number;
//---------------------------------------------------------------------
//Pour le post traitement
// For post-processing
mutable int _postprocessing_counter;
int _size_before_postprocessing;
@ -501,9 +501,8 @@ namespace CGAL {
}
//-------------------------------------------------------------------
// pour gerer certaines aretes interieures: a savoir celle encore connectee au
// bord (en fait seule, les aretes interieures reliant 2 bords nous
// interressent...)
// to handle certain interior edges, meaning those still connected to the boundary
// (actually, only the interior edges linking two boundaries are relevant)
inline void set_interior_edge(Vertex_handle w, Vertex_handle v)
{
@ -806,7 +805,7 @@ namespace CGAL {
if ((number_of_facets() > static_cast<int>(T.number_of_vertices()))&&
(NB_BORDER_MAX > 0))
// en principe 2*nb_sommets = nb_facettes: y a encore de la marge!!!
// in theory 2*vertices_n = facets_n: plenty of room!!!
{
while(postprocessing()){
extend2_timer.start();
@ -1068,9 +1067,8 @@ namespace CGAL {
//---------------------------------------------------------------------
bool is_interior_edge(const Edge_like& key) const
// pour gerer certaines aretes interieures: a savoir celle encore connectee au
// bord (en fait seule, les aretes interieures reliant 2 bords nous
// interressent...)
// to handle certain interior edges, meaning those still connected to the boundary
// (actually, only the interior edges linking two boundaries are relevant)
{
return (is_interior_edge(key.first, key.second)||
is_interior_edge(key.second, key.first));
@ -1299,7 +1297,6 @@ namespace CGAL {
#ifdef AFSR_LAZY
value = lazy_squared_radius(cc);
#else
// qualified with CGAL, to avoid a compilation error with clang
if(volume(pp0, pp1, pp2, pp3) != 0){
value = T.geom_traits().compute_squared_radius_3_object()(pp0, pp1, pp2, pp3);
} else {
@ -1337,7 +1334,6 @@ namespace CGAL {
{
value = compute_scalar_product(Vc, Vc) - ac*ac/norm_V;
if ((value < 0)||(norm_V > inv_eps_2)){
// qualified with CGAL, to avoid a compilation error with clang
value = T.geom_traits().compute_squared_radius_3_object()(cp1, cp2, cp3);
}
}
@ -1365,7 +1361,7 @@ namespace CGAL {
/// @}
//---------------------------------------------------------------------
// For a border edge e we determine the incident facet which has the highest
// For a border edge e, we determine the incident facet which has the highest
// chance to be a natural extension of the surface
Radius_edge_type
@ -1425,8 +1421,7 @@ namespace CGAL {
P2Pn = construct_vector(p2, pn);
v2 = construct_cross_product(P2P1,P2Pn);
//pas necessaire de normer pour un bon echantillon:
// on peut alors tester v1*v2 >= 0
// no need to normalize for a correct sampling: one can then test v1*v2 >= 0
norm = sqrt(norm1 * compute_scalar_product(v2,v2));
pscal = v1*v2;
// check if the triangle will produce a sliver on the surface
@ -1437,7 +1432,8 @@ namespace CGAL {
if (tmp < min_valueA)
{
PnP1 = p1-pn;
// DELTA represente la qualite d'echantillonnage du bord
// DELTA encodes the quality of the border sampling
//
// We skip triangles having an internal angle along e
// whose cosinus is smaller than -DELTA
// that is the angle is larger than arcos(-DELTA)
@ -1462,37 +1458,36 @@ namespace CGAL {
if ((min_valueA == infinity()) || border_facet) // bad facets case
{
min_facet = Facet(c, i); // !!! sans aucune signification....
value = NOT_VALID_CANDIDATE; // Attention a ne pas inserer dans PQ
min_facet = Facet(c, i); // !!! without any meaning....
value = NOT_VALID_CANDIDATE; // Do not insert in the PQ
}
else
{
min_facet = min_facetA;
//si on considere seulement la pliure value appartient a [0, 2]
//value = coord_type(1) - min_valueP;
// si la pliure est bonne on note suivant le alpha sinon on prend en compte la
// pliure seule... pour discriminer entre les bons slivers...
// si on veut discriminer les facettes de bonnes pliures plus finement
// alors -(1+1/min_valueA) app a [-inf, -1]
// -min_valueP app a [-1, 1]
// If we only consider the fold value belongs to [0, 2]
// value = coord_type(1) - min_valueP;
// If the fold is OK, we rate based on the alpha value. Otherwise, take only the fold into account
// to discriminate between good slivers.
//
// If we wish to discriminate the facets with good folds more finely,
// then:
// -(1+1/min_valueA) is within [-inf, -1]
// -min_valueP is within [-1, 1]
//
if (min_valueP > COS_BETA)
value = -(coord_type(1) + coord_type(1)/min_valueA);
else
{
//on refuse une trop grande non-uniformite
// reject overly non-uniform values
coord_type tmp = priority (*this, c, i);
if (min_valueA <= K * tmp)
value = - min_valueP;
else
{
value = STANDBY_CANDIDATE; // tres mauvais candidat mauvaise pliure
// + grand alpha... a traiter plus tard....
min_K =
(std::min)(min_K,
min_valueA/tmp);
value = STANDBY_CANDIDATE; // extremely bad candidate, bad fold + large alpha; handle later
min_K = (std::min)(min_K, min_valueA/tmp);
}
}
}
@ -1597,7 +1592,7 @@ namespace CGAL {
}
//---------------------------------------------------------------------
// test de reciprocite avant de recoller une oreille anti-singularite
// reciprocity test before glueing anti-singularity ear
int
test_merge(const Edge_like& ordered_key, const Border_elt& result,
const Vertex_handle& v, const coord_type& ear_alpha)
@ -1622,12 +1617,12 @@ namespace CGAL {
coord_type norm = sqrt(compute_scalar_product(v1, v1) * compute_scalar_product(v2, v2));
if (v1*v2 > COS_BETA*norm)
return 1; // label bonne pliure sinon:
return 1; // mark as good fold
if (ear_alpha <= K * priority(*this, neigh, n_ind))
return 2; // label alpha coherent...
return 2; // mark alpha consistent
return 0; //sinon oreille a rejeter...
return 0; // ear to be rejected
}
@ -1753,7 +1748,7 @@ namespace CGAL {
Edge_like ordered_key(v1,v2);
if (!is_border_elt(ordered_key, result12))
std::cerr << "+++probleme coherence bord <validate>" << std::endl;
std::cerr << "+++issue with border consistency <validate>" << std::endl;
bool is_border_el1 = is_border_elt(ordered_el1, result1),
is_border_el2 = is_border_elt(ordered_el2, result2);
@ -1782,8 +1777,7 @@ namespace CGAL {
return FINAL_CASE;
}
//---------------------------------------------------------------------
//on peut alors marquer v1 et on pourrait essayer de merger
//sans faire de calcul inutile???
// we can then mark v1 and could try to merge without any useless computation???
if (is_border_el1)
{
Edge_incident_facet edge_Ifacet_2(Edge(c, i, edge_Efacet.first.third),
@ -1796,7 +1790,7 @@ namespace CGAL {
return EAR_CASE;
}
//---------------------------------------------------------------------
//idem pour v2
//idem for v2
if (is_border_el2)
{
Edge_incident_facet edge_Ifacet_1(Edge(c, i, edge_Efacet.first.second),
@ -1852,9 +1846,9 @@ namespace CGAL {
// border incident to a point... _mark<1 even if th orientation
// may be such as one vh has 2 successorson the same border...
{
// a ce niveau on peut tester si le recollement se fait en
// maintenant la compatibilite d'orientation des bords (pour
// surface orientable...) ou si elle est brisee...
// at this level, we can test if glueing can be done while keeping
// compatible orientations for the borders (for an orientable surface...)
// or if it is broken
Edge_incident_facet edge_Ifacet_1(Edge(c, i, edge_Efacet.first.second),
edge_Efacet.second);
Edge_incident_facet edge_Ifacet_2(Edge(c, i, edge_Efacet.first.third),
@ -1884,8 +1878,8 @@ namespace CGAL {
Border_elt result_ear2;
Edge_like ear1_e, ear2_e;
// pour maintenir la reconstruction d'une surface orientable :
// on verifie que les bords se recollent dans des sens opposes
// to preserve the reconstruction of an orientable surface, we check that
// borders glue to one another in opposite directions
if (ordered_key.first==v1)
{
ear1_e = Edge_like(c->vertex(i), ear1_c ->vertex(ear1_i));
@ -1897,7 +1891,7 @@ namespace CGAL {
ear2_e = Edge_like(c->vertex(i), ear2_c ->vertex(ear2_i));
}
//maintient la surface orientable
// preserves orientability of the surface
bool is_border_ear1 = is_ordered_border_elt(ear1_e, result_ear1);
bool is_border_ear2 = is_ordered_border_elt(ear2_e, result_ear2);
bool ear1_valid(false), ear2_valid(false);
@ -1931,8 +1925,7 @@ namespace CGAL {
{
Validation_case res = validate(ear1, e1.first);
if (!((res == EAR_CASE)||(res == FINAL_CASE)))
std::cerr << "+++probleme de recollement : cas "
<< res << std::endl;
std::cerr << "+++issue in glueing: case " << res << std::endl;
e2 = compute_value(edge_Ifacet_2);
if (ordered_key.first == v1)
@ -1948,8 +1941,7 @@ namespace CGAL {
{
Validation_case res = validate(ear2, e2.first);
if (!((res == EAR_CASE)||(res == FINAL_CASE)))
std::cerr << "+++probleme de recollement : cas "
<< res << std::endl;
std::cerr << "+++issue in glueing : case " << res << std::endl;
e1 = compute_value(edge_Ifacet_1);
if (ordered_key.first == v1)
@ -1962,25 +1954,23 @@ namespace CGAL {
_ordered_border.insert(Radius_ptr_type(e1.first, p1));
}
}
else// les deux oreilles ne se recollent pas sur la meme arete...
else // both ears do not glue on the same edge
{
// on resoud la singularite.
// resolve the singularity
if (ear1_valid)
{
Validation_case res = validate(ear1, e1.first);
if (!((res == EAR_CASE)||(res == FINAL_CASE)))
std::cerr << "+++probleme de recollement : cas "
<< res << std::endl;
std::cerr << "+++issue in glueing: case " << res << std::endl;
}
if (ear2_valid)
{
Validation_case res = validate(ear2, e2.first);
if (!((res == EAR_CASE)||(res == FINAL_CASE)))
std::cerr << "+++probleme de recollement : cas "
<< res << std::endl;
std::cerr << "+++issue in glueing : case " << res << std::endl;
}
// on met a jour la PQ s'il y a lieu... mais surtout pas
// avant la resolution de la singularite
// Update the PQ if needed, but not before resolving the singularity
if (!ear1_valid)
{
_ordered_border.insert(Radius_ptr_type(e1.first, p1));
@ -2020,7 +2010,7 @@ namespace CGAL {
if (new_candidate.first == STANDBY_CANDIDATE)
{
// a garder pour un K un peu plus grand...
// put aside for a slightly larger K
new_candidate.first = STANDBY_CANDIDATE_BIS;
}
@ -2042,8 +2032,8 @@ namespace CGAL {
void
extend()
{
// initilisation de la variable globale K: qualite d'echantillonnage requise
K = K_init; // valeur d'initialisation de K pour commencer prudemment...
// Initialize the global variable K: required sampling quality
K = K_init; // initial value of K to start carefully
coord_type K_prev = K;
Vertex_handle v1, v2;
@ -2052,7 +2042,7 @@ namespace CGAL {
}
do
{
min_K = infinity(); // pour retenir le prochain K necessaire pour progresser...
min_K = infinity(); // to store the next K required to progress
do
{
@ -2095,7 +2085,7 @@ namespace CGAL {
{
new_candidate = compute_value(mem_Ifacet);
if ((new_candidate != mem_e_it))
// &&(new_candidate.first < NOT_VALID_CANDIDATE))
// &&(new_candidate.first < NOT_VALID_CANDIDATE))
{
IO_edge_type* pnew =
set_again_border_elt(key_tmp.first, key_tmp.second,
@ -2111,8 +2101,7 @@ namespace CGAL {
(_ordered_border.begin()->first < STANDBY_CANDIDATE_BIS));
K_prev = K;
K += (std::max)(K_step, min_K - K + eps);
// on augmente progressivement le K mais on a deja rempli sans
// faire des betises auparavant...
// Progressively increase K, but having already filled without issue beforehand
}
while((!_ordered_border.empty())&&(K <= K)&&(min_K != infinity())&&(K!=K_prev));
@ -2125,9 +2114,8 @@ namespace CGAL {
//---------------------------------------------------------------------
// En principe, si l'allocateur de cellules etait bien fait on aurait pas besoin
// de mettre a jour les valeurs rajoutees pour les cellules a la main...
// In theory, if the cell allocator were properly made, one would not need to manually update
// the values added for the cells
void
re_init_for_free_cells_cache(const Vertex_handle& vh)
{
@ -2152,9 +2140,8 @@ namespace CGAL {
int index = c->index(vh);
Cell_handle neigh = c->neighbor(index);
int n_ind = neigh->index(c);
neigh->set_smallest_radius(n_ind, -1); // pour obliger le recalcul
// si c est selectionnee c'est qu'elle est aussi le mem_IFacet renvoye par
// compute_value... donc a swapper aussi
neigh->set_smallest_radius(n_ind, -1); // forces recomputation
// if c is selected, then it is also the mem_IFacet returned by compute_value... so to be swapped too
if (c->is_selected_facet(index))
{
int fn = c->facet_number(index);
@ -2214,8 +2201,8 @@ namespace CGAL {
circ = next(circ);
}
while(circ.first.first != c);
// si on passe par la, alors y a eu un probleme....
std::cerr << "+++probleme dans la MAJ avant remove..." << std::endl;
// if we are here, something went wrong
std::cerr << "+++issue in the update before removal..." << std::endl;
return Facet(c, start.second);
}
@ -2237,7 +2224,7 @@ namespace CGAL {
ordered_map_erase(border_elt.second.first.first,
border_IO_elt(vh, vh_succ));
remove_border_edge(vh, vh_succ);
// 1- a virer au cas ou car vh va etre detruit
// 1- remove just in case since vh is about to be destroyed
remove_interior_edge(vh_succ, vh);
bool while_cond(true);
do
@ -2266,14 +2253,14 @@ namespace CGAL {
{
ordered_map_erase(result.first.first, border_IO_elt(vh_int, vh));
remove_border_edge(vh_int, vh);
// 1- a virer au cas ou car vh va etre detruit
// 1- remove just in case since vh is about to be destroyed
remove_interior_edge(vh_int, vh);
while_cond = false;
}
// a titre preventif... on essaye de s'assurer de marquer les aretes
// interieures au sens large...
// 2- a virer a tout pris pour que maintenir le sens de interior edge
// As a preventive measure, we try to ensure marking the interior edges in a broad sense
// 2- remove to preserve the interior edge
remove_interior_edge(vh_int, vh_succ);
remove_interior_edge(vh_succ, vh_int);
@ -2304,16 +2291,16 @@ namespace CGAL {
bool
create_singularity(const Vertex_handle& vh)
{
// Pour reperer le cas de triangle isole
// To detect the isolated triangle case
if (vh->is_on_border())
{
// vh sommet 0
// vh vertex 0
Next_border_elt border_elt = *(vh->first_incident());
Vertex_handle vh_1 = border_elt.first;// sommet 1
Vertex_handle vh_1 = border_elt.first;// vertex 1
border_elt = *(vh_1->first_incident());
Vertex_handle vh_2 = border_elt.first;// sommet 2
Vertex_handle vh_2 = border_elt.first;// vertex 2
border_elt = *(vh_2->first_incident());
Vertex_handle vh_3 = border_elt.first;// sommet 0 ???
Vertex_handle vh_3 = border_elt.first;// vertex 0 ???
Cell_handle c;
int i, j, k;
if ((vh_3 == vh)&&(T.is_facet(vh, vh_1, vh_2, c, i ,j ,k)))
@ -2328,7 +2315,7 @@ namespace CGAL {
}
// Reperer le cas d'aretes interieures...
// Detect the interior edges case
std::list<Vertex_handle> vh_list;
T.incident_vertices(vh, std::back_inserter(vh_list));
@ -2402,9 +2389,9 @@ namespace CGAL {
std::list<Vertex_handle> L_v;
// Pour controler les sommets choisis sur le bord...
// To control vertices chosen on the boundary
// nombre d'aretes a partir duquel on considere que c'est irrecuperable NB_BORDER_MAX
// NB_BORDER_MAX: number of edges from which we consider that things are irrecoverable
int vh_on_border_inserted(0);
for(Finite_vertices_iterator v_it = T.finite_vertices_begin();
@ -2445,7 +2432,7 @@ namespace CGAL {
std::size_t itmp, L_v_size_mem;
L_v_size_mem = L_v.size();
if ((vh_on_border_inserted != 0)&& // pour ne post-traiter que les bords
if ((vh_on_border_inserted != 0)&& // to post-process only the borders
(L_v.size() < .1 * _size_before_postprocessing))
{
{
@ -2460,7 +2447,7 @@ namespace CGAL {
}
#ifdef VERBOSE
if(L_v.size() > 0){
std::cout << " " << L_v.size() << " non regular points." << std::endl;
std::cout << " " << L_v.size() << " non-regular points." << std::endl;
}
#endif // VERBOSE
re_compute_values();
@ -2469,7 +2456,7 @@ namespace CGAL {
postprocess_timer.stop();
return false;
}
// we stop if we removed more than 10% of points or after 20 rounds
// we stop if we removed more than 10% of points, or after 20 rounds
if ((L_v_size_mem == L_v.size())||
((_size_before_postprocessing - T.number_of_vertices()) >
.1 * _size_before_postprocessing)||
@ -2479,7 +2466,6 @@ namespace CGAL {
}
min_K = infinity();
// fin--
// if (_postprocessing_counter < 5)
// return true;
postprocess_timer.stop();

2
Advancing_front_surface_reconstruction/include/CGAL/Advancing_front_surface_reconstruction_vertex_base_3.h
View File

@ -220,7 +220,7 @@ namespace CGAL {
else
{
if (m_incident_border->second->first != nullptr)
std::cerr << "+++probleme de MAJ du bord <Vertex_base>" << std::endl;
std::cerr << "+++issue while updating border <Vertex_base>" << std::endl;
*m_incident_border->second = elt;
}
}

6
Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
View File

@ -356,10 +356,10 @@ public:
const OuterFunctor& outer)
: _inner(inner), _outer(outer) {}
Unary_compose(const Unary_compose& other)
: _inner(other._inner), _outer(other._outer) {}
Unary_compose(const Unary_compose& other) = default;
Unary_compose& operator=(const Unary_compose& other) = default;
Unary_compose() : _inner(::boost::none),_outer(::boost::none) {}
Unary_compose() : _inner(::boost::none),_outer(::boost::none) {}
typedef typename InnerFunctor::argument_type argument_type;
typedef typename OuterFunctor::result_type result_type;

2
Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_quadratic_refinement_rep_bfi.h
View File

@ -45,7 +45,7 @@ namespace internal {
* @Unpublished{abbott-quadratic,
* author = {John Abbott},
* title = {Quadratic Interval Refinement for Real Roots},
* url = {http://www.dima.unige.it/~abbott/},
* url = {https://www.dima.unige.it/~abbott/},
* note = {Poster presented at the 2006 Internat. Sympos. on Symbolic
and Algebraic Computation (ISSAC 2006)}
* }

4
Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes.h
View File

@ -1147,8 +1147,8 @@ public:
Bitstream_descartes() : Base(new Rep()) {}
//! Copy constructor
Bitstream_descartes(const Self& other) : Base(static_cast<const Base&>(other))
{}
Bitstream_descartes(const Self& other) = default;
Bitstream_descartes& operator=(const Self& other) = default;
/*!
* \brief Constructor for a polynomial \c f

5
Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes_E08_tree.h
View File

@ -436,6 +436,9 @@ public:
friend class CGAL::internal::Bitstream_descartes_E08_tree<TRAITS>;
friend class CGAL::internal::Bitstream_descartes_E08_tree_rep<TRAITS>;
Bitstream_descartes_E08_node(const Self&) = default;
Self& operator= (const Self&) = delete;
private:
// "node data" (set individually in subdivision)
Integer lower_num_, upper_num_; // TODO use lower_num_, width_num_ instead
@ -466,8 +469,6 @@ private:
log_eps_ = n.log_eps_;
log_C_eps_ = n.log_C_eps_;
}
Self& operator= (const Self&) = delete;
}; // struct Bitstream_descartes_E08_node

5
Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes_rndl_tree.h
View File

@ -525,6 +525,9 @@ public:
friend class internal::Bitstream_descartes_rndl_tree<TRAITS>;
friend class internal::Bitstream_descartes_rndl_tree_rep<TRAITS>;
Bitstream_descartes_rndl_node(const Self&) = default;
Self& operator= (const Self&) = delete;
private:
// "node data" (set individually in subdivision)
Integer lower_num_, upper_num_; // TODO use lower_num_, width_num_ instead
@ -557,8 +560,6 @@ private:
log_eps_ = n.log_eps_;
log_C_eps_ = n.log_C_eps_;
}
Self& operator= (const Self&)=delete;
}; // struct Bitstream_descartes_rndl_node

6
Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_real_root_isolator.h
View File

@ -187,7 +187,7 @@ void test_real_root_isolator() {
assert( n == number_of_roots);
}{
//std::cout << "Kameny 3\n";
// from http://www-sop.inria.fr/saga/POL/BASE/1.unipol
// from https://www-sop.inria.fr/saga/POL/BASE/1.unipol/
NT c = CGAL::ipower(NT(10),12);
Polynomial P(NT(-3),NT(0),c);
@ -202,7 +202,7 @@ void test_real_root_isolator() {
assert(3 == internal::check_intervals_real_root_isolator<Isolator>(P));
}{
//std::cout << "Kameny 4\n";
// from http://www-sop.inria.fr/saga/POL/BASE/1.unipol
// from https://www-sop.inria.fr/saga/POL/BASE/1.unipol
NT z(0);
NT a = CGAL::ipower(NT(10),24); // a = 10^{24}
@ -218,7 +218,7 @@ void test_real_root_isolator() {
assert( 4 == internal::check_intervals_real_root_isolator<Isolator>(P));
}{
//std::cout << "Polynomial with large and small clustered roots\n";
// from http://www-sop.inria.fr/saga/POL/BASE/1.unipol
// from https://www-sop.inria.fr/saga/POL/BASE/1.unipol
// there seems to be some error or misunderstanding
NT z(0);

4
Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ColorItemEditor.cpp
View File

@ -19,7 +19,7 @@
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
** will be met: https://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
@ -31,7 +31,7 @@
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
** met: https://www.gnu.org/licenses/gpl-3.0.html.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.

4
Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ColorItemEditor.h
View File

@ -19,7 +19,7 @@
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
** will be met: https://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
@ -31,7 +31,7 @@
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
** met: https://www.gnu.org/licenses/gpl-3.0.html.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.

42
Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_trapezoid_ric_pl_impl.h
View File

@ -316,7 +316,7 @@ _vertical_ray_shoot(const Point_2& p, bool shoot_up) const
// face) we check the isolated vertices inside the face to check whether there
// is an isolated vertex right above/below the query point.
//
template <class Arrangement>
template <typename Arrangement>
typename Arr_trapezoid_ric_point_location<Arrangement>::result_type
Arr_trapezoid_ric_point_location<Arrangement>::
_check_isolated_for_vertical_ray_shoot (Halfedge_const_handle halfedge_found,
@ -324,40 +324,36 @@ _check_isolated_for_vertical_ray_shoot (Halfedge_const_handle halfedge_found,
bool shoot_up,
const Td_map_item& tr) const
{
const auto* gt = this->arrangement()->geometry_traits();
const Comparison_result point_above_under = (shoot_up ? SMALLER : LARGER);
typename Geometry_traits_2::Compare_x_2 compare_x =
this->arrangement()->traits()->compare_x_2_object();
typename Geometry_traits_2::Compare_xy_2 compare_xy =
this->arrangement()->traits()->compare_xy_2_object();
typename Geometry_traits_2::Compare_y_at_x_2 compare_y_at_x =
this->arrangement()->traits()->compare_y_at_x_2_object();
auto compare_x = gt->compare_x_2_object();
auto compare_xy = gt->compare_xy_2_object();
auto compare_y_at_x = gt->compare_y_at_x_2_object();
Isolated_vertex_const_iterator iso_verts_it;
Vertex_const_handle closest_iso_v;
const Vertex_const_handle invalid_v;
const Halfedge_const_handle invalid_he;
Face_const_handle face;
Vertex_const_handle closest_iso_v;
const Vertex_const_handle invalid_v;
const Halfedge_const_handle invalid_he;
// If the closest feature is a valid halfedge, take its incident face.
// Otherwise, take the unbounded face.
if (halfedge_found == invalid_he)
face = _get_unbounded_face(tr, p, All_sides_oblivious_category());
else
face = halfedge_found->face();
Face_const_handle face = (halfedge_found == invalid_he) ?
_get_unbounded_face(tr, p, All_sides_oblivious_category()) :
halfedge_found->face();
// Go over the isolated vertices in the face.
// The following statement pacifies MSVC. Without it the implicit conversion
// from the iterator to the corresponding handle fails!
Isolated_vertex_const_iterator iso_verts_it;
for (iso_verts_it = face->isolated_vertices_begin();
iso_verts_it != face->isolated_vertices_end(); ++iso_verts_it)
{
// The current isolated vertex should have the same x-coordinate as the
// query point in order to be below or above it.
if (compare_x (p, iso_verts_it->point()) != EQUAL)
continue;
if (compare_x (p, iso_verts_it->point()) != EQUAL) continue;
// Make sure the isolated vertex is above the query point (if we shoot up)
// or below it (if we shoot down).
if (compare_xy (p, iso_verts_it->point()) != point_above_under)
continue;
if (compare_xy (p, iso_verts_it->point()) != point_above_under) continue;
// Check if the current isolated vertex lies closer to the query point than
// the closest feature so far.
@ -379,12 +375,10 @@ _check_isolated_for_vertical_ray_shoot (Halfedge_const_handle halfedge_found,
// If we found an isolated vertex above (or under) the query point, return
// a handle to this vertex.
if (closest_iso_v != invalid_v)
return make_result(closest_iso_v);
if (closest_iso_v != invalid_v) return make_result(closest_iso_v);
// If we are inside the unbounded face, return this face.
if (halfedge_found == invalid_he)
return make_result(face);
if (halfedge_found == invalid_he) return make_result(face);
// Return the halfedge lying above (or below) the query point.
return make_result(halfedge_found);

2
Arrangement_on_surface_2/include/CGAL/Arr_polycurve_basic_traits_2.h
View File

@ -1114,7 +1114,7 @@ public:
// model of this concept.
//
// The following implementation is inspired by
// http://stackoverflow.com/a/11816999/1915421
// https://stackoverflow.com/a/11816999/1915421
template <typename T>
struct Void {

2
Arrangement_on_surface_2/include/CGAL/IO/Fig_stream.h
View File

@ -164,7 +164,7 @@ enum Fig_depth
/*!
* \class A class for writing geometric objects in a FIG format (version 3.2).
* For more details, see: http://www.xfig.org/userman/fig-format.html
* For more details, see: https://mcj.sourceforge.net/
*/
template <class Kernel_>
class Fig_stream

2
BGL/examples/BGL_LCC/normals_lcc.cpp
View File

@ -74,7 +74,7 @@ int main(int argc, char** argv)
// Ad hoc property_map to store normals. Face_index_map is used to
// map face_descriptors to a contiguous range of indices. See
// http://www.boost.org/libs/property_map/doc/vector_property_map.html
// https://www.boost.org/libs/property_map/doc/vector_property_map.html
// for details.
boost::vector_property_map<Vector, Face_index_map>
normals(static_cast<unsigned>(num_faces(lcc)), get(CGAL::face_index, lcc));

2
BGL/examples/BGL_polyhedron_3/normals.cpp
View File

@ -79,7 +79,7 @@ int main(int argc, char** argv)
// Ad hoc property_map to store normals. Face_index_map is used to
// map face_descriptors to a contiguous range of indices. See
// http://www.boost.org/libs/property_map/doc/vector_property_map.html
// https://www.boost.org/libs/property_map/doc/vector_property_map.html
// for details.
boost::vector_property_map<Vector, Face_index_map>
normals(static_cast<unsigned>(num_faces(P)), get(CGAL::face_index, P));

2
BGL/include/CGAL/boost/graph/graph_traits_PolyMesh_ArrayKernelT.h
View File

@ -11,7 +11,7 @@
#ifndef CGAL_BOOST_GRAPH_GRAPH_TRAITS_POLYMESH_ARRAYKERNELT_H
#define CGAL_BOOST_GRAPH_GRAPH_TRAITS_POLYMESH_ARRAYKERNELT_H
// http://openmesh.org/Documentation/OpenMesh-Doc-Latest/classOpenMesh_1_1Concepts_1_1KernelT.html
// https://www.graphics.rwth-aachen.de/media/openmesh_static/Documentations/OpenMesh-Doc-Latest/a02182.html
#include <OpenMesh/Core/IO/MeshIO.hh>
#include <CGAL/boost/graph/properties_PolyMesh_ArrayKernelT.h>
#include <OpenMesh/Core/Mesh/PolyMesh_ArrayKernelT.hh>

2
BGL/include/CGAL/boost/graph/graph_traits_TriMesh_ArrayKernelT.h
View File

@ -11,7 +11,7 @@
#ifndef CGAL_BOOST_GRAPH_GRAPH_TRAITS_TRIMESH_ARRAYKERNELT_H
#define CGAL_BOOST_GRAPH_GRAPH_TRAITS_TRIMESH_ARRAYKERNELT_H
// http://openmesh.org/Documentation/OpenMesh-Doc-Latest/classOpenMesh_1_1Concepts_1_1KernelT.html
// https://www.graphics.rwth-aachen.de/media/openmesh_static/Documentations/OpenMesh-Doc-Latest/a02182.html
#include <OpenMesh/Core/IO/MeshIO.hh>
#include <CGAL/boost/graph/properties_TriMesh_ArrayKernelT.h>
#include <OpenMesh/Core/Mesh/TriMesh_ArrayKernelT.hh>

6
BGL/include/CGAL/boost/graph/named_params_helper.h
View File

@ -335,10 +335,10 @@ struct Point_set_processing_3_np_helper
return parameters::choose_parameter<Geom_traits>(parameters::get_parameter(np, internal_np::geom_traits));
}
static constexpr bool has_normal_map()
static constexpr bool has_normal_map(const PointRange&, const NamedParameters&)
{
return !std::is_same< typename internal_np::Get_param<typename NamedParameters::base, internal_np::normal_t>::type,
internal_np::Param_not_found> ::value;
using CGAL::parameters::is_default_parameter;
return !(is_default_parameter<NamedParameters, internal_np::normal_t>::value);
}
};

37
BGL/include/CGAL/boost/graph/properties_OpenMesh.h
View File

@ -130,16 +130,16 @@ public:
};
template <typename OpenMesh>
template <typename OM_Mesh>
class OM_edge_weight_pmap
{
public:
typedef boost::readable_property_map_tag category;
typedef typename OpenMesh::Scalar value_type;
typedef typename OM_Mesh::Scalar value_type;
typedef value_type reference;
typedef typename boost::graph_traits<OpenMesh>::edge_descriptor key_type;
typedef typename boost::graph_traits<OM_Mesh>::edge_descriptor key_type;
OM_edge_weight_pmap(const OpenMesh& sm)
OM_edge_weight_pmap(const OM_Mesh& sm)
: sm_(sm)
{}
@ -151,7 +151,7 @@ public:
friend inline value_type get(const OM_edge_weight_pmap& m, const key_type& k) { return m[k]; }
private:
const OpenMesh& sm_;
const OM_Mesh& sm_;
};
template <typename K, typename VEF>
@ -175,26 +175,26 @@ public:
};
template<typename OpenMesh, typename P>
template<typename OM_Mesh, typename P>
class OM_point_pmap
{
public:
#if defined(CGAL_USE_OM_POINTS)
typedef boost::lvalue_property_map_tag category;
typedef typename OpenMesh::Point value_type;
typedef const typename OpenMesh::Point& reference;
typedef typename OM_Mesh::Point value_type;
typedef const typename OM_Mesh::Point& reference;
#else
typedef boost::read_write_property_map_tag category;
typedef P value_type;
typedef P reference;
#endif
typedef typename boost::graph_traits<OpenMesh>::vertex_descriptor key_type;
typedef typename boost::graph_traits<OM_Mesh>::vertex_descriptor key_type;
OM_point_pmap()
: sm_(nullptr)
{}
OM_point_pmap(const OpenMesh& sm)
OM_point_pmap(const OM_Mesh& sm)
: sm_(&sm)
{}
@ -208,36 +208,37 @@ public:
return sm_->point(v);
#else
CGAL_assertion(sm_!=nullptr);
typename OpenMesh::Point const& omp = sm_->point(v);
typename OM_Mesh::Point const& omp = sm_->point(v);
return value_type(omp[0], omp[1], omp[2]);
#endif
}
inline friend reference get(const OM_point_pmap<OpenMesh,P>& pm, key_type v)
inline friend reference get(const OM_point_pmap<OM_Mesh,P>& pm, key_type v)
{
CGAL_precondition(pm.sm_!=nullptr);
#if defined(CGAL_USE_OM_POINTS)
return pm.sm_->point(v);
#else
CGAL_assertion(pm.sm_!=nullptr);
typename OpenMesh::Point const& omp = pm.sm_->point(v);
typename OM_Mesh::Point const& omp = pm.sm_->point(v);
return value_type(omp[0], omp[1], omp[2]);
#endif
}
inline friend void put(const OM_point_pmap<OpenMesh,P>& pm, key_type v, const value_type& p)
inline friend void put(const OM_point_pmap<OM_Mesh,P>& pm, key_type v, const value_type& p)
{
CGAL_precondition(pm.sm_!=nullptr);
#if defined(CGAL_USE_OM_POINTS)
const_cast<OpenMesh&>(*pm.sm_).set_point(v,p);
const_cast<OM_Mesh&>(*pm.sm_).set_point(v,p);
#else
const_cast<OpenMesh&>(*pm.sm_).set_point
(v, typename OpenMesh::Point((float)p[0], (float)p[1], (float)p[2]));
typedef typename OpenMesh::vector_traits<typename OM_Mesh::Point>::value_type Scalar;
const_cast<OM_Mesh&>(*pm.sm_).set_point
(v, typename OM_Mesh::Point(Scalar(p[0]), Scalar(p[1]), Scalar(p[2])));
#endif
}
private:
const OpenMesh* sm_;
const OM_Mesh* sm_;
};
} // CGAL
#endif // CGAL_BOOST_GRAPH_PROPERTIES_OPENMESH_H

2
BGL/include/CGAL/boost/graph/selection.h
View File

@ -543,7 +543,7 @@ regularize_face_selection_borders(
(face_index_map));
for (mesh_face_descriptor fd : faces(mesh))
put(is_selected, fd, graph.labels[get(face_index_map,fd)]);
put(is_selected, fd, (graph.labels[get(face_index_map,fd)] != 0));
}
/// \cond SKIP_IN_MANUAL

4
Barycentric_coordinates_2/examples/Barycentric_coordinates_2/CMakeLists.txt
View File

@ -1,10 +1,10 @@
# Created by the script cgal_create_cmake_script.
# This is the CMake script for compiling a CGAL application.
project(Barycentric_coordinates_2_Examples)
cmake_minimum_required(VERSION 3.1...3.23)
project(Barycentric_coordinates_2_Examples)
find_package(CGAL REQUIRED COMPONENTS Core)
create_single_source_cgal_program("segment_coordinates.cpp")

3
Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Harmonic_coordinates_2.h
View File

@ -587,8 +587,7 @@ namespace Barycentric_coordinates {
const auto& p0 = m_domain.vertex(neighbors[jm]);
const auto& p1 = m_domain.vertex(neighbors[j]);
const auto& p2 = m_domain.vertex(neighbors[jp]);
const FT w = -Weights::cotangent_weight(
p0, p1, p2, query, m_traits) / FT(2);
const FT w = -Weights::cotangent_weight(p0, p1, p2, query, m_traits) / FT(2);
W -= w;
if (m_domain.is_on_boundary(idx)) {

4
Barycentric_coordinates_2/test/Barycentric_coordinates_2/CMakeLists.txt
View File

@ -1,10 +1,10 @@
# Created by the script cgal_create_cmake_script.
# This is the CMake script for compiling a CGAL application.
project(Barycentric_coordinates_2_Tests)
cmake_minimum_required(VERSION 3.1...3.23)
project(Barycentric_coordinates_2_Tests)
find_package(CGAL REQUIRED COMPONENTS Core)
create_single_source_cgal_program("test_almost_degenerate_segment.cpp")

2
Boolean_set_operations_2/include/CGAL/Polygon_set_2.h
View File

@ -58,7 +58,7 @@ public:
{}
/*! Constructor with traits object. */
Polygon_set_2 (Traits_2& tr) :
Polygon_set_2 (const Traits_2& tr) :
Base(tr)
{}

8
Bounding_volumes/include/CGAL/Min_sphere_of_spheres_d/Min_sphere_of_spheres_d_pair.h
View File

@ -42,7 +42,7 @@ namespace CGAL_MINIBALL_NAMESPACE {
{
// That constant is embedded in an inline static function, to
// workaround a bug of g++>=4.1
// http://gcc.gnu.org/bugzilla/show_bug.cgi?id=36912
// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=36912
// g++ does not like const floating expression when -frounding-math
// is used.
static double result() {
@ -55,7 +55,7 @@ namespace CGAL_MINIBALL_NAMESPACE {
{
// That constant is embedded in an inline static function, to
// workaround a bug of g++>=4.1
// http://gcc.gnu.org/bugzilla/show_bug.cgi?id=36912
// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=36912
// g++ does not like const floating expression when -frounding-math
// is used.
static float result() {
@ -68,7 +68,7 @@ namespace CGAL_MINIBALL_NAMESPACE {
{
// That constant is embedded in an inline static function, to
// workaround a bug of g++>=4.1
// http://gcc.gnu.org/bugzilla/show_bug.cgi?id=36912
// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=36912
// g++ does not like const floating expression when -frounding-math
// is used.
static double result() {
@ -81,7 +81,7 @@ namespace CGAL_MINIBALL_NAMESPACE {
{
// That constant is embedded in an inline static function, to
// workaround a bug of g++>=4.1
// http://gcc.gnu.org/bugzilla/show_bug.cgi?id=36912
// https://gcc.gnu.org/bugzilla/show_bug.cgi?id=36912
// g++ does not like const floating expression when -frounding-math
// is used.
static float result() {

2
CGAL_Core/include/CGAL/CORE/BigFloat.h
View File

@ -14,7 +14,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/BigFloatRep.h
View File

@ -14,7 +14,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/BigFloat_impl.h
View File

@ -23,7 +23,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/BigInt.h
View File

@ -14,7 +14,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/BigRat.h
View File

@ -14,7 +14,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/CORE.h
View File

@ -15,7 +15,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/CoreAux.h
View File

@ -14,7 +14,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/CoreAux_impl.h
View File

@ -15,7 +15,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/CoreDefs.h
View File

@ -17,7 +17,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/CoreDefs_impl.h
View File

@ -14,7 +14,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/CoreIO_impl.h
View File

@ -11,7 +11,7 @@
* Zilin Du <zilin@cs.nyu.edu>
* Chee Yap <yap@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/Expr.h
View File

@ -18,7 +18,7 @@
* Sylvain Pion <pion@cs.nyu.edu>
* Vikram Sharma<sharma@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/ExprRep.h
View File

@ -18,7 +18,7 @@
* Sylvain Pion <pion@cs.nyu.edu>
* Vikram Sharma<sharma@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/Expr_impl.h
View File

@ -16,7 +16,7 @@
* Zilin Du <zilin@cs.nyu.edu>
* Sylvain Pion <pion@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/Filter.h
View File

@ -17,7 +17,7 @@
* Zilin Du <zilin@cs.nyu.edu>
* Chee Yap <yap@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/MemoryPool.h
View File

@ -14,7 +14,7 @@
* Chee Yap <yap@cs.nyu.edu>
* Sylvain Pion <pion@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/Promote.h
View File

@ -18,7 +18,7 @@
* Sylvain Pion <pion@cs.nyu.edu>
* Vikram Sharma<sharma@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/Real.h
View File

@ -18,7 +18,7 @@
* Zilin Du <zilin@cs.nyu.edu>
* Sylvain Pion <pion@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/RealRep.h
View File

@ -16,7 +16,7 @@
* Zilin Du <zilin@cs.nyu.edu>
* Sylvain Pion <pion@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/Real_impl.h
View File

@ -17,7 +17,7 @@
* Zilin Du <zilin@cs.nyu.edu>
* Sylvain Pion <pion@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/RefCount.h
View File

@ -35,7 +35,7 @@
* Zilin Du <zilin@cs.nyu.edu>
* Chee Yap <yap@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/Timer.h
View File

@ -23,7 +23,7 @@
* Written by
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/extLong.h
View File

@ -17,7 +17,7 @@
* Chen Li <chenli@cs.nyu.edu>
* Zilin Du <zilin@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/extLong_impl.h
View File

@ -21,7 +21,7 @@
* Zilin Du <zilin@cs.nyu.edu>
* Sylvain Pion <pion@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/linearAlgebra.h
View File

@ -22,7 +22,7 @@
* Written by
* Shubin Zhao (shubinz@cs.nyu.edu) (2001)
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $Id$

2
CGAL_Core/include/CGAL/CORE/poly/Curves.h
View File

@ -49,7 +49,7 @@
* Author: Vikram Sharma and Chee Yap
* Date: April 12, 2004
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/poly/Curves.tcc
View File

@ -16,7 +16,7 @@
* Author: Vikram Sharma and Chee Yap
* Date: April 12, 2004
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/poly/Poly.h
View File

@ -36,7 +36,7 @@
* Author: Chee Yap
* Date: May 28, 2002
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/poly/Poly.tcc
View File

@ -30,7 +30,7 @@
* Author: Chee Yap, Sylvain Pion and Vikram Sharma
* Date: May 28, 2002
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/CORE/poly/Sturm.h
View File

@ -37,7 +37,7 @@
* Author: Chee Yap and Sylvain Pion, Vikram Sharma
* Date: July 20, 2002
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

2
CGAL_Core/include/CGAL/export/CORE.h
View File

@ -18,7 +18,7 @@
* Sylvain Pion <pion@cs.nyu.edu>
* Vikram Sharma<sharma@cs.nyu.edu>
*
* WWW URL: http://cs.nyu.edu/exact/
* WWW URL: https://cs.nyu.edu/exact/
* Email: exact@cs.nyu.edu
*
* $URL$

6
CGAL_ImageIO/include/CGAL/ImageIO.h
View File

@ -24,7 +24,7 @@
#ifdef CGAL_USE_ZLIB
#include <zlib.h>
/* see http://www.gzip.org/zlib/
/* see https://zlib.net/
for details and documentation
*/
#endif
@ -342,8 +342,8 @@ CGAL_IMAGEIO_EXPORT _image *_createImage(std::size_t x, std::size_t y, std::size
GIS (CEA, IRISA, ENST 3D image format).
See also:
http://www.dcs.ed.ac.uk/home/mxr/gfx/2d-hi.html and
http://www.gzip.org/zlib/
https://www.martinreddy.net/gfx/2d-hi.html and
https://zlib.net/
@param name image file name or nullptr for stdin */

2
CGAL_ImageIO/include/CGAL/ImageIO/convert.h
View File

@ -19,7 +19,7 @@
*
* AUTHOR:
* Gregoire Malandain (greg@sophia.inria.fr)
* http://www.inria.fr/epidaure/personnel/malandain/
* https://www-sop.inria.fr/members/Gregoire.Malandain/
*
* CREATION DATE:
* June, 9 1998

2
CGAL_ImageIO/include/CGAL/ImageIO/recbuffer.h
View File

@ -23,7 +23,7 @@
*
* AUTHOR:
* Gregoire Malandain (greg@sophia.inria.fr)
* http://www.inria.fr/epidaure/personnel/malandain/
* https://www-sop.inria.fr/members/Gregoire.Malandain/
*
* CREATION DATE:
* June, 9 1998

2
CGAL_ImageIO/include/CGAL/ImageIO/recline.h
View File

@ -23,7 +23,7 @@
*
* AUTHOR:
* Gregoire Malandain (greg@sophia.inria.fr)
* http://www.inria.fr/epidaure/personnel/malandain/
* https://www-sop.inria.fr/members/Gregoire.Malandain/
*
* CREATION DATE:
* June, 9 1998

2
CGAL_ImageIO/include/CGAL/ImageIO/typedefs.h
View File

@ -19,7 +19,7 @@
*
* AUTHOR:
* Gregoire Malandain (greg@sophia.inria.fr)
* http://www.inria.fr/epidaure/personnel/malandain/
* https://www-sop.inria.fr/members/Gregoire.Malandain/
*
* CREATION DATE:
* June, 9 1998

2
CGAL_ipelets/doc/CGAL_ipelets/CGAL_ipelets.txt
View File

@ -9,7 +9,7 @@ namespace CGAL {
\section CGAL_ipeletsIntroduction Introduction
The Ipe extensible drawing editor (<A HREF="http://ipe.otfried.org">http://ipe.otfried.org</A>) \cgalCite{schwarzkopf1995ede}, \cgalCite{ipe:man-09}
The Ipe extensible drawing editor (<A HREF="https://ipe.otfried.org/">https://ipe.otfried.org/</A>) \cgalCite{schwarzkopf1995ede}, \cgalCite{ipe:man-09}
is a tool used by computational geometry researchers to produce 2D figures for inclusion in articles or presentations.
The extensible adjective sheds a light on an important feature:
the possibility for users to write small extensions (called <I>ipelets</I>)

73
Cartesian_kernel/include/CGAL/Cartesian/function_objects.h
View File

@ -17,6 +17,7 @@
#ifndef CGAL_CARTESIAN_FUNCTION_OBJECTS_H
#define CGAL_CARTESIAN_FUNCTION_OBJECTS_H
#include <CGAL/tags.h>
#include <CGAL/Kernel/function_objects.h>
#include <CGAL/predicates/kernel_ftC2.h>
#include <CGAL/predicates/kernel_ftC3.h>
@ -445,14 +446,14 @@ namespace CartesianKernelFunctors {
}
template <class T1, class T2, class T3>
result_type
Needs_FT<result_type>
operator()(const T1& p, const T2& q, const T3& r) const
{
return CGAL::compare(squared_distance(p, q), squared_distance(p, r));
}
template <class T1, class T2, class T3, class T4>
result_type
Needs_FT<result_type>
operator()(const T1& p, const T2& q, const T3& r, const T4& s) const
{
return CGAL::compare(squared_distance(p, q), squared_distance(r, s));
@ -591,14 +592,14 @@ namespace CartesianKernelFunctors {
}
template <class T1, class T2, class T3>
result_type
Needs_FT<result_type>
operator()(const T1& p, const T2& q, const T3& r) const
{
return CGAL::compare(squared_distance(p, q), squared_distance(p, r));
}
template <class T1, class T2, class T3, class T4>
result_type
Needs_FT<result_type>
operator()(const T1& p, const T2& q, const T3& r, const T4& s) const
{
return CGAL::compare(squared_distance(p, q), squared_distance(r, s));
@ -668,28 +669,34 @@ namespace CartesianKernelFunctors {
result_type
operator()(const Point_3& p, const Point_3& q, const Point_3& r, const Point_3& s, const FT& ft) const
{
return CGAL::compare(squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z(),
r.x(), r.y(), r.z(),
s.x(), s.y(), s.z() ),
ft);
FT num, den;
squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z(),
r.x(), r.y(), r.z(),
s.x(), s.y(), s.z(),
num, den);
return CGAL::compare(num, den * ft);
}
result_type
operator()(const Point_3& p, const Point_3& q, const Point_3& r, const FT& ft) const
{
return CGAL::compare(squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z(),
r.x(), r.y(), r.z()),
ft);
FT num, den;
squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z(),
r.x(), r.y(), r.z(),
num, den);
return CGAL::compare(num, den * ft);
}
result_type
operator()(const Point_3& p, const Point_3& q, const FT& ft) const
{
return CGAL::compare(squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z() ),
ft);
FT num, den;
squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z(),
num, den);
return CGAL::compare(num, den * ft);
}
result_type
@ -1234,26 +1241,35 @@ namespace CartesianKernelFunctors {
result_type
operator()( const Point_3& p, const Point_3& q) const
{
return squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z());
FT num, den;
squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z(),
num, den);
return num / den;
}
result_type
operator()( const Point_3& p, const Point_3& q, const Point_3& r) const
{
return squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z(),
r.x(), r.y(), r.z());
FT num, den;
squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z(),
r.x(), r.y(), r.z(),
num, den);
return num / den;
}
result_type
operator()( const Point_3& p, const Point_3& q,
const Point_3& r, const Point_3& s) const
{
return squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z(),
r.x(), r.y(), r.z(),
s.x(), s.y(), s.z());
FT num, den;
squared_radiusC3(p.x(), p.y(), p.z(),
q.x(), q.y(), q.z(),
r.x(), r.y(), r.z(),
s.x(), s.y(), s.z(),
num, den);
return num / den;
}
};
@ -2505,7 +2521,7 @@ namespace CartesianKernelFunctors {
FT rsy = psz*qsx-psx*qsz;
FT rsz = psx*qsy-psy*qsx;
// The following determinants can be developped and simplified.
// The following determinants can be developed and simplified.
//
// FT num_x = determinant(psy,psz,ps2,
// qsy,qsz,qs2,
@ -3961,7 +3977,7 @@ namespace CartesianKernelFunctors {
operator()(const Circle_3 &a, const Point_3 &p) const
{ return a.rep().has_on(p); }
result_type
Needs_FT<result_type>
operator()(const Sphere_3 &a, const Circle_3 &p) const
{ return a.rep().has_on(p); }
@ -4205,8 +4221,7 @@ namespace CartesianKernelFunctors {
public:
typedef typename K::Orientation result_type;
result_type
operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
result_type operator()(const Point_2& p, const Point_2& q, const Point_2& r) const
{
return orientationC2(p.x(), p.y(), q.x(), q.y(), r.x(), r.y());
}

60
Cartesian_kernel/include/CGAL/constructions/kernel_ftC3.h
View File

@ -142,11 +142,12 @@ centroidC3( const FT &px, const FT &py, const FT &pz,
template < class FT >
CGAL_KERNEL_MEDIUM_INLINE
FT
void
squared_radiusC3(const FT &px, const FT &py, const FT &pz,
const FT &qx, const FT &qy, const FT &qz,
const FT &rx, const FT &ry, const FT &rz,
const FT &sx, const FT &sy, const FT &sz)
const FT &qx, const FT &qy, const FT &qz,
const FT &rx, const FT &ry, const FT &rz,
const FT &sx, const FT &sy, const FT &sz,
FT &num, FT &den)
{
// Translate p to origin to simplify the expression.
FT qpx = qx-px;
@ -163,29 +164,30 @@ squared_radiusC3(const FT &px, const FT &py, const FT &pz,
FT sp2 = CGAL_NTS square(spx) + CGAL_NTS square(spy) + CGAL_NTS square(spz);
FT num_x = determinant(qpy,qpz,qp2,
rpy,rpz,rp2,
spy,spz,sp2);
rpy,rpz,rp2,
spy,spz,sp2);
FT num_y = determinant(qpx,qpz,qp2,
rpx,rpz,rp2,
spx,spz,sp2);
rpx,rpz,rp2,
spx,spz,sp2);
FT num_z = determinant(qpx,qpy,qp2,
rpx,rpy,rp2,
spx,spy,sp2);
FT den = determinant(qpx,qpy,qpz,
rpx,rpy,rpz,
spx,spy,spz);
CGAL_kernel_assertion( ! CGAL_NTS is_zero(den) );
rpx,rpy,rp2,
spx,spy,sp2);
FT dden = determinant(qpx,qpy,qpz,
rpx,rpy,rpz,
spx,spy,spz);
CGAL_kernel_assertion( ! CGAL_NTS is_zero(dden) );
return (CGAL_NTS square(num_x) + CGAL_NTS square(num_y)
+ CGAL_NTS square(num_z)) / CGAL_NTS square(2 * den);
num = CGAL_NTS square(num_x) + CGAL_NTS square(num_y) + CGAL_NTS square(num_z);
den = CGAL_NTS square(2 * dden);
}
template < class FT >
CGAL_KERNEL_MEDIUM_INLINE
FT
void
squared_radiusC3(const FT &px, const FT &py, const FT &pz,
const FT &qx, const FT &qy, const FT &qz,
const FT &sx, const FT &sy, const FT &sz)
const FT &qx, const FT &qy, const FT &qz,
const FT &sx, const FT &sy, const FT &sz,
FT &num, FT &den)
{
// Translate s to origin to simplify the expression.
FT psx = px-sx;
@ -207,14 +209,14 @@ squared_radiusC3(const FT &px, const FT &py, const FT &pz,
FT num_z = ps2 * determinant(qsx,qsy,rsx,rsy)
- qs2 * determinant(psx,psy,rsx,rsy);
FT den = determinant(psx,psy,psz,
qsx,qsy,qsz,
rsx,rsy,rsz);
FT dden = determinant(psx,psy,psz,
qsx,qsy,qsz,
rsx,rsy,rsz);
CGAL_kernel_assertion( den != 0 );
CGAL_kernel_assertion( dden != 0 );
return (CGAL_NTS square(num_x) + CGAL_NTS square(num_y)
+ CGAL_NTS square(num_z)) / CGAL_NTS square(2 * den);
num = CGAL_NTS square(num_x) + CGAL_NTS square(num_y) + CGAL_NTS square(num_z);
den = CGAL_NTS square(2 * dden);
}
template <class FT>
@ -305,11 +307,13 @@ squared_distanceC3( const FT &px, const FT &py, const FT &pz,
template < class FT >
CGAL_KERNEL_INLINE
FT
void
squared_radiusC3( const FT &px, const FT &py, const FT &pz,
const FT &qx, const FT &qy, const FT &qz)
const FT &qx, const FT &qy, const FT &qz,
FT &num, FT &den)
{
return squared_distanceC3(px, py, pz, qx, qy, qz) / 4;
num = squared_distanceC3(px, py, pz, qx, qy, qz);
den = FT(4);
}
template < class FT >

13
Cartesian_kernel/include/CGAL/predicates/kernel_ftC3.h
View File

@ -754,7 +754,7 @@ power_side_of_bounded_power_sphereC3(
}
// return the sign of the power test of weighted point (rx,ry,rz,rw)
// with respect to the smallest sphere orthogoanal to
// with respect to the smallest sphere orthogonal to
// p,q
template< class FT >
typename Same_uncertainty_nt<Bounded_side, FT>::type
@ -764,20 +764,19 @@ power_side_of_bounded_power_sphereC3(
const FT &rx, const FT &ry, const FT &rz, const FT &rw)
{
FT FT2(2);
FT FT4(4);
FT dpx = px - qx;
FT dpy = py - qy;
FT dpz = pz - qz;
FT dpw = pw - qw;
FT dp2 = CGAL_NTS square(dpx) + CGAL_NTS square(dpy) + CGAL_NTS square(dpz);
FT drx = rx - (px + qx)/FT2;
FT dry = ry - (py + qy)/FT2;
FT drz = rz - (pz + qz)/FT2;
FT drw = rw - (pw + qw)/FT2;
FT drx = FT2 * rx - (px + qx);
FT dry = FT2 * ry - (py + qy);
FT drz = FT2 * rz - (pz + qz);
FT drw = FT2 * rw - (pw + qw);
FT dr2 = CGAL_NTS square(drx) + CGAL_NTS square(dry) + CGAL_NTS square(drz);
FT dpr = dpx*drx + dpy*dry +dpz*drz;
return enum_cast<Bounded_side>(
- CGAL_NTS sign (dr2 - dp2/FT4 + dpr*dpw/dp2 - drw ));
- CGAL_NTS sign (dr2*dp2 - dp2*dp2 + FT2*dpr*dpw - FT2*drw*dp2 ));
}
} // namespace CGAL

2
Circular_kernel_2/doc/Circular_kernel_2/Circular_kernel_2.txt
View File

@ -90,7 +90,7 @@ also added more functionality in 2008.
This work was partially supported by the IST Programme of the EU as a
Shared-cost RTD (FET Open) Project under Contract No IST-2000-26473
(<A HREF="http://www-sop.inria.fr/prisme/ECG/">ECG</A> - Effective
(<A HREF="https://www-sop.inria.fr/prisme/ECG/">ECG</A> - Effective
Computational Geometry for Curves and Surfaces) and by the IST
Programme of the 6th Framework Programme of the EU as a STREP (FET
Open Scheme) Project under Contract No IST-006413

2
Circular_kernel_2/include/CGAL/IO/Dxf_reader.h
View File

@ -16,7 +16,7 @@
// (ACS -- Algorithms for Complex Shapes)
// Description of the file format can be found at the following address:
// http://www.autodesk.com/techpubs/autocad/acad2000/dxf/
// https://images.autodesk.com/adsk/files/autocad_2012_pdf_dxf-reference_enu.pdf
#ifndef CGAL_IO_DXF_READER_H
#define CGAL_IO_DXF_READER_H

3
Circular_kernel_2/include/CGAL/IO/Dxf_reader_doubles.h
View File

@ -16,8 +16,7 @@
// (ACS -- Algorithms for Complex Shapes)
// Descriptions of the file format can be found at
// http://www.autodesk.com/techpubs/autocad/acad2000/dxf/
// http://www.tnt.uni-hannover.de/soft/compgraph/fileformats/docs/DXF.ascii
// https://images.autodesk.com/adsk/files/autocad_2012_pdf_dxf-reference_enu.pdf
#ifndef CGAL_IO_DXF_READER_DOUBLES_H
#define CGAL_IO_DXF_READER_DOUBLES_H

2
Circular_kernel_2/include/CGAL/IO/Dxf_variant_reader.h
View File

@ -17,7 +17,7 @@
// (ACS -- Algorithms for Complex Shapes)
// Description of the file format can be found at the following address:
// http://www.autodesk.com/techpubs/autocad/acad2000/dxf/
// https://images.autodesk.com/adsk/files/autocad_2012_pdf_dxf-reference_enu.pdf
#ifndef CGAL_IO_DXF_VARIANT_READER_H
#define CGAL_IO_DXF_VARIANT_READER_H

5
Classification/doc/Classification/Classification.txt
View File

@ -528,7 +528,10 @@ The following example:
\section Classification_history History
This package is based on a research code by [Florent Lafarge](https://www-sop.inria.fr/members/Florent.Lafarge/) that was generalized, extended and packaged by [Simon Giraudot](http://geometryfactory.com/who-we-are/) in \cgal 4.12. %Classification of surface meshes and of clusters were introduced in \cgal 4.13. The Neural Network classifier was introduced in \cgal 4.14.
This package is based on a research code by [Florent Lafarge](https://www-sop.inria.fr/members/Florent.Lafarge/)
that was generalized, extended and packaged by [Simon Giraudot](https://geometryfactory.com/who-we-are/)
in \cgal 4.12. %Classification of surface meshes and of clusters were introduced in \cgal 4.13.
The Neural Network classifier was introduced in \cgal 4.14.

2
Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
View File

@ -542,7 +542,7 @@ Let <I>d0</I>\f$ \in \f$ <I>D</I> be a dart. Given <I>i</I>, 1 \f$ \leq \f$ <I>i
\section Combinatorial_mapDesign Design and Implementation History
The code of this package is inspired by Moka, a 3D topological modeler mainly developed by Fr&eacute;d&eacute;ric Vidil and Guillaume Damiand (<A HREF="http://moka-modeller.sourceforge.net/">http://moka-modeller.sourceforge.net/</A>). However, Moka was based on Generalized maps (and not Combinatorial maps), and the design was not \cgal "compatible". Thus, Guillaume Damiand started to develop a totally new package by mixing ideas taken from Moka with the design of the Halfedge data structure package of \cgal. Andreas Fabri and S&eacute;bastien Loriot contributed to the design, the coding, and to the documentation of the package, and Laurent Rineau helped for the design. Emma Michel contributed to the manual. Monique Teillaud and Bernd G&auml;rtner contributed to the manual by giving useful remarks, really numerous and detailed for Monique. Ken Arroyo Ohori contributed to the two reverse orientation functions.
The code of this package is inspired by Moka, a 3D topological modeler mainly developed by Fr&eacute;d&eacute;ric Vidil and Guillaume Damiand (<A HREF="https://moka-modeller.sourceforge.net/">https://moka-modeller.sourceforge.net/</A>). However, Moka was based on Generalized maps (and not Combinatorial maps), and the design was not \cgal "compatible". Thus, Guillaume Damiand started to develop a totally new package by mixing ideas taken from Moka with the design of the Halfedge data structure package of \cgal. Andreas Fabri and S&eacute;bastien Loriot contributed to the design, the coding, and to the documentation of the package, and Laurent Rineau helped for the design. Emma Michel contributed to the manual. Monique Teillaud and Bernd G&auml;rtner contributed to the manual by giving useful remarks, really numerous and detailed for Monique. Ken Arroyo Ohori contributed to the two reverse orientation functions.
*/
} /* namespace CGAL */

5
Combinatorial_map/include/CGAL/Compact_container_with_index.h
View File

@ -752,9 +752,12 @@ public:
return false;
}
bool owns_dereferencable(const_iterator cit) const
bool owns_dereferenceable(const_iterator cit) const
{ return cit!=end() && owns(cit); }
CGAL_DEPRECATED bool owns_dereferencable(const_iterator cit) const
{ return owns_dereferenceable(cit); }
/** Reserve method to ensure that the capacity of the Compact_container be
* greater or equal than a given value n.
*/

4
Documentation/doc/Documentation/Developer_manual/Chapter_checks.txt
View File

@ -185,7 +185,7 @@ MSVC][msvc-assume], or [`__builtin_unreachable`][builtin-unreachable]
recognized by both clang and g++.
[msvc-assume]: https://msdn.microsoft.com/en-us/library/1b3fsfxw.aspx
[builtin-unreachable]: http://clang.llvm.org/docs/LanguageExtensions.html#builtin-unreachable
[builtin-unreachable]: https://clang.llvm.org/docs/LanguageExtensions.html#builtin-unreachable
\section secexception_handling Exception handling
@ -193,7 +193,7 @@ Some parts of the library use exceptions, but there is no general specific
policy concerning exception handling in \cgal. It is nevertheless good to
target exception safety, as much as possible. Good references on exception
safety are: Appendix E of \cgalCite{cgal:s-cpl-97} (also available at
<A HREF="http://www.stroustrup.com/3rd_safe0.html"><TT>http://www.stroustrup.com/3rd_safe0.html</TT></A>),
<A HREF="https://www.stroustrup.com/3rd_safe0.html"><TT>https://www.stroustrup.com/3rd_safe0.html</TT></A>),
and \cgalCite{cgal:a-esgc-98} (also available at
<A HREF="https://www.boost.org/community/exception_safety.html"><TT>https://www.boost.org/community/exception_safety.html</TT></A>).
Any destructor which might throw an exception, including a destructor which

2
Documentation/doc/Documentation/Developer_manual/Chapter_iterators_and_circulators.txt
View File

@ -42,7 +42,7 @@ Thus we will not give a full description of these concept here
but only a few hints about how to use and write handle, iterators and circulators in \cgal. Developers should consult the above-mentioned references to become
familiar with the iterator, circulator and handle concepts. In
particular, the notions of iterator and circulator ranges,
dereferencable and past-the-end values,
dereferenceable and past-the-end values,
mutable and constant iterators and circulators,
and the different categories (forward, bidirectional, random-access, etc.)
of iterators and circulators, are fundamental.

6
Documentation/doc/Documentation/License.txt
View File

@ -19,7 +19,7 @@ based on GPLed \cgal data structures, obliges you to distribute the
source code of your software under the GPL.
The exact license terms can be found at the Free Software Foundation
web site: http://www.gnu.org/copyleft/gpl.html.
web site: https://www.gnu.org/licenses/gpl-3.0.html.
\section licensesLGPL GNU LGPL
@ -29,7 +29,7 @@ In contrast to the GPL, there is no obligation to distribute the source
code of software you build on top of LGPLed \cgal data structures.
The exact license terms can be found at the Free Software Foundation web site:
http://www.gnu.org/copyleft/lesser.html.
https://www.gnu.org/licenses/lgpl-3.0.html.
\section licensesRationale Rationale of the License Choice
@ -46,7 +46,7 @@ The package overview states for each package under which license it is distribut
Users who cannot comply with the Open Source license terms can buy individual
data structures under various commercial licenses from GeometryFactory:
http://www.geometryfactory.com/. License fees paid by commercial
https://www.geometryfactory.com/. License fees paid by commercial
customers are reinvested in R\&D performed by the \cgal project partners,
as well as in evolutive maintenance.

14
Documentation/doc/Documentation/Third_party.txt
View File

@ -11,11 +11,11 @@ supporting <a href="https://isocpp.org/wiki/faq/cpp14">C++14</a> or later.
| Operating System | Compiler |
| :---------- | :--------------- |
| Linux | \gnu `g++` 10.2.1 or later\cgalFootnote{<A HREF="http://gcc.gnu.org/">\cgalFootnoteCode{http://gcc.gnu.org/}</A>} |
| | `Clang` \cgalFootnote{<A HREF="http://clang.llvm.org/">\cgalFootnoteCode{http://clang.llvm.org/}</A>} compiler version 13.0.1 |
| \ms Windows | \gnu `g++` 10.2.1 or later\cgalFootnote{<A HREF="http://gcc.gnu.org/">\cgalFootnoteCode{http://gcc.gnu.org/}</A>} |
| Linux | \gnu `g++` 10.2.1 or later\cgalFootnote{<A HREF="https://gcc.gnu.org/">\cgalFootnoteCode{https://gcc.gnu.org/}</A>} |
| | `Clang` \cgalFootnote{<A HREF="https://clang.llvm.org/">\cgalFootnoteCode{https://clang.llvm.org/}</A>} compiler version 13.0.1 |
| \ms Windows | \gnu `g++` 10.2.1 or later\cgalFootnote{<A HREF="https://gcc.gnu.org/">\cgalFootnoteCode{https://gcc.gnu.org/}</A>} |
| | \ms Visual `C++` 14.0, 15.9, 16.10, 17.0 (\visualstudio 2015, 2017, 2019, and 2022)\cgalFootnote{<A HREF="https://visualstudio.microsoft.com/">\cgalFootnoteCode{https://visualstudio.microsoft.com/}</A>} |
| MacOS X | \gnu `g++` 10.2.1 or later\cgalFootnote{<A HREF="http://gcc.gnu.org/">\cgalFootnoteCode{http://gcc.gnu.org/}</A>} |
| MacOS X | \gnu `g++` 10.2.1 or later\cgalFootnote{<A HREF="https://gcc.gnu.org/">\cgalFootnoteCode{https://gcc.gnu.org/}</A>} |
| | Apple `Clang` compiler versions 10.0.1, 12.0.5, and 13.0.0 |
<!-- Windows supported version are also listed on windows.html (must change both) -->
@ -131,7 +131,7 @@ Overview</a> page. In order to use Eigen in \cgal programs, the
executables should be linked with the CMake imported target
`CGAL::Eigen3_support` provided in `CGAL_Eigen3_support.cmake`.
The \eigen web site is <A HREF="http://eigen.tuxfamily.org/index.php?title=Main_Page">`http://eigen.tuxfamily.org`</A>.
The \eigen web site is <A HREF="https://eigen.tuxfamily.org/index.php?title=Main_Page">`https://eigen.tuxfamily.org`</A>.
\subsection thirdpartyOpenGR OpenGR
@ -213,7 +213,7 @@ the handling of \pdb data.
In \cgal, the \esbtl is used in an example of the \ref PkgSkinSurface3 package.
It can be downloaded from <A HREF="http://esbtl.sourceforge.net/">`http://esbtl.sourceforge.net/`</A>.
It can be downloaded from <A HREF="https://esbtl.sourceforge.net/">`https://esbtl.sourceforge.net/`</A>.
\subsection thirdpartyTBB Intel TBB
@ -309,7 +309,7 @@ The \glpk web site is <A HREF="https://www.gnu.org/software/glpk/">`https://www.
In \cgal, \scip provides an optional linear integer program solver in the \ref PkgPolygonalSurfaceReconstruction package.
In order to use \scip in \cgal programs, the executables should be linked with the CMake imported target `CGAL::SCIP_support` provided in `CGAL_SCIP_support.cmake`.
The \scip web site is <A HREF="http://scip.zib.de/">`http://scip.zib.de/`</A>.
The \scip web site is <A HREF="https://www.scipopt.org/">`https://www.scipopt.org/`</A>.
\subsection thirdpartyOSQP OSQP

2
Documentation/doc/Documentation/main.txt
View File

@ -35,7 +35,7 @@ Head over to \ref general_intro to learn how to obtain, install, and use \cgal.
\cgal is distributed under a dual-license scheme. \cgal can be used
together with Open Source software free of charge. Using \cgal in
other contexts can be done by obtaining a commercial license from
[GeometryFactory](http://www.geometryfactory.com). For more details
[GeometryFactory](https://www.geometryfactory.com). For more details
see the \ref license "License" page.
<h2>Acknowledgement</h2>

75
Documentation/doc/biblio/cgal_manual.bib
View File

@ -8,7 +8,7 @@
% - Entries are sorted alphabetically by their key
%
% - The key is created following the same rules as geombib, see
% http://compgeom.cs.uiuc.edu/~jeffe/compgeom/biblios.html
% https://jeffe.cs.illinois.edu/teaching/compgeom/
%
% Here are roughly the rules:
% initials of authors' last names '-' initials of 5 first title words
@ -264,7 +264,7 @@ Boissonnat}
pages = {67--91},
volume = {4},
issue = {1},
url = {http://dx.doi.org/10.1007/s11786-010-0043-4},
url = {https://dx.doi.org/10.1007/s11786-010-0043-4},
year = {2010}
}
@ -279,7 +279,7 @@ Boissonnat}
pages = {45--66},
volume = {4},
issue = {1},
url = {http://dx.doi.org/10.1007/s11786-010-0042-5},
url = {https://dx.doi.org/10.1007/s11786-010-0042-5},
year = {2010}
}
@ -335,8 +335,8 @@ Boissonnat}
,author = {Gavin Bell and Anthony Parisi and Mark Pesce}
,title = {VRML The Virtual Reality Modeling Language:
Version 1.0 Specification}
,howpublished = {\url{http://www.web3d.org/standards}}
,url = "http://www.web3d.org/standards"
,howpublished = {\url{https://www.web3d.org/standards}}
,url = "https://www.web3d.org/standards"
,month = {May 26}
,year = 1995
,update = "13.04 lrineau"
@ -674,7 +674,7 @@ Mourrain and Monique Teillaud"
year = "1996",
issn = "0377-2217",
doi = "DOI: 10.1016/0377-2217(94)00366-1",
url = "http://www.sciencedirect.com/science/article/B6VCT-3VW8NPR-11/2/3cf4525c68d79c055676541418264043",
url = "https://www.sciencedirect.com/science/article/abs/pii/0377221794003661",
keywords = "Convex hull problem, Frame, Linear programming, Data envelopment analysis, Redundancy"
}
@ -791,7 +791,7 @@ Teillaud"
@Misc{ cgal:e-esmr,
title = {{EPFL} statue model repository},
howpublished = {{EPFL} Computer Graphics and Geometry Laboratory},
url = {http://lgg.epfl.ch/statues_dataset.php}
url = {https://lgg.epfl.ch/statues_dataset.php}
}
@inproceedings{ cgal:eddhls-maam-95
@ -995,7 +995,7 @@ Teillaud"
,number = {B 98-05}
,year = 1998
,month = apr
,url = {http://www.inf.fu-berlin.de/inst/pubs/tr-b-98-05.abstract.html}
,url = {https://www.inf.fu-berlin.de/inst/pubs/tr-b-98-05.abstract.html}
,update = "98.06 schoenherr"
}
@ -1008,7 +1008,7 @@ Teillaud"
,number = {B 98-04}
,year = 1998
,month = apr
,url = {http://www.inf.fu-berlin.de/inst/pubs/tr-b-98-04.abstract.html}
,url = {https://www.inf.fu-berlin.de/inst/pubs/tr-b-98-04.abstract.html}
,update = "98.06 schoenherr"
}
@ -1020,7 +1020,7 @@ Teillaud"
,number = {B 97-03}
,year = 1997
,month = jun
,url = {http://www.inf.fu-berlin.de/inst/pubs/tr-b-97-03.abstract.html}
,url = {https://www.inf.fu-berlin.de/inst/pubs/tr-b-97-03.abstract.html}
,update = "97.06 schoenherr, 98.02 schoenherr, 98.06 schoenherr"
}
@ -1061,7 +1061,7 @@ Teillaud"
,edition = {1.0.1}
,month = {June}
,year = {1999}
,url = {http://clisp.cons.org/~haible/packages-cln.html}
,url = {https://www.ginac.de/CLN/}
,update = "99.06 pion"
}
@ -1297,7 +1297,7 @@ Teillaud"
(full paper will be available shortly)},
YEAR = {2005},
MONTH = {November},
URL = {http://www.loria.fr/~levy/php/article.php?pub=../publications/papers/2005/Numerics}
URL = {https://www.loria.fr/~levy/php/article.php?pub=../publications/papers/2005/Numerics}
}
@Article{ cgal:l-tmbrc-91,
@ -1555,7 +1555,7 @@ TITLE = {Intersecting Quadrics\,: An Efficient and Exact Implementation},
BOOKTITLE = {{ACM Symposium on Computational Geometry - SoCG'2004, Brooklyn, NY}},
YEAR ={ 2004},
MONTH ={ Jun},
URL = {http://www.loria.fr/publications/2004/A04-R-021/A04-R-021.ps},
URL = {https://www.loria.fr/publications/2004/A04-R-021/A04-R-021.ps},
ABSTRACT = {We present the first complete, exact and efficient C++ implementation of a method for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It is based on the near-optimal algorithm recently introduced by Dupont et al.~\cite{dupont03a}. Unlike existing implementations, it correctly identifies and parameterizes all the connected components of the intersection in all the possible cases, returning parameterizations with rational functions whenever such parameterizations exist. In addition, the coefficient field of the parameterizations is either minimal or involves one possibly unneeded square root.},
}
@ -1567,9 +1567,9 @@ ABSTRACT = {We present the first complete, exact and efficient C++ implementatio
booktitle = {SEA},
year = {2009},
pages = {209-220},
ee = {http://dx.doi.org/10.1007/978-3-642-02011-7_20},
ee = {https://link.springer.com/chapter/10.1007/978-3-642-02011-7_20},
crossref = {cgal:v-ea-09},
bibsource = {DBLP, http://dblp.uni-trier.de},
bibsource = {DBLP, https://dblp.org/},
update = "09.11 penarand"
}
@ -1582,8 +1582,8 @@ ABSTRACT = {We present the first complete, exact and efficient C++ implementatio
year = "2011",
note = "Advances in \{LIDAR\} Data Processing and Applications ",
issn = "0924-2716",
doi = "http://dx.doi.org/10.1016/j.isprsjprs.2011.09.008",
url = "http://www.sciencedirect.com/science/article/pii/S0924271611001055",
doi = "https://dx.doi.org/10.1016/j.isprsjprs.2011.09.008",
url = "https://www.sciencedirect.com/science/article/abs/pii/S0924271611001055?via%3Dihub",
author = "Clément Mallet and Frédéric Bretar and Michel Roux and Uwe Soergel and Christian Heipke"
}
@ -1688,7 +1688,7 @@ ABSTRACT = {We present the first complete, exact and efficient C++ implementatio
volume = {33},
number = {5},
issn = {1467-8659},
url = {http://dx.doi.org/10.1111/cgf.12446},
url = {https://onlinelibrary.wiley.com/doi/10.1111/cgf.12446},
doi = {10.1111/cgf.12446},
pages = {205--215},
year = {2014}
@ -1715,7 +1715,7 @@ ABSTRACT = {We present the first complete, exact and efficient C++ implementatio
,title = {The {LEDA} {U}ser {M}anual}
,organization = {Max-Planck-Insitut f\"ur Informatik}
,address = {66123 Saarbr\"ucken, Germany}
,url = {http://www.mpi-sb.mpg.de/LEDA/leda.html}
,url = {https://domino.mpi-inf.mpg.de/internet/reports.nsf/efc044f1568a0058c125642e0064c817/cff150e000ddc461c12562a80045cb82/$FILE/MPI-I-95-1-002.pdf}
,update = "99.05 schirra, 00.09 hert"
}
@ -1724,7 +1724,7 @@ ABSTRACT = {We present the first complete, exact and efficient C++ implementatio
,title = {The {LEDA} {U}ser {M}anual}
,organization = {Algorithmic Solutions}
,address = {66123 Saarbr\"ucken, Germany}
,url = {http://www.algorithmic-solutions.info/leda_manual/MANUAL.html}
,url = {https://www.algorithmic-solutions.info/leda_manual/MANUAL.html}
}
@article{ cgal:mog-vbcfe-11
@ -1979,7 +1979,7 @@ ABSTRACT = {We present the first complete, exact and efficient C++ implementatio
title = {{MPFI} - The Multiple Precision Floating-Point Interval
Library},
howpublished = {{R}evol, {N}athalie and {R}ouillier, {F}abrice},
url = {http://perso.ens-lyon.fr/nathalie.revol/software.html},
url = {https://perso.ens-lyon.fr/nathalie.revol/software.html},
update = "09.11 penarand"
}
@ -2022,7 +2022,7 @@ ABSTRACT = {We present the first complete, exact and efficient C++ implementatio
,journal = "Comput. Geom. Theory Appl."
, volume = 38
, pages = "100--110"
, url = "http://dx.doi.org/10.1016/j.comgeo.2006.11.008"
, url = "https://www.sciencedirect.com/science/article/pii/S0925772107000193?via%3Dihub"
, publisher = "Elsevier Science Publishers B. V."
,update = "09.02 lrineau"
}
@ -2298,8 +2298,8 @@ location = {Salt Lake City, Utah, USA}
volume = {5526},
year = {2009},
isbn = {978-3-642-02010-0},
ee = {http://dx.doi.org/10.1007/978-3-642-02011-7},
bibsource = {DBLP, http://dblp.uni-trier.de},
ee = {https://link.springer.com/book/10.1007/978-3-642-02011-7},
bibsource = {DBLP, https://dblp.org/},
update = "09.11 penarand"
}
@ -2368,7 +2368,7 @@ location = {Salt Lake City, Utah, USA}
,key = {VRML2}
,title = {The Virtual Reality Modeling Language Specification:
Version 2.0, {ISO}/{IEC} {CD} 14772}
,url = {http://www.web3d.org/documents/specifications/14772/V2.0/index.html}
,url = {https://www.web3d.org/documents/specifications/14772/V2.0/index.html}
,month = {December}
,year = 1997
,update = "13.04 lrineau"
@ -2503,7 +2503,6 @@ location = {Salt Lake City, Utah, USA}
editor = "L{\'{a}}szl{\'{o}} Szirmay Kalos",
pages = "210--218",
year = "1998",
url = "http://citeseer.ist.psu.edu/article/felkel98straight.html"
}
@inproceedings{ cgal:ee-rrccpp-98,
@ -2512,7 +2511,7 @@ location = {Salt Lake City, Utah, USA}
booktitle = "Symposium on Computational Geometry",
pages = "58--67",
year = "1998",
url = "http://citeseer.ist.psu.edu/eppstein98raising.html"
url = "https://jeffe.cs.illinois.edu/pubs/cycles.html"
}
@inproceedings{ cgal:ld-agrm-03,
@ -2525,11 +2524,9 @@ booktitle = {The 11-th International Conference in Central Europe
year = 2003,
volume = 11,
issn = {ISSN 1213-6972},
url = "http://wscg.zcu.cz/wscg2003/Papers_2003/G67.pdf"
url = "https://wscg.zcu.cz/wscg2003/Papers_2003/G67.pdf"
}
@InProceedings{cgal:k-vdc-06,
author = {Menelaos I. Karavelas},
title = {Voronoi diagrams in {\sc Cgal}},
@ -2576,7 +2573,7 @@ year = {1998},
pages = {69-79},
ee = {http://link.springer.de/link/service/series/0558/bibs/1766/17660069.htm},
crossref = {cgal:jlm-isgp-98},
bibsource = {DBLP, http://dblp.uni-trier.de},
bibsource = {DBLP, https://dblp.org/},
url = "https://www.boost.org/community/exception_safety.html"
}
@ -2624,7 +2621,7 @@ url = "https://www.boost.org/community/exception_safety.html"
volume = {1766},
year = {2000},
isbn = {3-540-41090-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
bibsource = {DBLP, https://dblp.org/}
}
@inproceedings{Kazhdan06,
@ -2719,14 +2716,14 @@ author = "Pedro M.M. de Castro and Frederic Cazals and Sebastien Loriot and Moni
AUTHOR = {Otfried Cheong},
EDITION = {6.0pre32},
YEAR = {2009},
URL = {http://ipe.otfried.org/}
URL = {https://ipe.otfried.org/}
}
@misc{cgal:t-ocdl-05,
key = "opcode",
author = {P. Terdiman},
title = "{{OPCODE 3D} Collision Detection library}",
note = "http://www.codercorner.com/Opcode.htm",
note = "https://www.codercorner.com/Opcode.htm",
year = {2005}
}
@ -2806,7 +2803,7 @@ ADDRESS = "Saarbr{\"u}cken, Germany"
@misc{abbott-qir-06,
author = "J. Abbott",
title = "Quadratic Interval Refinement for Real Roots",
URL = "http://www.dima.unige.it/~abbott/",
URL = "https://www.dima.unige.it/~abbott/",
year= "2006",
note = "Poster presented at the 2006 Int.\ Symp.\ on Symb.\
and Alg.\ Comp.\ (ISSAC 2006)"}
@ -3035,9 +3032,9 @@ pages = "458--473"
booktitle = {FOCS},
year = {1985},
pages = {155-164},
ee = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1985.65},
ee = {https://doi.ieeecomputersociety.org/10.1109/SFCS.1985.65},
crossref = {DBLP:conf/focs/FOCS26},
bibsource = {DBLP, http://dblp.uni-trier.de}
bibsource = {DBLP, https://dblp.org/}
}
@article{dtl-voasp-83,
@ -3061,8 +3058,8 @@ pages = "207--221"
volume = {abs/1403.3905},
url = {https://arxiv.org/abs/1403.3905},
timestamp = {Wed, 17 Sep 2014 16:30:16 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/BungiuHHHK14},
bibsource = {dblp computer science bibliography, http://dblp.org}
biburl = {https://dblp.uni-trier.de/rec/bib/journals/corr/BungiuHHHK14},
bibsource = {dblp computer science bibliography, https://dblp.org/}
}
@book{botsch2010PMP,

229
Documentation/doc/biblio/geom.bib
View File

@ -78,7 +78,7 @@
, title = "IRIT $6.0$ User's Manual"
, organization = "Technion"
, year = 1996
, url = "http://www.cs.technion.ac.il/~irit"
, url = "https://www.cs.technion.ac.il/~irit"
, update = "98.07 bibrelex"
}
@ -1925,7 +1925,7 @@ cell neighborhood in $O(m)$ time."
, type = "Project Proposal (U. S. Army Research Office grant DAAH04-96-1-0013)"
, institution = "Center for Geometric Computing"
, year = 1995
, url = "http://www.cs.brown.edu/cgc/"
, url = "https://www.cs.brown.edu/cgc/"
, update = "98.07 bibrelex, 97.03 tamassia"
}
@ -6908,7 +6908,7 @@ cell neighborhood in $O(m)$ time."
@misc{a-dcgs-
, author = "Nina Amenta"
, title = "Directory of Computational Geometry Software"
, url = "http://www.geom.umn.edu/software/cglist/"
, url = "https://www.geom.uiuc.edu/software/cglist/"
, update = "97.03 tamassia"
}
@ -13110,7 +13110,6 @@ It is highly suitable for parallelization."
, institution = "INRIA"
, address = "BP93, 06902 Sophia-Antipolis, France"
, year = 1994
, url = "http://www.inria.fr/RRRT/RR-2306"
, precedes = "abdpy-esdus-97"
, update = "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
, abstract = "We propose a method to evaluate signs of $2\times 2$ and
@ -14473,7 +14472,7 @@ whereas standard (polynomial) splines do not. Contains pseudocode."
, number = 4
, year = 1995
, pages = "568--572"
, url = "http://www.cs.brown.edu/cgc/papers/bclt-nmaaw-95.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/bclt-nmaaw-95.ps.gz"
, keywords = "algorithm animation, Java, Web, WWW, graph drawing, CGC, Brown"
, update = "97.03 tamassia, 96.09 tamassia"
}
@ -14485,7 +14484,7 @@ whereas standard (polynomial) splines do not. Contains pseudocode."
, nickname = "AVI '96"
, year = 1996
, pages = "203--212"
, url = "http://www.cs.brown.edu/cgc/papers/bclt-aawww-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/bclt-aawww-96.ps.gz"
, keywords = "algorithm animation, Java, Web, WWW, CGC, Brown"
, update = "97.03 tamassia, 96.09 tamassia"
}
@ -14496,7 +14495,7 @@ whereas standard (polynomial) splines do not. Contains pseudocode."
, booktitle = "Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year = 1996
, pages = "C3--C4"
, url = "http://www.cs.brown.edu/cgc/papers/bclt-agaow-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/bclt-agaow-96.ps.gz"
, keywords = "algorithm animation, Java, Web, WWW, CGC, Brown"
, cites = "bclt-nmaaw-95, ZZZ"
, update = "97.11 bibrelex, 97.03 tamassia, 96.09 tamassia, 96.05 efrat"
@ -14509,7 +14508,7 @@ whereas standard (polynomial) splines do not. Contains pseudocode."
, nickname = "AVI '96"
, year = 1996
, pages = "248--250"
, url = "http://www.cs.brown.edu/cgc/papers/bclt-maas-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/bclt-maas-96.ps.gz"
, keywords = "algorithm animation, Java, Web, WWW, CGC, Brown"
, update = "97.03 tamassia, 96.09 tamassia"
}
@ -18585,7 +18584,6 @@ the interior. Contains pseudocode."
, institution = "INRIA"
, address = "BP93, 06902 Sophia-Antipolis, France"
, year = 1995
, url = "http://www.inria.fr/RRRT/RR-2626"
, precedes = "bdds-cscot-97"
, update = "99.11 bibrelex, 99.07 devillers, 98.11 devillers, 97.03 devillers, 96.01 devillers"
, abstract = "This note presents a non trivial combination of two techniques previously used with randomized incremental algorithms: the lazy cleaning scheme \cite{bds-lric-94} to maintain structures with `non local' definition and the $O(n\log^{\star}n)$ acceleration when some additional information about the data is known \cite{s-sfira-91,cct-rpatd-92,d-rysoa-92}. Authors assume that the reader is somehow familiar with this techniques.
@ -21935,7 +21933,7 @@ where $d > 3 \sqrt 3$ denotes the distance between S and T."
, number = 7
, year = 1998
, pages = "1--31"
, url = "http://www.cs.brown.edu/publications/jgaa/accepted/98/Biedl98.2.7.ps.gz"
, url = "https://www.cs.brown.edu/publications/jgaa/accepted/98/Biedl98.2.7.ps.gz"
, succeeds = "b-nlbog-96"
, update = "00.03 vismara"
}
@ -23872,7 +23870,6 @@ In [BSBL93], the synthesis problem has been solved for a
, address = "Valbonne, France"
, month = apr
, year = 1991
, url = "http://www.inria.fr/RRRT/RR-1415"
, keywords = "Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography"
, precedes = "bcdt-osc3d-91i, bcdt-oscdt-96"
, update = "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.05 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
@ -23930,7 +23927,6 @@ of the output, and the extra storage is {$O(n)$}."
, number = 2160
, institution = "INRIA"
, year = 1994
, url = "http://www-sop.inria.fr/RRRT/RR-2160.html"
, precedes = "bcdkl-sppbd-99"
, update = "99.11 devillers, 99.07 devillers, 98.03 mitchell"
}
@ -24176,7 +24172,6 @@ must lie in the halfplanes delimited by the query lines."
, address = "Sophia-Antipolis, France"
, month = oct
, year = 1990
, url = "http://www.inria.fr/RRRT/RR-1293"
, precedes = "bdp-cu3ct-91"
, update = "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 milone+mitchell"
}
@ -24203,7 +24198,6 @@ must lie in the halfplanes delimited by the query lines."
, institution = "INRIA Sophia-Antipolis"
, address = "Valbonne, France"
, year = 1990
, url = "http://www.inria.fr/RRRT/RR-1285"
, succeeds = "bt-hrodt-86"
, precedes = "bdsty-olgag-91i"
, update = "99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 milone+mitchell"
@ -24271,7 +24265,6 @@ arrangements of curves in the plane and others."
, institution = "INRIA Sophia-Antipolis"
, address = "Valbonne, France"
, year = 1990
, url = "http://www.inria.fr/RRRT/RR-1207"
, keywords = "randomized algorithms, higher order Voronoi diagrams, dynamic algorithms"
, succeeds = "bdt-olcho-90, bt-hrodt-86"
, precedes = "bdt-schov-93"
@ -24430,7 +24423,7 @@ the computational geometry algorithms library CGAL."
, address = "Valbonne, France"
, month = apr
, year = 1992
, url = "http://www-sop.inria.fr/cgi-bin/wais_ra_sophia?question=1697"
, url = "https://www-sop.inria.fr/cgi-bin/wais_ra_sophia?question=1697"
, keywords = "shape reconstruction, medical images, Delaunay triangulation"
, update = "99.07 devillers, 95.09 devillers, 95.01 devillers, 93.09 held"
}
@ -24643,7 +24636,6 @@ present a polynomial-time exact algorithm to solve this problem."
, number = 3825
, institution = "INRIA"
, year = 1999
, url = "http://www.inria.fr/RRRT/RR-3825"
, cites = "b-oafsi-95, bo-arcgi-79, bs-ealcs-99, bp-rpsis-, c-stsar-94, ce-oails-92, cs-arscg-89, afl-rracg-98, k-ah-92, lpt-rpqid-99, p-iaeia-99, ps-cgi-90, s-ri-99, y-tegc-97, y-rgc-97"
, update = "00.03 devillers"
, abstract = "We propose several
@ -25563,7 +25555,7 @@ present a polynomial-time exact algorithm to solve this problem."
, number = "RT-INF-9-96"
, institution = "Dip. Discipline Scientifiche, Sez. Informatica, Univ. Roma III"
, year = 1996
, url = "http://www.cs.brown.edu/cgc/papers/bdll-pcrt-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/bdll-pcrt-96.ps.gz"
, keywords = "graph drawing, proximity, CGC, Brown"
, update = "97.03 tamassia"
}
@ -26988,7 +26980,7 @@ and solids on dynamically evolving grids without remeshing."
, title = "Optimal Compaction of Orthogonal Representations"
, booktitle = "CGC Workshop on Geometric Computing"
, year = 1998
, url = "http://www.cs.brown.edu/cgc/cgc98/"
, url = "https://www.cs.brown.edu/cgc/cgc98/"
, keywords = "graph drawing, planar, orthogonal"
, update = "98.11 tamassia"
}
@ -27016,7 +27008,7 @@ and solids on dynamically evolving grids without remeshing."
, publisher = "Springer-Verlag"
, year = 1997
, pages = "45--52"
, url = "http://www.cs.brown.edu/cgc/papers/bgt-gdtsw-97.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/bgt-gdtsw-97.ps.gz"
, keywords = "graph drawing, system, WWW, orthogonal, planarization, CGC, Brown"
, update = "98.07 vismara, 97.03 tamassia"
}
@ -27448,7 +27440,6 @@ and solids on dynamically evolving grids without remeshing."
, number = 3758
, institution = "INRIA"
, year = 1999
, url = "http://www.inria.fr/RRRT/RR-3758"
, archive = "XXX:cs.CG/9907025"
, cites = "h-bevv-56, bcddy-acchs-96"
, update = "99.11 devillers"
@ -31078,7 +31069,7 @@ determinants."
, publisher = "Springer-Verlag"
, year = 1997
, pages = "63--75"
, url = "http://www.cs.brown.edu/cgc/papers/cgkt-oaars-97.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/cgkt-oaars-97.ps.gz"
, keywords = "graph drawing, upward, tree, planar, straight-line, orthogonal, CGC, Brown"
, update = "98.07 agarwal, 98.03 smid, 97.11 bibrelex, 97.03 tamassia"
}
@ -31421,7 +31412,7 @@ determinants."
, site = "Waterloo, Canada"
, year = 1993
, pages = "67--72"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation, exact arithmetic"
, cites = "m-cacau-89, dbs-gttd-92, fm-nsala-91, fv-eeacg-93, h-gsm-89, kln-edtur-91, m-vigau-88t, m-cacau-89, m-rfldd-90, m-rflp-89, fw-lnum-93, si-cvdom-89, f-pcg-93, ZZZ"
, update = "98.11 bibrelex, 97.03 daniels, 93.09 milone+mitchell"
@ -31730,7 +31721,7 @@ determinants."
, title = "Finding Basis Functions for Pyramidal Finite Elements"
, booktitle = "CGC Workshop on Geometric Computing"
, year = 1998
, url = "http://www.cs.brown.edu/cgc/cgc98/"
, url = "https://www.cs.brown.edu/cgc/cgc98/"
, update = "98.11 tamassia"
}
@ -35104,7 +35095,7 @@ The algorithms can be extended to 3D with more complex data structures."
, booktitle = "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year = 1995
, pages = "139--149"
, url = "http://www.cs.brown.edu/cgc/papers/cggtvv-emga-95.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/cggtvv-emga-95.ps.gz"
, update = "97.03 tamassia, 95.05 tamassia, 95.01 tamassia"
}
@ -35159,7 +35150,7 @@ The algorithms can be extended to 3D with more complex data structures."
, volume = 25
, year = 1996
, pages = "207--233"
, url = "http://www.cs.brown.edu/cgc/papers/cpt-uadpl-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/cpt-uadpl-96.ps.gz"
, succeeds = "cpt-uadpl-93"
, update = "97.03 tamassia, 96.05 smid, 95.01 tamassia"
}
@ -35259,7 +35250,7 @@ The algorithms can be extended to 3D with more complex data structures."
, volume = 7
, year = 1997
, pages = "85--121"
, url = "http://www.cs.brown.edu/cgc/papers/ct-ospml-.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/ct-ospml-.ps.gz"
, keywords = "Shortest Path, Minimum-Link Path, dynamic algorithm, CGC, Brown"
, succeeds = "ct-ospml-94i"
, update = "98.07 mitchell, 97.11 bibrelex, 97.07 devillers, 97.03 tamassia, 96.09 tamassia, 95.01 tamassia"
@ -36242,7 +36233,7 @@ avoids overlap. This is useful in cartography."
, booktitle = "Proc. 12th Annu. ACM Sympos. Comput. Geom."
, year = 1996
, pages = "319--328"
, url = "http://www.cs.brown.edu/cgc/papers/cgt-cdgtt-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/cgt-cdgtt-96.ps.gz"
, keywords = "graph drawing, straight-line, 3D, convex, CGC, Brown"
, cites = "a-lbvsc-63, bh-olpgf-87, bo-lwbl-87, con-dpgn-85, cyn-lacdp-84, ck-cgd3c-93, cn-mwgdp-95, cp-ltadp-95, celr-tdgd-95, c-re-82, cw-mmap-90, cw-sfmps-82, dg-caitd-95, fpp-sssfe-88, fpp-hdpgg-90, dett-adgab-94, dtt-arsdp-92, dtv-olcpt-95, ds-ltati-92, eg-dspg-96, esw-tkbtd-95, f-slrpg-48, fhhklsww-dgphr-93, gt-pdara-94, gt-anda-87, g-cp-67, hr-udfs-94, hrs-cchpc-92, ht-dgtc-73, ht-ept-74, hk-prga-92, jj-3dlrg-95, k-dpguc-96, k-dpgul-92, ls-cavg-92, ld-cpdt3-95, lrt-gnd-79, lt-apst-80, mp-arpg-94, m-orfdf-64, ps-cgi-85, r-3dvpi-95, r-e3vpi-95, s-epgg-90, st-ce3cp-92, s-cm-51, sr-vudtd-34, t-pdfip-80, t-prg-84, t-crg-60, t-hdg-63, w-mspp-82, ZZZ"
, update = "98.11 bibrelex, 97.11 bibrelex, 97.03 tamassia, 96.09 tamassia"
@ -37879,7 +37870,7 @@ data. Contains C code."
, number = 5
, year = 1995
, pages = "970--1001"
, url = "http://www.cs.brown.edu/cgc/papers/cdtt-dgdts-95.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/cdtt-dgdts-95.ps.gz"
, keywords = "graph drawing, dynamic, planar, trees, series-parallel"
, succeeds = "cdttb-fdgd-92"
, update = "97.03 tamassia, 96.09 tamassia, 95.09 tamassia, 95 tamassia"
@ -37972,7 +37963,7 @@ data. Contains C code."
, volume = 13
, year = 1995
, pages = "245--265"
, url = "http://www.cs.brown.edu/cgc/papers/ct-det-95.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/ct-det-95.ps.gz"
, succeeds = "ct-detta-91"
, update = "97.03 tamassia, 95.01 tamassia, 95.01 tamassia"
}
@ -41130,7 +41121,7 @@ Contains C code."
, booktitle = "Proc. 1st ACM Workshop on Appl. Comput. Geom."
, year = 1996
, pages = "33--38"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "layout, nesting, placement, Minkowski sum, configuration space"
, comments = "to appear in Lecture Notes in Computer Science; submitted to
Internat. J. Comput. Geom. Appl."
@ -41143,7 +41134,7 @@ Contains C code."
, booktitle = "Proc. 6th Canad. Conf. Comput. Geom."
, year = 1994
, pages = "225--230"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "layout, packing, nesting, placement, reachability, Minkowski sum, configuration space, decomposition"
, cites = "dmr-fmaap-93, f-savd-87, l-tdvdl-80, lm-ccp-93, ZZZ"
, update = "98.11 bibrelex, 97.03 daniels, 94.09 jones"
@ -41155,7 +41146,7 @@ Contains C code."
, booktitle = "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
, year = 1995
, pages = "205--214"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "packing, layout, placement, nesting, Minkowski sum, configuration space"
, update = "97.03 daniels, 96.09 agarwal, 96.05 mitchell"
}
@ -41208,7 +41199,7 @@ Contains C code."
, site = "Waterloo, Canada"
, year = 1993
, pages = "322--327"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "optimization, monotone matrices, polygons, inclusion"
, precedes = "dmr-flaap -97"
, cites = "akmsw-gamsa-87, as-facle-87, aw-cg-88, c-tsplt-90i, cdl-cler-86, kk-altag-90, mos-fmrio-85, mdl-amm-91, mdl-pcnpc-92, ow-rv-88, ps-cgi-85, srw-gsv-cccg-91, nhl-merp-84, wy-ocsp-88, ZZZ"
@ -41221,7 +41212,7 @@ Contains C code."
, booktitle = "Proc. 8th Canad. Conf. Comput. Geom."
, year = 1996
, pages = "196--201"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "concave, polygons, decomposition"
, update = "97.03 agarwal+daniels, 96.09 mitchell"
}
@ -43601,7 +43592,7 @@ Contains C code."
, month = aug
, year = 2000
, pages = "??--??"
, url = "http://cs.smith.edu/~orourke/papers.html"
, url = "https://www.science.smith.edu/~jorourke/papers.php"
, cites = "ddo-ppnph2d-00"
, update = "01.04 icking, 00.11 smid, 00.07 orourke"
}
@ -43682,7 +43673,7 @@ Contains C code."
, month = jan
, year = 1999
, pages = "891--892"
, url = "http://www.siam.org/meetings/da99/"
, url = "https://archive.siam.org/meetings/da99/"
, update = "99.07 orourke"
}
@ -43759,7 +43750,7 @@ Contains C code."
, address = "Northampton, MA, USA"
, month = oct
, year = 2001
, url = "http://arXiv.org/abs/cs/0110054/"
, url = "https://arxiv.org/abs/cs/0110054"
, succeeds = "deeho-vusp-01"
, update = "01.11 orourke"
}
@ -43773,7 +43764,7 @@ Contains C code."
, address = "Northampton, MA, USA"
, month = jul
, year = 2001
, url = "http://arXiv.org/abs/cs/0107023/"
, url = "https://arXiv.org/abs/cs/0107023/"
, update = "01.11 orourke"
}
@ -44318,7 +44309,6 @@ Contains C code."
, number = 3451
, institution = "INRIA"
, year = 1998
, url = "http://www.inria.fr/RRRT/RR-3451"
, precedes = "d-ddt-99"
, update = "99.11 bibrelex, 99.07 devillers, 98.11 devillers"
, abstract = "This paper present how space of spheres and shelling can be used to delete efficiently a point from d-dimensional triangulation. In 2-dimension, if k is the degree of the deleted vertex, the complexity is $O(k\log k)$, but we notice that this number apply only to low cost operations; time consuming computations are done only a linear number of times. This algorithm can be viewed as a variation of Heller algorithm which is popular in the geographic information system community. Unfortunately Heller algorithm is false as explained in this paper."
@ -44382,7 +44372,6 @@ minimum spanning tree)."
, institution = "INRIA Sophia-Antipolis"
, address = "Valbonne, France"
, year = 1992
, url = "http://www.inria.fr/RRRT/RR-1619"
, keywords = "randomized algorithms, Delaunay triangulation, practical issue, degenerate cases"
, update = "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}
@ -44408,7 +44397,6 @@ minimum spanning tree)."
, institution = "INRIA Sophia-Antipolis"
, address = "Valbonne, France"
, year = 1990
, url = "http://www.inria.fr/RRRT/RR-1179"
, keywords = "polygon placement, contact configurations"
, precedes = "d-scspa-93"
, update = "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
@ -44740,7 +44728,6 @@ respectively, we obtain a speedup of $\frac p{\log p}$."
, institution = "INRIA Sophia-Antipolis"
, address = "Valbonne, France"
, year = 1992
, url = "http://www.inria.fr/RRRT/RR-1620"
, precedes = "dmt-ssgtu-92i"
, update = "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
}
@ -45657,7 +45644,7 @@ dimensions. Constants are small, and are given in the paper."
, publisher = "Springer-Verlag"
, year = 1997
, pages = "76--91"
, url = "http://www.cs.brown.edu/cgc/papers/dglpttvv-ddges-97.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/dglpttvv-ddges-97.ps.gz"
, keywords = "graph drawing, upward, experiments, CGC, Brown"
, update = "98.07 patrignani+tamassia+vismara, 97.11 bibrelex, 97.03 tamassia"
}
@ -45680,7 +45667,7 @@ dimensions. Constants are small, and are given in the paper."
, type = "Manuscript"
, institution = "Dept. of Computer Sci., Brown University"
, year = 1996
, url = "http://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
, keywords = "graph drawing, experiments, orthogonal"
, precedes = "dglttv-ecfgd-97"
, update = "97.03 tamassia, 96.09 tamassia"
@ -45694,7 +45681,7 @@ dimensions. Constants are small, and are given in the paper."
, volume = 7
, year = 1997
, pages = "303--325"
, url = "http://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
, keywords = "graph drawing, experiments, orthogonal, CGC, Brown"
, succeeds = "dglttv-ecfgd-96"
, update = "98.07 patrignani+tamassia+vismara, 97.07 devillers, 97.03 tamassia, 96.09 tamassia"
@ -45706,7 +45693,7 @@ dimensions. Constants are small, and are given in the paper."
, booktitle = "Proc. 11th Annu. ACM Sympos. Comput. Geom."
, year = 1995
, pages = "306--315"
, url = "http://www.cs.brown.edu/cgc/papers/dglttv-ectgd-95.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/dglttv-ectgd-95.ps.gz"
, keywords = "graph drawing, experiments, orthogonal"
, cites = "bcn-cdder-92, bfn-wigdp-85, bnt-ladfd-86, bbdl-tealf-91, bk-bhogd-94, con-dpgn-85, cp-ltadp-90, celr-tdgd-95, dh-dgnus-89, fpp-sssfe-88, fr-scpdt-84, dett-adgab-94, dgst-ads-90, dlv-sorod-93, dlt-pepg-84, eg-rpdfb-94, eg-glbdb-95, fr-gdfdp-91, gs-ssa-79, gnv-dptdd-88, h-celag-94, h-ggpig-95, jemwdt-npgda-91, jm-mpsne-96, k-vaor-89, kk-adgug-89, k-dpgul-92, k-adpg-93, k-mcvr-93, kb-pgap-92, l-aeglv-80, lmp-sbeac-94, lmps-trm1b-90, lms-gtrre-91, lms-la3be-93, nt-fapsd-84, pt-iabod-95, r-nmdpg-87, rt-rplbo-86, s-mncpe-84, stt-mvuhs-81, t-eggmn-87, tdb-agdrd-88, tt-uavrp-86, tt-pgelt-89, tt-gd-95, t-dgds-88, t-hdg-63, v-ucvc-81, w-npagt-90, w-cblsg-85, w-dpg-82, ZZZ"
, update = "01.04 icking, 98.11 bibrelex, 98.03 bibrelex, 97.03 tamassia, 96.09 tamassia, 95.05 tamassia"
@ -45820,7 +45807,7 @@ dimensions. Constants are small, and are given in the paper."
, publisher = "Springer-Verlag"
, year = 1996
, pages = "178--189"
, url = "http://www.cs.brown.edu/cgc/papers/dlw-swp-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/dlw-swp-96.ps.gz"
, keywords = "graph drawing"
, update = "98.11 bibrelex, 97.11 bibrelex, 97.03 tamassia, 96.09 tamassia"
}
@ -45842,7 +45829,7 @@ dimensions. Constants are small, and are given in the paper."
, journal = "J. Graph Algorithms Appl."
, volume = "3:4"
, year = 1999
, url = "http://www.cs.brown.edu/publications/jgaa/papers.html"
, url = "https://www.cs.brown.edu/publications/jgaa/papers.html"
, update = "00.03 vismara"
}
@ -46114,7 +46101,7 @@ dimensions. Constants are small, and are given in the paper."
, publisher = "Springer-Verlag"
, year = 1996
, pages = "81--91"
, url = "http://www.cs.brown.edu/cgc/papers/dtv-osrdp-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/dtv-osrdp-96.ps.gz"
, update = "99.11 bibrelex, 98.07 vismara, 97.03 tamassia"
}
@ -48478,7 +48465,7 @@ conjecture posed by O'Rourke and Supowit \cite{os-snhpd-83}."
, address = "Northampton, MA, USA"
, month = oct
, year = 2001
, url = "http://arXiv.org/abs/cs/0110059/"
, url = "https://arXiv.org/abs/cs/0110059/"
, comments = "Answers a question posed in bls-wcnfp-99"
, update = "01.11 orourke"
}
@ -49693,7 +49680,7 @@ library."
, author = "E. Durand"
, title = "Quasitiler 3.0 documentation"
, year = 1994
, url = "http//www.geom.umn.edu/apps/quasitiler/about.html"
, url = "http://www.geom.uiuc.edu/apps/quasitiler/about.html"
, update = "97.11 bibrelex"
}
@ -50766,7 +50753,7 @@ library."
, volume = 6
, year = 1996
, pages = "145--156"
, url = "http://www.cs.brown.edu/cgc/papers/elt-adhg-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/elt-adhg-96.ps.gz"
, succeeds = "elt-adhg-92"
, update = "97.03 tamassia, 96.09 devillers"
}
@ -54611,7 +54598,7 @@ algebraic geometry."
@misc{e-ga-
, author = "David Eppstein"
, title = "Geometry in Action"
, url = "http://www.ics.uci.edu/~eppstein/geom.html"
, url = "https://www.ics.uci.edu/~eppstein/geom.html"
, update = "97.03 tamassia"
}
@ -55925,7 +55912,7 @@ between all the vertices of the polygons."
, site = "Pacific Grove, CA"
, year = 1994
, pages = "498--502"
, url = "http://ptolemy.eecs.berkeley.edu"
, url = "https://ptolemy.berkeley.edu/"
, update = "98.03 bibrelex"
}
@ -59800,7 +59787,7 @@ reflection formula and derives a surprising relationship between them."
, month = jun
, year = 1991
, pages = "334--341"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "arrangements, implementing algorithms, robust geometric computation"
, cites = "cgl-pgd-83, eg-tsa-86, eos-calha-86, f-smpst-90, gt-tgt-87, g-as-72, gss-egbra-89, gs-pmgsc-85, h-pargc-89, hhk-tirgc-88, hk-prga-89, k-rmrs-89, lm-cschu-90, m-dpggt-89, m-vigau-88p, m-vigau-88a, m-utcpc-89, si-gafpa-88, si-cvd10-89, ZZZ"
, update = "98.11 bibrelex, 97.11 bibrelex, 97.03 daniels"
@ -63930,7 +63917,7 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
, volume = 6
, year = 1996
, pages = "333--356"
, url = "http://www.cs.brown.edu/cgc/papers/ggt-aoutd-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/ggt-aoutd-96.ps.gz"
, keywords = "graph drawing, tree, planar, upward"
, succeeds = "ggt-aeutd-93"
, update = "97.03 devillers+tamassia"
@ -63956,7 +63943,7 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
, publisher = "Springer-Verlag"
, year = 1997
, pages = "201--216"
, url = "http://www.cs.brown.edu/cgc/papers/gt-nmcfa-97.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/gt-nmcfa-97.ps.gz"
, keywords = "graph drawing, planar, orthogonal, grid"
, update = "99.03 vismara, 97.03 tamassia, 96.09 tamassia"
}
@ -63971,7 +63958,7 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
, publisher = "Springer-Verlag"
, year = 1994
, pages = "12--21"
, url = "http://www.cs.brown.edu/cgc/papers/gt-agd-94.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/gt-agd-94.ps.gz"
, keywords = "graph drawing"
, update = "97.11 bibrelex, 97.03 tamassia, 94.05 tamassia"
}
@ -63991,8 +63978,8 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
, type = "Manuscript"
, institution = "Dept. of Computer Sci., Brown University"
, year = 1996
, note = "Available at \url{http://www.cs.brown.edu/people/rt/fadiva/giotto3d.html}"
, url = "http://www.cs.brown.edu/people/rt/fadiva/giotto3d.html"
, note = "Available at \url{https://www.cs.brown.edu/people/rt/fadiva/giotto3d.html}"
, url = "https://www.cs.brown.edu/people/rt/fadiva/giotto3d.html"
, keywords = "graph drawing, 3D"
, update = "97.03 tamassia, 96.09 tamassia"
}
@ -64015,7 +64002,7 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
, series = "Lecture Notes Comput. Sci."
, publisher = "Springer-Verlag"
, year = 1997
, url = "http://www.cs.brown.edu/cgc/papers/gt-gsvhs-97.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/gt-gsvhs-97.ps.gz"
, keywords = "graph drawing, upward, 3D, CGC, Brown"
, update = "99.11 bibrelex, 97.03 tamassia"
}
@ -64059,7 +64046,7 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
, publisher = "Springer-Verlag"
, year = 1995
, pages = "286--297"
, url = "http://www.cs.brown.edu/cgc/papers/gt-ccurp-95.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/gt-ccurp-95.ps.gz"
, keywords = "graph drawing, planar, upward, rectilinear, orthogonal, NP-hardness"
, update = "97.03 tamassia, 95.01 tamassia"
}
@ -64085,7 +64072,7 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
, volume = 12
, year = 1995
, pages = "109--133"
, url = "http://www.cs.brown.edu/cgc/papers/gt-upt-95.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/gt-upt-95.ps.gz"
, keywords = "graph drawing, planar, upward, survey"
, update = "97.03 tamassia, 96.09 tamassia, 95.09 tamassia, 95.05 tamassia"
}
@ -64100,7 +64087,7 @@ Complete thesis available only on microfilm from Harvard, since Harvard did not
, publisher = "Springer-Verlag"
, year = 1996
, pages = "12--26"
, url = "http://www.cs.brown.edu/cgc/papers/gtv-dc-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/gtv-dc-96.ps.gz"
, keywords = "graph drawing, 3D, straight-line"
, update = "97.03 smid+tamassia"
}
@ -68869,7 +68856,7 @@ generated in O(dn2d+1) time. We present a simple proof that the (d -
, title = "{GMP}, The {GNU} Multiple Precision Arithmetic Library"
, edition = "2.0.2"
, year = 1996
, url = "http://gmplib.org/"
, url = "https://gmplib.org/"
, update = "02.03 devillers, 00.03 devillers"
}
@ -70364,7 +70351,7 @@ cos, etc."
, number = "Report B 96-11"
, institution = "Institut {f\"ur} Informatik, Freie Universit{\"a}t Berlin"
, year = 1996
, url = "http://www.inf.fu-berlin.de/pub/reports/tr-b-96-11.ps.gz, http://www.inf.fu-berlin.de/inst/pubs/tr-b-96-11.abstract.html"
, url = "https://www.inf.fu-berlin.de/pub/reports/tr-b-96-11.ps.gz, https://www.inf.fu-berlin.de/inst/pubs/tr-b-96-11.abstract.html"
, update = "98.03 mitchell"
}
@ -73908,7 +73895,7 @@ useful for geometric modeling or for ray tracing."
, title = "Algebraic Topology"
, publisher = "Cambridge University Press"
, year = 2001
, url = "http://www.math.cornell.edu/~hatcher/"
, url = "https://www.math.cornell.edu/~hatcher/"
, update = "01.11 orourke"
}
@ -76153,7 +76140,7 @@ processing. Contains C code."
, type = "Manuscript"
, institution = "Universit{\"a}t Passau, Innstra\ss e 33, 94030 Passau, Germany"
, year = 1996
, url = "http://www.uni-passau.de/~himsolt/Graphlet/GML"
, url = "https://www.uni-passau.de/~himsolt/Graphlet/GML"
, keywords = "graph drawing"
, update = "96.09 tamassia"
}
@ -84058,7 +84045,7 @@ fitting method."
, number = 1
, year = 1997
, pages = "1--25"
, url = "http://www.cs.brown.edu/publications/jgaa/accepted/97/JuengerMutzel97.1.1.ps.gz"
, url = "https://www.cs.brown.edu/publications/jgaa/accepted/97/JuengerMutzel97.1.1.ps.gz"
, keywords = "graph drawing, straight-line, planarization, crossings, experiments"
, succeeds = "jm-eha2s-96"
, update = "99.07 vismara, 98.07 tamassia+vismara"
@ -84900,7 +84887,7 @@ fitting method."
, month = aug
, year = 2000
, pages = "139--146"
, url = "http://cs.smith.edu/~orourke/ShortestPaths/"
, url = "https://www.science.smith.edu/~jorourke/ShortestPaths//"
, keywords = "shortest paths"
, update = "02.03 icking, 01.11 orourke, 01.04 icking+orourke, 00.11 smid, 00.07 orourke"
}
@ -85234,7 +85221,7 @@ fitting method."
, number = 2
, year = 1997
, pages = "81--88"
, url = "http://www.cs.brown.edu/cgc/papers/kltt-arvrt-97.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/kltt-arvrt-97.ps.gz"
, keywords = "graph drawing, visibility, tree, CGC, Brown"
, update = "98.11 tamassia, 97.03 tamassia"
}
@ -86661,7 +86648,6 @@ the R*-tree."
, number = 2874
, institution = "INRIA"
, year = 1996
, url = "http://www.inria.fr/rrrt/rr-2874.html"
, update = "02.03 devillers, 97.11 bibrelex"
, abstract = "A set of objects is $k$-pierceable if there exists a set of $k$ poin ts such that each object is pierced by (contains) at least one of these points. Finding the smallest integer $k$ such that a set is $k$-pierceable is NP-complete. In this technical report, we present efficient algorithms for findi ng a piercing set (i.e., a set of $k$ points as above) for several classes of convex objects and small values of $k$. In some of the cases, our algorithms imply known as well as new Helly-type theorems, thus adding to previous results of Danzer and Gr{\"u}nbaum who studied the case of axis-parallel boxes. The problems studied here are related to the collection of optimization problems in which one seeks the smallest scaling factor of a centrally symmetric convex object $K$, so that a set of points can be covered by $k$ congruent homothets of $K$."
}
@ -91777,7 +91763,7 @@ some 2 curves cross exponentially many times."
, nickname = "WAFR '98"
, year = 1998
, pages = "to appear"
, url = "http://www.cs.unc.edu/~dm/collision.html"
, url = "https://www.cs.unc.edu/~dm/collision.html"
, update = "98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
}
@ -95357,7 +95343,7 @@ addition to their own purposes before conducting the conversion."
, number = 5
, year = 1996
, pages = "253--260"
, url = "http://www.cs.brown.edu/cgc/papers/ll-domwt-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/ll-domwt-96.ps.gz"
, keywords = "graph drawing, planar, minimum weight triangulation"
, update = "98.11 tamassia, 97.03 tamassia, 96.01 liotta"
}
@ -95372,7 +95358,7 @@ addition to their own purposes before conducting the conversion."
, publisher = "Springer-Verlag"
, year = 1996
, pages = "373--384"
, url = "http://www.cs.brown.edu/cgc/papers/ll-hdomw-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/ll-hdomw-96.ps.gz"
, keywords = "graph drawing"
, update = "97.03 tamassia, 96.09 tamassia"
}
@ -95399,7 +95385,7 @@ addition to their own purposes before conducting the conversion."
, publisher = "Springer-Verlag"
, year = 1997
, pages = "286--302"
, url = "http://www.cs.brown.edu/cgc/papers/ll-pdog-97.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/ll-pdog-97.ps.gz"
, keywords = "graph drawing, proximity, CGC, Brown"
, update = "98.07 tamassia, 97.03 tamassia"
}
@ -96347,7 +96333,7 @@ addition to their own purposes before conducting the conversion."
, booktitle = "Proc. 9th Annu. ACM Sympos. Comput. Geom."
, year = 1993
, pages = "153--162"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "optimization, CAD, CAM, packing, layout, linear programming, motion planning, separation, configuration space, Minkowski sum"
, cites = "aks-oa1dt-90, b-amdsn-89, bb-msbdc-88, c-crmp-87, dhks-isccd-90, grs-kfcg-83, hss-cmpmi-84, kos-cmsrp-91i, l-sisri-84, m-hphc-90, mdl-amm-91, mdl-pcnpc-92, mw-cdrca-88, mfs-2dcmc-87, p-ccmsp-87, pb-cmfm-88, sss-tdczr-86, sp-cppca-92, w-otdcs-85, ZZZ"
, update = "98.07 bibrelex, 98.03 bibrelex, 97.03 daniels, 93.09 rote"
@ -96360,7 +96346,7 @@ addition to their own purposes before conducting the conversion."
, volume = 84
, year = 1995
, pages = "539--561"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "layout, packing, placement, linear programming, motion planning, Minkowski sum, configuration space"
, update = "97.03 daniels"
}
@ -96371,7 +96357,7 @@ addition to their own purposes before conducting the conversion."
, booktitle = "Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year = 1990
, pages = "235--243"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation"
, precedes = "lm-cschu-92"
, cites = "f-smpst-89, g-eadch-72, gss-egbra-89, m-cacau-89, m-dpggt-89, m-vigau-88p, si-cvd10-89, ZZZ"
@ -96385,7 +96371,7 @@ addition to their own purposes before conducting the conversion."
, volume = 8
, year = 1992
, pages = "345--364"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation"
, succeeds = "lm-cschu-90"
, update = "97.03 daniels"
@ -96398,7 +96384,7 @@ addition to their own purposes before conducting the conversion."
, site = "Waterloo, Canada"
, year = 1993
, pages = "7--11"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "packing, layout, motion planning, PSPACE"
, cites = "cosw-cds-84, hss-cmpmi-84, lm-cancp-93, ZZZ"
, update = "98.11 bibrelex, 98.03 mitchell, 97.03 daniels, 93.09 milone+mitchell"
@ -97363,7 +97349,7 @@ rectilinear polygon."
, publisher = "Springer-Verlag"
, year = 1997
, pages = "135--146"
, url = "http://www.cs.brown.edu/cgc/papers/lttv-argd-97.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/lttv-argd-97.ps.gz"
, keywords = "graph drawing, proximity, CGC, Brown"
, update = "98.07 tamassia, 97.03 tamassia"
}
@ -104690,7 +104676,7 @@ used in many computational geometry algorithms. Contains C++ code."
, booktitle = "Proc. 5th Annu. ACM Sympos. Comput. Geom."
, year = 1989
, pages = "197--207"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation"
, cites = "acm-aacad-88, acm-cad1b-84, acm-cad2a-84, c-qercf-75, cr-tlcra-88, em-sstcd-87, gy-frcg-86, hhk-tirgc-88, hhk-rsops-87, h-pargc-88, k-rmrs-89, kln-edtur-89, m-vigau-88a, m-vigau-88t, otu-nsga-87, r-paff-80, gss-egbra-89, ss-pmp2g-83, ss-ccsm-85, ss-pponp-88, s-aefsm-87, t-dmeag-51, y-gctsp-88, ZZZ"
, update = "98.03 bibrelex, 97.03 daniels"
@ -104702,7 +104688,7 @@ used in many computational geometry algorithms. Contains C++ code."
, booktitle = "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
, year = 1989
, pages = "500--505"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation"
, update = "98.03 agarwal, 97.03 daniels"
}
@ -104713,7 +104699,7 @@ used in many computational geometry algorithms. Contains C++ code."
, booktitle = "Proc. 7th Canad. Conf. Comput. Geom."
, year = 1995
, pages = "79--84"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "computer graphics, simulation, physically-based modeling, linear programming, Minkowski sum, configuration space"
, update = "97.03 daniels, 95.09 jones"
}
@ -104725,7 +104711,7 @@ used in many computational geometry algorithms. Contains C++ code."
, year = 1996
, pages = "129--136"
, note = "Proc. SIGGRAPH '96"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "computer graphics, animation, physically-based modeling, linear programming, Minkowski sum, configuration space"
, update = "97.03 daniels"
}
@ -104737,7 +104723,7 @@ used in many computational geometry algorithms. Contains C++ code."
, site = "Waterloo, Canada"
, year = 1993
, pages = "473--478"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation"
, cites = "ck-acp-70, b-tends-67, cs-arscg-89, e-acg-87, f-smpst-90, f-savd-87, fm-nsala-91, ghms-apsml-91, hhk-tirgc-88, iss-nriac-92, l-knnvd-82, ld-gvdp-81, lm-cschu-90, m-vigau-88a, m-cacau-89, ms-saps-92, sh-cpp-75, si-cvd10-89, ls-ippvd-87, ls-pptmc-87, m-dpggt-89, ZZZ"
, update = "98.11 bibrelex, 97.03 daniels, 93.09 milone+mitchell"
@ -104750,7 +104736,7 @@ used in many computational geometry algorithms. Contains C++ code."
, volume = 25
, number = 9
, year = 1993
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "algorithms, polygons, geometric modeling"
, update = "98.03 agarwal, 97.03 daniels, 96.05 pascucci"
}
@ -104771,7 +104757,7 @@ used in many computational geometry algorithms. Contains C++ code."
, booktitle = "Proc. 2nd Canad. Conf. Comput. Geom."
, year = 1990
, pages = "40--45"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation, geometric rounding"
, cites = "ZZZ"
, update = "98.07 bibrelex, 97.03 daniels"
@ -104783,7 +104769,7 @@ used in many computational geometry algorithms. Contains C++ code."
, booktitle = "Abstracts 1st Canad. Conf. Comput. Geom."
, year = 1989
, pages = 12
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation, geometric rounding"
, update = "97.03 daniels"
}
@ -104794,7 +104780,7 @@ used in many computational geometry algorithms. Contains C++ code."
, booktitle = "Proc. 28th Annu. ACM Sympos. Theory Comput."
, year = 1996
, pages = "109--118"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "layout, packing, placement, nesting, concave, polygons, Minkowski sum, configuration space"
, update = "97.03 daniels"
}
@ -104857,7 +104843,7 @@ used in many computational geometry algorithms. Contains C++ code."
, booktitle = "Proc. 3rd Canad. Conf. Comput. Geom."
, year = 1991
, pages = "243--246"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "layout, nesting, placement, optimization"
, update = "97.03 daniels"
}
@ -104868,7 +104854,7 @@ used in many computational geometry algorithms. Contains C++ code."
, booktitle = "Proc. 4th Canad. Conf. Comput. Geom."
, year = 1992
, pages = "236--243"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "concave, polygons, layout, nesting, packing, optimization, Minkowski sum, configuration space"
, cites = "dhks-isccd-90, g-ctfsr-86, grs-kfcg-83, kos-cmsrp-91i, ml-sipat-91, mdl-amm-91, s-iamm-82, tw-cmm-73, nh-aplpg-84, s-iamm-88, ZZZ"
, update = "98.07 bibrelex, 97.03 daniels"
@ -104881,7 +104867,7 @@ used in many computational geometry algorithms. Contains C++ code."
, site = "Waterloo, Canada"
, year = 1993
, pages = "485--490"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "geometric modeling, quaternion arithmetic, basis reduction, integer programming, exact arithmetic"
, precedes = "mm-roaom-97"
, cites = "cdr-rrmrg-92, c-sede-92, crss-igbra-91, e-sap-80, fw-eeacg-92, h-eq-69, kln-edtur-89, mn-fccrp-90a, m-rfldd-90, r-srsrf-77, lll-fprc-82, l-atngc-86, ls-gbra-92, m-rflp-89, s-qrm-78"
@ -104894,7 +104880,7 @@ used in many computational geometry algorithms. Contains C++ code."
, booktitle = "Proc. 6th Annu. ACM Sympos. Comput. Geom."
, year = 1990
, pages = "244--252"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation"
, precedes = "mn-fccrp-90a"
, cites = "gj-cigtn-79, gps-crotr-89, h-gsm-89, m-rflp-89, mn-fccrp-90a, m-utcpc-89, s-fprgo-89, tt-pgelt-89, ZZZ"
@ -104910,7 +104896,7 @@ used in many computational geometry algorithms. Contains C++ code."
, month = sep
, year = 1990
, pages = "753--769"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation"
, succeeds = "mn-fccrp-90i"
, update = "98.11 bibrelex, 97.03 daniels"
@ -104943,7 +104929,7 @@ used in many computational geometry algorithms. Contains C++ code."
, booktitle = "Proc. 7th Canad. Conf. Comput. Geom."
, year = 1995
, pages = "55--60"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation, shortest-path rounding, nonuniform grids, geometric modeling, geometric rounding"
, update = "97.03 daniels, 95.09 jones"
}
@ -104989,7 +104975,7 @@ used in many computational geometry algorithms. Contains C++ code."
, volume = 37
, year = 1988
, pages = "377--401"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "robust geometric computation"
, succeeds = "m-vigau-88p, m-vigau-88t"
, update = "98.11 bibrelex, 97.03 daniels, 95.01 devillers"
@ -105010,7 +104996,7 @@ used in many computational geometry algorithms. Contains C++ code."
, volume = 7
, year = 1997
, pages = "25--35"
, url = "http://www.cs.miami.edu/~vjm/papers.html"
, url = "https://www.cs.miami.edu/home/vjm/papers.html"
, keywords = "geometric modeling, quaternion arithmetic, basis reduction, integer programming, exact arithmetic"
, succeeds = "mm-roaom-93"
, update = "97.03 daniels"
@ -109344,11 +109330,11 @@ problems in computational geometry is presented."
, update = "96.01 held+mitchell"
}
@article{nan2017polyfit,
title = {PolyFit: Polygonal Surface Reconstruction from Point Clouds},
author = {Nan, Liangliang and Wonka, Peter},
journal = {ICCV},
year = {2017}
@article{nan2017polyfit,
title = {PolyFit: Polygonal Surface Reconstruction from Point Clouds},
author = {Nan, Liangliang and Wonka, Peter},
journal = {ICCV},
year = {2017}
}
@article{nhl-merp-84
@ -110721,7 +110707,6 @@ envelope of line segments."
, number = 1
, year = 1998
, pages = "39--66"
, url = "http://www.inria.fr/RRRT/RR-2575"
, succeeds = "ny-oscha-94"
, update = "99.11 bibrelex, 99.07 devillers, 98.07 devillers"
, abstract = "A set of planar objects is said to be of type $m$ if the
@ -111527,7 +111512,6 @@ encapsulated PostScript"
, address = "France"
, year = 1998
, note = "TU-0606"
, url = "http://www.inria.fr/RRRT/TU-0606"
, keywords = "doctoral thesis"
, update = "00.03 devillers"
}
@ -113167,7 +113151,7 @@ small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction
, edition = "2nd"
, publisher = "Cambridge University Press"
, year = 1998
, url = "http://cs.smith.edu/~orourke/books/compgeom.html"
, url = "https://www.science.smith.edu/~jorourke/books/compgeom.html"
, comments = "Printed 28 Sep 1998"
, update = "01.11 orourke, 99.11 bibrelex, 98.11 orourke"
, annote = "Textbook"
@ -113362,8 +113346,8 @@ small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction
, month = jun
, year = 2000
, note = "LANL arXiv cs.CG/0006035 v3,
\url{http://cs.smith.edu/~orourke/papers.html}"
, url = "http://cs.smith.edu/~orourke/papers.html"
\url{https://www.science.smith.edu/~jorourke/papers.php}"
, url = "https://www.science.smith.edu/~jorourke/papers.php"
, archive = "LANL arXiv cs.CG/0006035 v3"
, keywords = "polygonal chains, polytopes, polyhedra"
, cites = "c-cses-89, s-usedkkk-21"
@ -117683,7 +117667,6 @@ both for rendering and for modeling. Contains C code."
, address = "France"
, year = 1999
, note = "TU-0619"
, url = "http://www.inria.fr/rrrt/tu-0619.html"
, keywords = "doctoral thesis"
, update = "02.03 devillers, 00.03 devillers"
}
@ -128644,7 +128627,7 @@ Contains C code."
, type = "Technical {Report}"
, institution = "Courant Institute, New York University"
, year = 1996
, url = "http://cs.nyu.edu"
, url = "https://cs.nyu.edu/"
, update = "97.11 bibrelex"
}
@ -136211,7 +136194,7 @@ Contains C code."
, number = 9
, year = 1990
, pages = "27--39"
, url = "http://www.cc.gatech.edu/gvu/softviz/algoanim/xtango.html"
, url = "https://www.cc.gatech.edu/gvu/ii/softvis/algoanim/xtango.html"
, update = "96.01 tamassia"
}
@ -139116,7 +139099,7 @@ code."
, number = 1
, year = 1996
, pages = "23--26"
, url = "http://www.cs.brown.edu/cgc/papers/t-ds-96.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/t-ds-96.ps.gz"
, keywords = "data structures, survey"
, update = "97.03 tamassia"
}
@ -139145,7 +139128,7 @@ code."
@misc{t-gd-
, author = "Roberto Tamassia"
, title = "Graph Drawing"
, url = "http://www.cs.brown.edu/people/rt/gd.html"
, url = "http://graphdrawing.org/index.html"
, update = "98.07 tamassia"
}
@ -139159,7 +139142,7 @@ code."
, address = "Boca Raton, FL"
, year = 1997
, pages = "815--832"
, url = "http://www.cs.brown.edu/cgc/papers/t-gd-97.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/t-gd-97.ps.gz"
, keywords = "graph drawing, survey"
, update = "97.11 orourke, 97.07 orourke, 97.03 tamassia"
}
@ -139254,7 +139237,7 @@ code."
, publisher = "CRC Press"
, year = 1997
, pages = "86--110"
, url = "http://www.cs.brown.edu/cgc/papers/tc-ds-.ps.gz"
, url = "https://www.cs.brown.edu/cgc/papers/tc-ds-.ps.gz"
, keywords = "data structures, survey"
, update = "97.03 tamassia"
}
@ -139289,7 +139272,7 @@ code."
, number = 4
, year = 1996
, pages = "591--606"
, url = "http://www.cs.brown.edu/people/rt/sdcr/report.html"
, url = "https://www.cs.brown.edu/people/rt/sdcr/report.html"
, update = "98.07 tamassia+vismara, 97.03 tamassia"
, annote = "short form of taacddfdhopsstvw-sdcg-96"
}
@ -141035,7 +141018,7 @@ code."
, title = "Hexahedral decomposition of polyhedra"
, month = oct
, year = 1993
, url = "http://www.ics.uci.edu/~eppstein/gina/Thurston-hexahedra"
, url = "https://www.ics.uci.edu/~eppstein/gina/Thurston-hexahedra"
, update = "97.11 bibrelex"
}
@ -144105,7 +144088,7 @@ of geometric optics."
@misc{v-qfemg-95
, author = "S. Vavasis"
, title = "QMG: a finite element mesh generation package"
, url = "http://www.cs.cornell.edu/Info/People/vavasis/qmg-home.html"
, url = "https://www.cs.cornell.edu/info/people/vavasis/qmg-home.html"
, update = "97.11 bibrelex"
}
@ -151845,7 +151828,7 @@ amplification and suppression of local contrast. Contains C code."
, keywords = {Computer Science - Computational Geometry, Computer Science - Data Structures and Algorithms}
, year = 2012
, month = may
, adsurl = {http://adsabs.harvard.edu/abs/2012arXiv1205.5434H}
, adsurl = {https://ui.adsabs.harvard.edu/abs/2012arXiv1205.5434H/abstract}
, adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@ -152040,7 +152023,7 @@ pages = {179--189}
Booktitle = {24rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
Year = {2013},
Pages = {1646--1655},
Url = {http://jeffe.cs.illinois.edu/pubs/pdf/dehn.pdf}
Url = {https://jeffe.cs.illinois.edu/pubs/pdf/dehn.pdf}
}
@InProceedings{lr-hts-12,
@ -152059,7 +152042,7 @@ pages = {179--189}
Volume = {45},
Pages = {215--224},
Year = {2012},
Url = {http://monge.univ-mlv.fr/~colinde/pub/09edgewidth.pdf}
Url = {https://monge.univ-mlv.fr/~colinde/pub/09edgewidth.pdf}
@inproceedings{tang2009interactive,
title={Interactive Hausdorff distance computation for general polygonal models},

55
Documentation/doc/resources/1.8.13/BaseDoxyfile.in
View File

@ -1,7 +1,7 @@
# Doxyfile 1.8.13
# This file describes the settings to be used by the documentation system
# doxygen (www.doxygen.org) for a project.
# doxygen (https://www.doxygen.nl/) for a project.
#
# All text after a double hash (##) is considered a comment and is placed in
# front of the TAG it is preceding.
@ -20,7 +20,7 @@
# This tag specifies the encoding used for all characters in the config file
# that follow. The default is UTF-8 which is also the encoding used for all text
# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
# built into libc) for the transcoding. See https://www.gnu.org/software/libiconv/
# for the list of possible encodings.
# The default value is: UTF-8.
@ -409,7 +409,7 @@ EXTENSION_MAPPING = txt=C++
# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
# according to the Markdown format, which allows for more readable
# documentation. See http://daringfireball.net/projects/markdown/ for details.
# documentation. See https://daringfireball.net/projects/markdown/ for details.
# The output of markdown processing is further processed by doxygen, so you can
# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
# case of backward compatibilities issues.
@ -451,7 +451,7 @@ BUILTIN_STL_SUPPORT = YES
CPP_CLI_SUPPORT = NO
# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
# https://riverbankcomputing.com/software/sip/intro) sources only. Doxygen
# will parse them like normal C++ but will assume all classes use public instead
# of private inheritance when no explicit protection keyword is present.
# The default value is: NO.
@ -834,7 +834,7 @@ LAYOUT_FILE = ${CGAL_DOC_RESOURCE_DIR}/DoxygenLayoutPackage.xml
# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
# the reference definitions. This must be a list of .bib files. The .bib
# extension is automatically appended if omitted. This requires the bibtex tool
# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info.
# For LaTeX the style of the bibliography can be controlled using
# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
# search path. See also \cite for info how to create references.
@ -922,7 +922,7 @@ INPUT =
# This tag can be used to specify the character encoding of the source files
# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
# documentation (see: http://www.gnu.org/software/libiconv) for the list of
# documentation (see: https://www.gnu.org/software/libiconv/) for the list of
# possible encodings.
# The default value is: UTF-8.
@ -1138,7 +1138,7 @@ SOURCE_TOOLTIPS = YES
# If the USE_HTAGS tag is set to YES then the references to source code will
# point to the HTML generated by the htags(1) tool instead of doxygen built-in
# source browser. The htags tool is part of GNU's global source tagging system
# (see http://www.gnu.org/software/global/global.html). You will need version
# (see https://www.gnu.org/software/global/global.html). You will need version
# 4.8.6 or higher.
#
# To use it do the following:
@ -1283,7 +1283,7 @@ HTML_EXTRA_FILES =
# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
# will adjust the colors in the style sheet and background images according to
# this color. Hue is specified as an angle on a colorwheel, see
# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
# https://en.wikipedia.org/wiki/Hue for more information. For instance the value
# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
# purple, and 360 is red again.
# Minimum value: 0, maximum value: 359, default value: 220.
@ -1342,7 +1342,7 @@ HTML_INDEX_NUM_ENTRIES = 100
# If the GENERATE_DOCSET tag is set to YES, additional index files will be
# generated that can be used as input for Apple's Xcode 3 integrated development
# environment (see: http://developer.apple.com/tools/xcode/), introduced with
# environment (see: https://developer.apple.com/xcode/), introduced with
# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
# Makefile in the HTML output directory. Running make will produce the docset in
# that directory and running make install will install the docset in
@ -1387,7 +1387,7 @@ DOCSET_PUBLISHER_NAME = Publisher
# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
# (see: https://www.microsoft.com/en-us/download/default.aspx) on
# Windows.
#
# The HTML Help Workshop contains a compiler that can convert all HTML output
@ -1463,7 +1463,7 @@ QCH_FILE =
# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
# Project output. For more information please see Qt Help Project / Namespace
# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
# (see: https://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace).
# The default value is: org.doxygen.Project.
# This tag requires that the tag GENERATE_QHP is set to YES.
@ -1471,8 +1471,7 @@ QHP_NAMESPACE = org.doxygen.Project
# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
# Help Project output. For more information please see Qt Help Project / Virtual
# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
# folders).
# Folders (see: https//doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual-folders).
# The default value is: doc.
# This tag requires that the tag GENERATE_QHP is set to YES.
@ -1480,23 +1479,21 @@ QHP_VIRTUAL_FOLDER = doc
# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
# filter to add. For more information please see Qt Help Project / Custom
# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
# filters).
# Filters (see: https//doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
# This tag requires that the tag GENERATE_QHP is set to YES.
QHP_CUST_FILTER_NAME =
# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
# custom filter to add. For more information please see Qt Help Project / Custom
# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
# filters).
# Filters (see: https//doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
# This tag requires that the tag GENERATE_QHP is set to YES.
QHP_CUST_FILTER_ATTRS =
# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
# project's filter section matches. Qt Help Project / Filter Attributes (see:
# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
# https//doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
# This tag requires that the tag GENERATE_QHP is set to YES.
QHP_SECT_FILTER_ATTRS =
@ -1601,7 +1598,7 @@ FORMULA_FONTSIZE = 10
FORMULA_TRANSPARENT = YES
# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
# http://www.mathjax.org) which uses client side Javascript for the rendering
# https://www.mathjax.org) which uses client side Javascript for the rendering
# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
# installed or if you want to formulas look prettier in the HTML output. When
# enabled you may also need to install MathJax separately and configure the path
@ -1613,7 +1610,7 @@ USE_MATHJAX = YES
# When MathJax is enabled you can set the default output format to be used for
# the MathJax output. See the MathJax site (see:
# http://docs.mathjax.org/en/latest/output.html) for more details.
# https://docs.mathjax.org/en/latest/output/index.html) for more details.
# Possible values are: HTML-CSS (which is slower, but has the best
# compatibility), NativeMML (i.e. MathML) and SVG.
# The default value is: HTML-CSS.
@ -1628,7 +1625,7 @@ MATHJAX_FORMAT = HTML-CSS
# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
# Content Delivery Network so you can quickly see the result without installing
# MathJax. However, it is strongly recommended to install a local copy of
# MathJax from http://www.mathjax.org before deployment.
# MathJax from https://www.mathjax.org before deployment.
# The default value is: https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.2.
# This tag requires that the tag USE_MATHJAX is set to YES.
@ -1644,7 +1641,7 @@ MATHJAX_EXTENSIONS = TeX/AMSmath \
# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
# of code that will be used on startup of the MathJax code. See the MathJax site
# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
# (see: https://docs.mathjax.org/en/latest/output/index.html) for more details. For an
# example see the documentation.
# This tag requires that the tag USE_MATHJAX is set to YES.
@ -1691,7 +1688,7 @@ SERVER_BASED_SEARCH = NO
#
# Doxygen ships with an example indexer (doxyindexer) and search engine
# (doxysearch.cgi) which are based on the open source search engine library
# Xapian (see: http://xapian.org/).
# Xapian (see: https://xapian.org/).
#
# See the section "External Indexing and Searching" for details.
# The default value is: NO.
@ -1704,7 +1701,7 @@ EXTERNAL_SEARCH = NO
#
# Doxygen ships with an example indexer (doxyindexer) and search engine
# (doxysearch.cgi) which are based on the open source search engine library
# Xapian (see: http://xapian.org/). See the section "External Indexing and
# Xapian (see: https://xapian.org/). See the section "External Indexing and
# Searching" for details.
# This tag requires that the tag SEARCHENGINE is set to YES.
@ -1891,7 +1888,7 @@ LATEX_SOURCE_CODE = NO
# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
# bibliography, e.g. plainnat, or ieeetr. See
# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
# https://en.wikipedia.org/wiki/BibTeX and \cite for more info.
# The default value is: plain.
# This tag requires that the tag GENERATE_LATEX is set to YES.
@ -2074,7 +2071,7 @@ DOCBOOK_PROGRAMLISTING = NO
#---------------------------------------------------------------------------
# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
# AutoGen Definitions (see http://autogen.sf.net) file that captures the
# AutoGen Definitions (see https://autogen.sourceforge.net/) file that captures the
# structure of the code including all documentation. Note that this feature is
# still experimental and incomplete at the moment.
# The default value is: NO.
@ -2271,7 +2268,7 @@ CLASS_DIAGRAMS = NO
# You can define message sequence charts within doxygen comments using the \msc
# command. Doxygen will then run the mscgen tool (see:
# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
# https://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
# documentation. The MSCGEN_PATH tag allows you to specify the directory where
# the mscgen tool resides. If left empty the tool is assumed to be found in the
# default search path.
@ -2293,7 +2290,7 @@ HIDE_UNDOC_RELATIONS = YES
# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
# available from the path. This tool is part of Graphviz (see:
# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
# https://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
# Bell Labs. The other options in this section have no effect if this option is
# set to NO
# The default value is: NO.
@ -2448,7 +2445,7 @@ DIRECTORY_GRAPH = NO
# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
# generated by dot. For an explanation of the image formats see the section
# output formats in the documentation of the dot tool (Graphviz (see:
# http://www.graphviz.org/)).
# https://www.graphviz.org/)).
# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
# to make the SVG files visible in IE 9+ (other browsers do not have this
# requirement).

4
Documentation/doc/resources/1.8.13/footer.html
View File

@ -8,14 +8,14 @@ move the footer to the bottom of the page. -->
<ul>
$navpath
<li class="footer">$generatedby
<a href="https://www.doxygen.org/index.html">
<a href="https://www.doxygen.nl/index.html">
<img class="footer" src="$relpath^doxygen.png" alt="doxygen"/></a> $doxygenversion </li>
</ul>
</div>
<!--END GENERATE_TREEVIEW-->
<!--BEGIN !GENERATE_TREEVIEW-->
<hr class="footer"/><address class="footer"><small>
$generatedby &#160;<a href="https://www.doxygen.org/index.html">
$generatedby &#160;<a href="https://www.doxygen.nl/index.html">
<img class="footer" src="$relpath^doxygen.png" alt="doxygen"/>
</a> $doxygenversion
</small></address>

2
Documentation/doc/resources/1.8.13/header.html
View File

@ -1,6 +1,6 @@
<!-- HTML header for doxygen 1.8.13-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<html xmlns="https://www.w3.org/1999/xhtml">
<head>
<link rel="icon" type="image/png" href="$relpath$../Manual/g-196x196-doc.png"/>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>

2
Documentation/doc/resources/1.8.13/header_package.html
View File

@ -1,6 +1,6 @@
<!-- HTML header for doxygen 1.8.13-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<html xmlns="https://www.w3.org/1999/xhtml">
<head>
<link rel="icon" type="image/png" href="$relpath$../Manual/g-196x196-doc.png" />
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>

16
Documentation/doc/resources/1.8.14/BaseDoxyfile.in
View File

@ -1,7 +1,7 @@
# Doxyfile 1.8.14
# This file describes the settings to be used by the documentation system
# doxygen (www.doxygen.org) for a project.
# doxygen (https://www.doxygen.nl/) for a project.
#
# All text after a double hash (##) is considered a comment and is placed in
# front of the TAG it is preceding.
@ -404,7 +404,7 @@ EXTENSION_MAPPING = txt=C++
# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
# according to the Markdown format, which allows for more readable
# documentation. See http://daringfireball.net/projects/markdown/ for details.
# documentation. See https://daringfireball.net/projects/markdown/ for details.
# The output of markdown processing is further processed by doxygen, so you can
# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
# case of backward compatibilities issues.
@ -1333,7 +1333,7 @@ HTML_INDEX_NUM_ENTRIES = 100
# If the GENERATE_DOCSET tag is set to YES, additional index files will be
# generated that can be used as input for Apple's Xcode 3 integrated development
# environment (see: https://developer.apple.com/tools/xcode/), introduced with
# environment (see: https://developer.apple.com/xcode/), introduced with
# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
# Makefile in the HTML output directory. Running make will produce the docset in
# that directory and running make install will install the docset in
@ -1601,7 +1601,7 @@ USE_MATHJAX = YES
# When MathJax is enabled you can set the default output format to be used for
# the MathJax output. See the MathJax site (see:
# http://docs.mathjax.org/en/latest/output.html) for more details.
# https://docs.mathjax.org/en/latest/output/index.html) for more details.
# Possible values are: HTML-CSS (which is slower, but has the best
# compatibility), NativeMML (i.e. MathML) and SVG.
# The default value is: HTML-CSS.
@ -1632,7 +1632,7 @@ MATHJAX_EXTENSIONS = TeX/AMSmath \
# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
# of code that will be used on startup of the MathJax code. See the MathJax site
# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
# (see: https://docs.mathjax.org/en/latest/output/index.html) for more details. For an
# example see the documentation.
# This tag requires that the tag USE_MATHJAX is set to YES.
@ -2062,7 +2062,7 @@ DOCBOOK_PROGRAMLISTING = NO
#---------------------------------------------------------------------------
# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
# AutoGen Definitions (see http://autogen.sourceforge.net/) file that captures
# AutoGen Definitions (see https://autogen.sourceforge.net/) file that captures
# the structure of the code including all documentation. Note that this feature
# is still experimental and incomplete at the moment.
# The default value is: NO.
@ -2266,7 +2266,7 @@ HIDE_UNDOC_RELATIONS = YES
# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
# available from the path. This tool is part of Graphviz (see:
# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
# https://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
# Bell Labs. The other options in this section have no effect if this option is
# set to NO
# The default value is: NO.
@ -2421,7 +2421,7 @@ DIRECTORY_GRAPH = NO
# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
# generated by dot. For an explanation of the image formats see the section
# output formats in the documentation of the dot tool (Graphviz (see:
# http://www.graphviz.org/)).
# https://www.graphviz.org/)).
# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
# to make the SVG files visible in IE 9+ (other browsers do not have this
# requirement).

4
Documentation/doc/resources/1.8.14/footer.html
View File

@ -8,14 +8,14 @@ move the footer to the bottom of the page. -->
<ul>
$navpath
<li class="footer">$generatedby
<a href="https://www.doxygen.org/index.html">
<a href="https://www.doxygen.nl/">
<img class="footer" src="$relpath^doxygen.png" alt="doxygen"/></a> $doxygenversion </li>
</ul>
</div>
<!--END GENERATE_TREEVIEW-->
<!--BEGIN !GENERATE_TREEVIEW-->
<hr class="footer"/><address class="footer"><small>
$generatedby &#160;<a href="https://www.doxygen.org/index.html">
$generatedby &#160;<a href="https://www.doxygen.nl/index.html">
<img class="footer" src="$relpath^doxygen.png" alt="doxygen"/>
</a> $doxygenversion
</small></address>

2
Documentation/doc/resources/1.8.14/header.html
View File

@ -1,6 +1,6 @@
<!-- HTML header for doxygen 1.8.13-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<html xmlns="https://www.w3.org/1999/xhtml">
<head>
<link rel="icon" type="image/png" href="$relpath$../Manual/g-196x196-doc.png"/>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>

2
Documentation/doc/resources/1.8.14/header_package.html
View File

@ -1,6 +1,6 @@
<!-- HTML header for doxygen 1.8.13-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<html xmlns="https://www.w3.org/1999/xhtml">
<head>
<link rel="icon" type="image/png" href="$relpath$../Manual/g-196x196-doc.png"/>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>

12
Documentation/doc/resources/1.8.20/BaseDoxyfile.in
View File

@ -1,7 +1,7 @@
# Doxyfile 1.8.20
# This file describes the settings to be used by the documentation system
# doxygen (www.doxygen.org) for a project.
# doxygen (https://www.doxygen.nl/) for a project.
#
# All text after a double hash (##) is considered a comment and is placed in
# front of the TAG it is preceding.
@ -1683,7 +1683,7 @@ USE_MATHJAX = YES
# When MathJax is enabled you can set the default output format to be used for
# the MathJax output. See the MathJax site (see:
# http://docs.mathjax.org/en/latest/output.html) for more details.
# https://docs.mathjax.org/en/latest/output/index.html) for more details.
# Possible values are: HTML-CSS (which is slower, but has the best
# compatibility), NativeMML (i.e. MathML) and SVG.
# The default value is: HTML-CSS.
@ -1714,7 +1714,7 @@ MATHJAX_EXTENSIONS = TeX/AMSmath \
# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
# of code that will be used on startup of the MathJax code. See the MathJax site
# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
# (see: https://docs.mathjax.org/en/latest/output/index.html) for more details. For an
# example see the documentation.
# This tag requires that the tag USE_MATHJAX is set to YES.
@ -2146,7 +2146,7 @@ DOCBOOK_OUTPUT = docbook
#---------------------------------------------------------------------------
# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
# AutoGen Definitions (see http://autogen.sourceforge.net/) file that captures
# AutoGen Definitions (see https://autogen.sourceforge.net/) file that captures
# the structure of the code including all documentation. Note that this feature
# is still experimental and incomplete at the moment.
# The default value is: NO.
@ -2350,7 +2350,7 @@ HIDE_UNDOC_RELATIONS = YES
# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
# available from the path. This tool is part of Graphviz (see:
# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
# https://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
# Bell Labs. The other options in this section have no effect if this option is
# set to NO
# The default value is: NO.
@ -2505,7 +2505,7 @@ DIRECTORY_GRAPH = NO
# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
# generated by dot. For an explanation of the image formats see the section
# output formats in the documentation of the dot tool (Graphviz (see:
# http://www.graphviz.org/)).
# https://www.graphviz.org/)).
# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
# to make the SVG files visible in IE 9+ (other browsers do not have this
# requirement).

4
Documentation/doc/resources/1.8.20/footer.html
View File

@ -7,13 +7,13 @@ move the footer to the bottom of the page. -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
$navpath
<li class="footer">$generatedby <a href="http://www.doxygen.org/index.html"><img class="footer" src="$relpath^doxygen.svg" width="104" height="31" alt="doxygen"/></a> $doxygenversion </li>
<li class="footer">$generatedby <a href="https://www.doxygen.nl/index.html"><img class="footer" src="$relpath^doxygen.svg" width="104" height="31" alt="doxygen"/></a> $doxygenversion </li>
</ul>
</div>
<!--END GENERATE_TREEVIEW-->
<!--BEGIN !GENERATE_TREEVIEW-->
<hr class="footer"/><address class="footer"><small>
$generatedby&#160;<a href="http://www.doxygen.org/index.html"><img class="footer" src="$relpath^doxygen.svg" width="104" height="31" alt="doxygen"/></a> $doxygenversion
$generatedby&#160;<a href="https://www.doxygen.nl/index.html"><img class="footer" src="$relpath^doxygen.svg" width="104" height="31" alt="doxygen"/></a> $doxygenversion
</small></address>
<!--END !GENERATE_TREEVIEW-->
</div>

2
Documentation/doc/resources/1.8.20/header.html
View File

@ -1,6 +1,6 @@
<!-- HTML header for doxygen 1.8.20-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<html xmlns="https://www.w3.org/1999/xhtml">
<head>
<link rel="icon" type="image/png" href="$relpath$../Manual/g-196x196-doc.png"/>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>

2
Documentation/doc/resources/1.8.20/header_package.html
View File

@ -1,6 +1,6 @@
<!-- HTML header for doxygen 1.8.20-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<html xmlns="https://www.w3.org/1999/xhtml">
<head>
<link rel="icon" type="image/png" href="$relpath$../Manual/g-196x196-doc.png"/>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>

32
Documentation/doc/resources/1.8.4/BaseDoxyfile.in
View File

@ -1,7 +1,7 @@
# Doxyfile 1.8.4
# This file describes the settings to be used by the documentation system
# doxygen (www.doxygen.org) for a project.
# doxygen (https://www.doxygen.nl/) for a project.
#
# All text after a double hash (##) is considered a comment and is placed
# in front of the TAG it is preceding .
@ -20,7 +20,7 @@
# that follow. The default is UTF-8 which is also the encoding used for all
# text before the first occurrence of this tag. Doxygen uses libiconv (or the
# iconv built into libc) for the transcoding. See
# http://www.gnu.org/software/libiconv for the list of possible encodings.
# https://www.gnu.org/software/libiconv for the list of possible encodings.
DOXYFILE_ENCODING = UTF-8
@ -409,7 +409,7 @@ EXTENSION_MAPPING =
# If MARKDOWN_SUPPORT is enabled (the default) then doxygen pre-processes all
# comments according to the Markdown format, which allows for more readable
# documentation. See http://daringfireball.net/projects/markdown/ for details.
# documentation. See https://daringfireball.net/projects/markdown/ for details.
# The output of markdown processing is further processed by doxygen, so you
# can mix doxygen, HTML, and XML commands with Markdown formatting.
# Disable only in case of backward compatibilities issues.
@ -754,7 +754,7 @@ LAYOUT_FILE = ${CGAL_DOC_RESOURCE_DIR}/DoxygenLayoutPackage.xml
# containing the references data. This must be a list of .bib files. The
# .bib extension is automatically appended if omitted. Using this command
# requires the bibtex tool to be installed. See also
# http://en.wikipedia.org/wiki/BibTeX for more info. For LaTeX the style
# https://en.wikipedia.org/wiki/BibTeX for more info. For LaTeX the style
# of the bibliography can be controlled using LATEX_BIB_STYLE. To use this
# feature you need bibtex and perl available in the search path. Do not use
# file names with spaces, bibtex cannot handle them.
@ -827,7 +827,7 @@ INPUT =
# This tag can be used to specify the character encoding of the source files
# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is
# also the default input encoding. Doxygen uses libiconv (or the iconv built
# into libc) for the transcoding. See http://www.gnu.org/software/libiconv for
# into libc) for the transcoding. See https://www.gnu.org/software/libiconv for
# the list of possible encodings.
INPUT_ENCODING = UTF-8
@ -1005,7 +1005,7 @@ REFERENCES_LINK_SOURCE = YES
# If the USE_HTAGS tag is set to YES then the references to source code
# will point to the HTML generated by the htags(1) tool instead of doxygen
# built-in source browser. The htags tool is part of GNU's global source
# tagging system (see http://www.gnu.org/software/global/global.html). You
# tagging system (see https://www.gnu.org/software/global/global.html). You
# will need version 4.8.6 or higher.
USE_HTAGS = NO
@ -1110,7 +1110,7 @@ HTML_EXTRA_FILES =
# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output.
# Doxygen will adjust the colors in the style sheet and background images
# according to this color. Hue is specified as an angle on a colorwheel,
# see http://en.wikipedia.org/wiki/Hue for more information.
# see https://en.wikipedia.org/wiki/Hue for more information.
# For instance the value 0 represents red, 60 is yellow, 120 is green,
# 180 is cyan, 240 is blue, 300 purple, and 360 is red again.
# The allowed range is 0 to 359.
@ -1251,25 +1251,25 @@ QCH_FILE =
# The QHP_NAMESPACE tag specifies the namespace to use when generating
# Qt Help Project output. For more information please see
# http://doc.trolltech.com/qthelpproject.html#namespace
# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace
QHP_NAMESPACE = org.doxygen.Project
# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating
# Qt Help Project output. For more information please see
# http://doc.trolltech.com/qthelpproject.html#virtual-folders
# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual-folders
QHP_VIRTUAL_FOLDER = doc
# If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to
# add. For more information please see
# http://doc.trolltech.com/qthelpproject.html#custom-filters
# https//doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters
QHP_CUST_FILTER_NAME =
# The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the
# custom filter to add. For more information please see
# <a href="http://doc.trolltech.com/qthelpproject.html#custom-filters">
# <a href="https//doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters">
# Qt Help Project / Custom Filters</a>.
QHP_CUST_FILTER_ATTRS =
@ -1277,7 +1277,7 @@ QHP_CUST_FILTER_ATTRS =
# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
# project's
# filter section matches.
# <a href="http://doc.trolltech.com/qthelpproject.html#filter-attributes">
# <a href="https//doc.qt.io/archives/qt-4.8/qthelpproject.html#filter-attributes">
# Qt Help Project / Filter Attributes</a>.
QHP_SECT_FILTER_ATTRS =
@ -1361,7 +1361,7 @@ FORMULA_FONTSIZE = 10
FORMULA_TRANSPARENT = YES
# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax
# (see http://www.mathjax.org) which uses client side Javascript for the
# (see https://www.mathjax.org) which uses client side Javascript for the
# rendering instead of using prerendered bitmaps. Use this if you do not
# have LaTeX installed or if you want to formulas look prettier in the HTML
# output. When enabled you may also need to install MathJax separately and
@ -1384,7 +1384,7 @@ MATHJAX_FORMAT = HTML-CSS
# the MathJax Content Delivery Network so you can quickly see the result without
# installing MathJax.
# However, it is strongly recommended to install a local
# copy of MathJax from http://www.mathjax.org before deployment.
# copy of MathJax from https://www.mathjax.org before deployment.
MATHJAX_RELPATH = ../../MathJax/
@ -1560,7 +1560,7 @@ LATEX_SOURCE_CODE = NO
# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
# bibliography, e.g. plainnat, or ieeetr. The default style is "plain". See
# http://en.wikipedia.org/wiki/BibTeX for more info.
# https://en.wikipedia.org/wiki/BibTeX for more info.
LATEX_BIB_STYLE = plain
@ -1850,7 +1850,7 @@ CLASS_DIAGRAMS = NO
# You can define message sequence charts within doxygen comments using the \msc
# command. Doxygen will then run the mscgen tool (see
# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
# https://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
# documentation. The MSCGEN_PATH tag allows you to specify the directory where
# the mscgen tool resides. If left empty the tool is assumed to be found in the
# default search path.

4
Documentation/doc/resources/1.8.4/footer.html
View File

@ -5,14 +5,14 @@
<ul>
$navpath
<li class="footer">$generatedby
<a href="https://www.doxygen.org/index.html">
<a href="https://www.doxygen.nl/index.html">
<img class="footer" src="$relpath$doxygen.png" alt="doxygen"/></a> $doxygenversion </li>
</ul>
</div>
<!--END GENERATE_TREEVIEW-->
<!--BEGIN !GENERATE_TREEVIEW-->
<hr class="footer"/><address class="footer"><small>
$generatedby &#160;<a href="https://www.doxygen.org/index.html">
$generatedby &#160;<a href="https://www.doxygen.nl/index.html">
<img class="footer" src="$relpath$doxygen.png" alt="doxygen"/>
</a> $doxygenversion
</small></address>

8
Documentation/doc/resources/1.8.4/header.html
View File

@ -1,5 +1,5 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<html xmlns="https://www.w3.org/1999/xhtml">
<head>
<link rel="icon" type="image/png" href="$relpath$../Manual/g-196x196-doc.png"/>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
@ -46,8 +46,8 @@ $mathjax
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span>
<span class="right">
@ -101,7 +101,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>

8
Documentation/doc/resources/1.8.4/header_package.html
View File

@ -1,5 +1,5 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<html xmlns="https://www.w3.org/1999/xhtml">
<head>
<link rel="icon" type="image/png" href="$relpath$../Manual/g-196x196-doc.png"/>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
@ -63,8 +63,8 @@ $mathjax
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span>
<span class="right">
@ -116,7 +116,7 @@ var searchBox = new SearchBox("searchBox", "../Manual/search",false,'Search');
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>

14
Documentation/doc/resources/1.9.3/BaseDoxyfile.in
View File

@ -1,7 +1,7 @@
# Doxyfile 1.9.3
# This file describes the settings to be used by the documentation system
# doxygen (www.doxygen.org) for a project.
# doxygen (https://www.doxygen.nl/) for a project.
#
# All text after a double hash (##) is considered a comment and is placed in
# front of the TAG it is preceding.
@ -1688,7 +1688,7 @@ USE_MATHJAX = YES
# When MathJax is enabled you can set the default output format to be used for
# the MathJax output. See the MathJax site (see:
# http://docs.mathjax.org/en/latest/output.html) for more details.
# https://docs.mathjax.org/en/latest/output/index.html) for more details.
# Possible values are: HTML-CSS (which is slower, but has the best
# compatibility), NativeMML (i.e. MathML) and SVG.
# The default value is: HTML-CSS.
@ -1719,7 +1719,7 @@ MATHJAX_EXTENSIONS = TeX/AMSmath \
# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
# of code that will be used on startup of the MathJax code. See the MathJax site
# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
# (see: https://docs.mathjax.org/en/latest/output/index.html) for more details. For an
# example see the documentation.
# This tag requires that the tag USE_MATHJAX is set to YES.
@ -2151,7 +2151,7 @@ DOCBOOK_OUTPUT = docbook
#---------------------------------------------------------------------------
# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
# AutoGen Definitions (see http://autogen.sourceforge.net/) file that captures
# AutoGen Definitions (see https://autogen.sourceforge.net/) file that captures
# the structure of the code including all documentation. Note that this feature
# is still experimental and incomplete at the moment.
# The default value is: NO.
@ -2261,7 +2261,7 @@ PREDEFINED = DOXYGEN_RUNNING \
"CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
"CGAL_NP_CLASS_2=NamedParameters2" \
CGAL_DEPRECATED
# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
# tag can be used to specify a list of macro names that should be expanded. The
@ -2347,7 +2347,7 @@ HIDE_UNDOC_RELATIONS = YES
# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
# available from the path. This tool is part of Graphviz (see:
# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
# https://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
# Bell Labs. The other options in this section have no effect if this option is
# set to NO
# The default value is: NO.
@ -2507,7 +2507,7 @@ DIRECTORY_GRAPH = NO
# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
# generated by dot. For an explanation of the image formats see the section
# output formats in the documentation of the dot tool (Graphviz (see:
# http://www.graphviz.org/)).
# https://www.graphviz.org/)).
# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
# to make the SVG files visible in IE 9+ (other browsers do not have this
# requirement).

4
Documentation/doc/resources/1.9.3/footer.html
View File

@ -7,13 +7,13 @@ move the footer to the bottom of the page. -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
$navpath
<li class="footer">$generatedby <a href="http://www.doxygen.org/index.html"><img class="footer" src="$relpath^doxygen.svg" width="104" height="31" alt="doxygen"/></a> $doxygenversion </li>
<li class="footer">$generatedby <a href="https://www.doxygen.nl/index.html"><img class="footer" src="$relpath^doxygen.svg" width="104" height="31" alt="doxygen"/></a> $doxygenversion </li>
</ul>
</div>
<!--END GENERATE_TREEVIEW-->
<!--BEGIN !GENERATE_TREEVIEW-->
<hr class="footer"/><address class="footer"><small>
$generatedby&#160;<a href="http://www.doxygen.org/index.html"><img class="footer" src="$relpath^doxygen.svg" width="104" height="31" alt="doxygen"/></a> $doxygenversion
$generatedby&#160;<a href="https://www.doxygen.nl/index.html"><img class="footer" src="$relpath^doxygen.svg" width="104" height="31" alt="doxygen"/></a> $doxygenversion
</small></address>
<!--END !GENERATE_TREEVIEW-->
</div>

Some files were not shown because too many files have changed in this diff Show More