Zobrazeno 1 - 10
of 8 203
pro vyhledávání: '"cs.CG"'
Autor:
Ambroszkiewicz, Stanislaw
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the construction is suff
Externí odkaz:
http://arxiv.org/abs/1904.05173
Publikováno v:
Nature Computational Science. 3:443-454
We present an additive approach for the inverse design of kirigami-based mechanical metamaterials by focusing on the empty (negative) spaces instead of the solid tiles. By considering each negative space as a four-bar linkage, we identify a simple re
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
Publikováno v:
ACM Journal of Experimental Algorithmics. 28:1-36
The construction of bounded-degree plane geometric spanners has been a focus of interest since 2002 when Bose, Gudmundsson, and Smid proposed the first algorithm to construct such spanners. To date, 11 algorithms have been designed with various trade
Autor:
Casel, Katrin, Fernau, Henning, Grigoriev, Alexander, Schmid, Markus L., Whitesides, Sue, Larsen, Kim G., Bodlaender, Hans L., Raskin, Jean-Francois
Publikováno v:
Maastricht University
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 83, 30:1-30:15
Discrete & Computational Geometry, 69, 937-980. Springer Verlag
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 83, 30:1-30:15
Discrete & Computational Geometry, 69, 937-980. Springer Verlag
Unit square visibility graphs (USV) are described by axis-parallel visibility between unit squares placed in the plane. If the squares are required to be placed on integer grid coordinates, then USV become unit square grid visibility graphs (USGV), a
Autor:
Sergio Cabello
Publikováno v:
Journal of global optimization, vol. 86, no. 2, pp. 441-466, 2023.
We consider the problem of computing the \emph{distance-based representative skyline} in the plane, a problem introduced by Tao, Ding, Lin and Pei [Proc. 25th IEEE International Conference on Data Engineering (ICDE), 2009] and independently considere
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
Autor:
Dyballa, Luciano, Zucker, Steven W.
Publikováno v:
Neural Computation. 35:453-524
Invoking the manifold assumption in machine learning requires knowledge of the manifold's geometry and dimension, and theory dictates how many samples are required. However, in applications data are limited, sampling may not be uniform, and manifold
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
A Framework for Fast and Stable Representations of Multiparameter Persistent Homology Decompositions
Topological data analysis (TDA) is an area of data science that focuses on using invariants from algebraic topology to provide multiscale shape descriptors for geometric data sets such as point clouds. One of the most important such descriptors is {\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::141ac367c036cb418bfbe82023526b26
https://inria.hal.science/hal-04135811
https://inria.hal.science/hal-04135811