Zobrazeno 1 - 10
of 2 537
pro vyhledávání: '"[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]"'
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, 2022, ⟨10.1016/j.jsc.2022.08.012⟩
Journal of Symbolic Computation, 2022, ⟨10.1016/j.jsc.2022.08.012⟩
We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space. Our method
Publikováno v:
Image Processing On Line
Image Processing On Line, 2023, 13, pp.1-21. ⟨10.5201/ipol.2023.418⟩
Image Processing On Line, 2023, 13, pp.1-21. ⟨10.5201/ipol.2023.418⟩
International audience; This paper details the first publicly available implementation of the progressive mesh compression algorithm described in the paper entitled "Compressed Progressive Meshes" [R. Pajarola and J. Rossignac, IEEE Transactions on V
Publikováno v:
Discrete and Computational Geometry, 68(4), 1078-1101. Springer New York
Leibniz International Proceedings in Informatics
SoCG 2020-36th International Symposium on Computational Geometry
SoCG 2020-36th International Symposium on Computational Geometry, Sergio Cabello; Danny Z. Chen, Jun 2020, Zurich, Switzerland. pp.22:1-22:16, ⟨10.4230/LIPIcs.SoCG.2020.22⟩
Botnan, M B, Lebovici, V & Oudot, S 2022, ' On Rectangle-Decomposable 2-Parameter Persistence Modules ', Discrete and Computational Geometry, vol. 68, no. 4, pp. 1078-1101 . https://doi.org/10.1007/s00454-022-00383-y
Discrete and Computational Geometry
Discrete and Computational Geometry, 2022, 68 (4), pp.1078-1101. ⟨10.1007/s00454-022-00383-y⟩
36th International Symposium on Computational Geometry, SoCG 2020: [Proceedings], 1-16
STARTPAGE=1;ENDPAGE=16;TITLE=36th International Symposium on Computational Geometry, SoCG 2020
Botnan, M B, Lebovici, V & Oudot, S 2020, On rectangle-decomposable 2-parameter persistence modules . in S Cabello & D Z Chen (eds), 36th International Symposium on Computational Geometry, SoCG 2020 : [Proceedings] . Leibniz International Proceedings in Informatics, LIPIcs, vol. 164, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 1-16, 36th International Symposium on Computational Geometry, SoCG 2020, Zurich, Switzerland, 23/06/20 . https://doi.org/10.4230/LIPIcs.SoCG.2020.22
Leibniz International Proceedings in Informatics
SoCG 2020-36th International Symposium on Computational Geometry
SoCG 2020-36th International Symposium on Computational Geometry, Sergio Cabello; Danny Z. Chen, Jun 2020, Zurich, Switzerland. pp.22:1-22:16, ⟨10.4230/LIPIcs.SoCG.2020.22⟩
Botnan, M B, Lebovici, V & Oudot, S 2022, ' On Rectangle-Decomposable 2-Parameter Persistence Modules ', Discrete and Computational Geometry, vol. 68, no. 4, pp. 1078-1101 . https://doi.org/10.1007/s00454-022-00383-y
Discrete and Computational Geometry
Discrete and Computational Geometry, 2022, 68 (4), pp.1078-1101. ⟨10.1007/s00454-022-00383-y⟩
36th International Symposium on Computational Geometry, SoCG 2020: [Proceedings], 1-16
STARTPAGE=1;ENDPAGE=16;TITLE=36th International Symposium on Computational Geometry, SoCG 2020
Botnan, M B, Lebovici, V & Oudot, S 2020, On rectangle-decomposable 2-parameter persistence modules . in S Cabello & D Z Chen (eds), 36th International Symposium on Computational Geometry, SoCG 2020 : [Proceedings] . Leibniz International Proceedings in Informatics, LIPIcs, vol. 164, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 1-16, 36th International Symposium on Computational Geometry, SoCG 2020, Zurich, Switzerland, 23/06/20 . https://doi.org/10.4230/LIPIcs.SoCG.2020.22
This paper addresses two questions: (a) can we identify a sensible class of 2-parameter persistence modules on which the rank invariant is complete? (b) can we determine efficiently whether a given 2-parameter persistence module belongs to this class
Autor:
Hsien-Chih Chang, Arnaud de Mesmay
Publikováno v:
SODA
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, United States. pp.747-766, ⟨10.1137/1.9781611975994.46⟩
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, United States. pp.747-766, ⟨10.1137/1.9781611975994.46⟩
We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any time durin
Publikováno v:
GRETSI 2023
XXIXème Colloque Francophone de Traitement du Signal et des Images (GRETSI 2023)
XXIXème Colloque Francophone de Traitement du Signal et des Images (GRETSI 2023), Groupe de Recherche et d'Etudes de Traitement du Signal et des Images, Aug 2023, Grenoble, France. à paraître
XXIXème Colloque Francophone de Traitement du Signal et des Images (GRETSI 2023)
XXIXème Colloque Francophone de Traitement du Signal et des Images (GRETSI 2023), Groupe de Recherche et d'Etudes de Traitement du Signal et des Images, Aug 2023, Grenoble, France. à paraître
International audience; The identification of a set of parameters x from observed data y is often reduced to the resolution of a problem of the type f(x) = y, where f is a continuous application. This equation appears in domains such as (blind) inver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4074::cf520821e105d08690a7633d7cbb79f6
https://hal.science/hal-04138308
https://hal.science/hal-04138308
Autor:
Zhao, Tong, Busé, Laurent, Cohen-Steiner, David, Boubekeur, Tamy, Thiery, Jean-Marc, Alliez, Pierre
Publikováno v:
SIGGRAPH 2023 Conference Proceedings
SIGGRAPH 2023 Conference Proceedings, Aug 2023, Los Angeles, United States. ⟨10.1145/3588432.3591529⟩
SIGGRAPH 2023 Conference Proceedings, Aug 2023, Los Angeles, United States. ⟨10.1145/3588432.3591529⟩
International audience; Inspired by the strengths of quadric error metrics initially designed for mesh decimation, we propose a concise mesh reconstruction approach for 3D point clouds. Our approach proceeds by clustering the input points enriched wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::d8bd8d395771c1aa2514ba2047655b93
https://inria.hal.science/hal-04131765/file/vsr_siggraph.pdf
https://inria.hal.science/hal-04131765/file/vsr_siggraph.pdf
Autor:
Glisse, Marc
0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of $n$ edges in non-decreasing order of filtration value, one only needs a union-find data structure to keep track of the connected
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::79592ce386611051cd4b277d647d9027
https://inria.hal.science/hal-04148137
https://inria.hal.science/hal-04148137
Autor:
Boissonnat, Jean-Daniel, Dutta, Kunal
Computing persistent homology using Gaussian kernels is useful in the domains of topological data analysis and machine learning as shown by Phillips, Wang and Zheng [SoCG 2015]. However, contrary to the case of computing persistent homology using the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::844faa001dd26a26f2ba797fa1a7002f
http://arxiv.org/abs/2301.03321
http://arxiv.org/abs/2301.03321
Publikováno v:
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Visualization and Computer Graphics, Institute of Electrical and Electronics Engineers, In press, ⟨10.1109/TVCG.2020.3045490⟩
IEEE Transactions on Visualization and Computer Graphics, 2022, 28 (8), pp.2999-3012. ⟨10.1109/TVCG.2020.3045490⟩
IEEE Transactions on Visualization and Computer Graphics, Institute of Electrical and Electronics Engineers, In press, ⟨10.1109/TVCG.2020.3045490⟩
IEEE Transactions on Visualization and Computer Graphics, 2022, 28 (8), pp.2999-3012. ⟨10.1109/TVCG.2020.3045490⟩
code available at the following address:https://gitlab.inria.fr/marmando/deep-mesh-denoizing; International audience; We examine the problem of mesh denoising, which consists of removing noise from corrupted 3D meshes while preserving existing geomet
Publikováno v:
Computer Graphics Forum
Computer Graphics Forum, 2023, 42 (5), ⟨10.1111/cgf.14910⟩
Computer Graphics Forum, 2023, 42 (5), ⟨10.1111/cgf.14910⟩
International audience; The estimation of differential quantities on oriented point cloud is a classical step for many geometry processing tasks in computer graphics and vision. Even if many solutions exist to estimate such quantities, they usually f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::78130bc2aa0f96de79f50818f6443427
https://hal.science/hal-04140178
https://hal.science/hal-04140178