mirror of https://github.com/CGAL/cgal
moved bib to cgal_manual.bib & restored geom.bib
This commit is contained in:
parent
46ac0f9060
commit
167db62e07
|
|
@ -1331,6 +1331,29 @@ Teillaud"
|
||||||
address = {Girona, Spain}
|
address = {Girona, Spain}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@article{cgal:lrtc-iccmps-20,
|
||||||
|
author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert and David Coeurjolly},
|
||||||
|
journal = {Computer Graphics Forum (Proceedings of Symposium on Geometry Processing)},
|
||||||
|
number = {5},
|
||||||
|
title = {Interpolated Corrected Curvature Measures for Polygonal Surfaces},
|
||||||
|
volume = {39},
|
||||||
|
month = aug,
|
||||||
|
year = {2020},
|
||||||
|
url = {https://doi.org/10.1111/cgf.14067},
|
||||||
|
doi = {10.1111/cgf.14067}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{cgal:lrt-ccm-22,
|
||||||
|
author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert},
|
||||||
|
journal = {Discrete & Computational Geometry},
|
||||||
|
title = {Corrected Curvature Measures},
|
||||||
|
volume = {68},
|
||||||
|
pages = {477-524},
|
||||||
|
month = jul,
|
||||||
|
year = {2022},
|
||||||
|
url = {https://doi.org/10.1007/s00454-022-00399-4}
|
||||||
|
}
|
||||||
|
|
||||||
@article{cgal:lm-clscm-12,
|
@article{cgal:lm-clscm-12,
|
||||||
author = {Lafarge, Florent and Mallet, Clement},
|
author = {Lafarge, Florent and Mallet, Clement},
|
||||||
title = {{Creating large-scale city models from 3D-point clouds: a robust approach with hybrid representation}},
|
title = {{Creating large-scale city models from 3D-point clouds: a robust approach with hybrid representation}},
|
||||||
|
|
|
||||||
|
|
@ -152043,7 +152043,6 @@ pages = {179--189}
|
||||||
Pages = {215--224},
|
Pages = {215--224},
|
||||||
Year = {2012},
|
Year = {2012},
|
||||||
Url = {https://monge.univ-mlv.fr/~colinde/pub/09edgewidth.pdf}
|
Url = {https://monge.univ-mlv.fr/~colinde/pub/09edgewidth.pdf}
|
||||||
}
|
|
||||||
|
|
||||||
@inproceedings{tang2009interactive,
|
@inproceedings{tang2009interactive,
|
||||||
title={Interactive Hausdorff distance computation for general polygonal models},
|
title={Interactive Hausdorff distance computation for general polygonal models},
|
||||||
|
|
@ -152055,25 +152054,3 @@ pages = {179--189}
|
||||||
year={2009},
|
year={2009},
|
||||||
organization={ACM}
|
organization={ACM}
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{lachaud2020,
|
|
||||||
author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert and David Coeurjolly},
|
|
||||||
journal = {Computer Graphics Forum (Proceedings of Symposium on Geometry Processing)},
|
|
||||||
number = {5},
|
|
||||||
title = {Interpolated corrected curvature measures for polygonal surfaces},
|
|
||||||
volume = {39},
|
|
||||||
month = jul,
|
|
||||||
year = {2020}
|
|
||||||
}
|
|
||||||
|
|
||||||
@article{lachaud2022
|
|
||||||
author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert},
|
|
||||||
journal = {Discrete & Computational Geometry},
|
|
||||||
title = {Corrected Curvature Measures},
|
|
||||||
volume = {68},
|
|
||||||
pages = {477-524},
|
|
||||||
month = jul,
|
|
||||||
year = {2022},
|
|
||||||
url = {https://doi.org/10.1007/s00454-022-00399-4}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -940,7 +940,7 @@ not provide storage for the normals.
|
||||||
\section PMPICC Computing Curvatures
|
\section PMPICC Computing Curvatures
|
||||||
|
|
||||||
This package provides methods to compute curvatures on polygonal meshes based on Interpolated
|
This package provides methods to compute curvatures on polygonal meshes based on Interpolated
|
||||||
Corrected Curvatures on Polyhedral Surfaces \cgalCite{lachaud2020}. This includes mean curvature,
|
Corrected Curvatures on Polyhedral Surfaces \cgalCite{cgal:lrtc-iccmps-20}. This includes mean curvature,
|
||||||
Gaussian curvature, principal curvatures and directions. These can be computed on triangle meshes,
|
Gaussian curvature, principal curvatures and directions. These can be computed on triangle meshes,
|
||||||
quad meshes, and meshes with n-gon faces (for n-gons, the centroid must be inside the n-gon face).
|
quad meshes, and meshes with n-gon faces (for n-gons, the centroid must be inside the n-gon face).
|
||||||
The algorithms used prove to work well in general. Also, on meshes with noise on vertex positions,
|
The algorithms used prove to work well in general. Also, on meshes with noise on vertex positions,
|
||||||
|
|
@ -955,10 +955,10 @@ in each direction is called the principal curvature: \f$ k_1 \f$ and \f$ k_2 \f$
|
||||||
curvatures). Curvature is usually expressed as scalar quantities like the mean curvature \f$ H \f$ and
|
curvatures). Curvature is usually expressed as scalar quantities like the mean curvature \f$ H \f$ and
|
||||||
the Gaussian curvature \f$ K \f$ which are defined in terms of the principal curvatures.
|
the Gaussian curvature \f$ K \f$ which are defined in terms of the principal curvatures.
|
||||||
|
|
||||||
The algorithms are based on the two papers \cgalCite{lachaud2022} and \cgalCite{lachaud2020}. They
|
The algorithms are based on the two papers \cgalCite{cgal:lrt-ccm-22} and \cgalCite{cgal:lrtc-iccmps-20}. They
|
||||||
introduce a new way to compute curvatures on polygonal meshes. The main idea in \cgalCite{lachaud2022} is
|
introduce a new way to compute curvatures on polygonal meshes. The main idea in \cgalCite{cgal:lrt-ccm-22} is
|
||||||
based on decoupling the normal information from the position information, which is useful for dealing with
|
based on decoupling the normal information from the position information, which is useful for dealing with
|
||||||
digital surfaces, or meshes with noise on vertex positions. \cgalCite{lachaud2020} introduces some
|
digital surfaces, or meshes with noise on vertex positions. \cgalCite{cgal:lrtc-iccmps-20} introduces some
|
||||||
extensions to this framework. As it uses linear interpolation on the corrected normal vector field
|
extensions to this framework. As it uses linear interpolation on the corrected normal vector field
|
||||||
to derive new closed form equations for the corrected curvature measures. These <b>interpolated</b>
|
to derive new closed form equations for the corrected curvature measures. These <b>interpolated</b>
|
||||||
curvature measures are the first step for computing the curvatures. For a triangle \f$ \tau_{ijk} \f$,
|
curvature measures are the first step for computing the curvatures. For a triangle \f$ \tau_{ijk} \f$,
|
||||||
|
|
@ -1285,7 +1285,7 @@ is covered by a set of prisms, where each prism is an offset for an input triang
|
||||||
That is, the implementation in \cgal does not use indirect predicates.
|
That is, the implementation in \cgal does not use indirect predicates.
|
||||||
|
|
||||||
The interpolated corrected curvatures were implemented during GSoC 2022. This was implemented by Hossam Saeed and under
|
The interpolated corrected curvatures were implemented during GSoC 2022. This was implemented by Hossam Saeed and under
|
||||||
supervision of David Coeurjolly, Jaques-Olivier Lachaud, and Sébastien Loriot. The implementation is based on \cgalCite{lachaud2020}.
|
supervision of David Coeurjolly, Jaques-Olivier Lachaud, and Sébastien Loriot. The implementation is based on \cgalCite{cgal:lrtc-iccmps-20}.
|
||||||
<a href="https://dgtal-team.github.io/doc-nightly/moduleCurvatureMeasures.html">DGtal's implementation</a> was also
|
<a href="https://dgtal-team.github.io/doc-nightly/moduleCurvatureMeasures.html">DGtal's implementation</a> was also
|
||||||
used as a reference during the project.
|
used as a reference during the project.
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue