-
1مؤتمر
المؤلفون: Aleardi, Luca, Castelli, Devillers, Olivier
المساهمون: Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Geometric Algorithms and Models Beyond the Linear and Euclidean realm (GAMBLE ), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), ANR-20-CE48-0018,3DMaps,Combinatoire de cartes 3D(2020)
المصدر: Proceedings of the 40th International Symposium on Computational Geometry ; 40th International Symposium on Computational Geometry (SoCG 2024) ; https://inria.hal.science/hal-04618429Test ; 40th International Symposium on Computational Geometry (SoCG 2024), Jun 2024, Athens, Greece. ⟨10.4230/LIPIcs.SoCG.2024.32⟩
مصطلحات موضوعية: 2012 ACM Subject Classification Mathematics of computing → Combinatoric problems, Theory of computation → Computational geometry Meshes compression triangulations compact representations Digital Object Identifier 10.4230/LIPIcs.SoCG.2024.32 https://inria.hal.science/hal-04320292Test Schnyder Compact and Regularity Sensitive Triangulation Data Structure, Theory of computation → Computational geometry Meshes, compression, triangulations, compact representations, [INFO]Computer Science [cs]
العلاقة: hal-04618429; https://inria.hal.science/hal-04618429Test; https://inria.hal.science/hal-04618429/documentTest; https://inria.hal.science/hal-04618429/file/LIPIcs.SoCG.2024.32.pdfTest
الإتاحة: https://doi.org/10.4230/LIPIcs.SoCG.2024.32Test
https://inria.hal.science/hal-04618429Test
https://inria.hal.science/hal-04618429/documentTest
https://inria.hal.science/hal-04618429/file/LIPIcs.SoCG.2024.32.pdfTest -
2دورية أكاديمية
المؤلفون: Huynh, Kien, Polishchuk, Valentin
مصطلحات موضوعية: computational geometry, alpha-shape, k-hull, robust shape reconstruction, Theory of computation → Computational geometry
وصف الملف: application/pdf
العلاقة: https://www.sciencedirect.com/journal/information-processing-lettersTest; https://www.cs.helsinki.fi/group/compgeom/kappletTest/; https://dx.doi.org/10.4230/LIPIcs.FUN.2024Test
-
3تقرير
المؤلفون: Becker, Florent
المساهمون: Laboratoire d'Informatique Fondamentale d'Orléans (LIFO), Université d'Orléans (UO)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), ANR-19-CE48-0007,C_SyDiSi,Complexité des systèmes discrets simples(2019)
المصدر: https://hal.science/hal-04571345Test ; 2024.
مصطلحات موضوعية: Molecular Self-assembly, Discrete Fractals, Substitutions, 2012 ACM Subject Classification Theory of computation → Abstract machines Theory of computation → Timed and hybrid models Theory of computation → Computational geometry Molecular Self-assembly, Substitutions 1, 2012 ACM Subject Classification Theory of computation → Abstract machines, Theory of computation → Timed and hybrid models, Theory of computation → Computational geometry Molecular Self-assembly, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
العلاقة: info:eu-repo/semantics/altIdentifier/arxiv/2405.08548; hal-04571345; https://hal.science/hal-04571345Test; https://hal.science/hal-04571345v3/documentTest; https://hal.science/hal-04571345v3/file/main.pdfTest; ARXIV: 2405.08548
-
4مؤتمر
المؤلفون: Despré, Vincent, Kolbe, Benedikt, Parlier, Hugo, Teillaud, Monique
المساهمون: Geometric Algorithms and Models Beyond the Linear and Euclidean realm (GAMBLE ), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Hausdorff Center for Mathematics and Institute for Numerical Simulation - University of Bonn, Rheinische Friedrich-Wilhelms-Universität Bonn, University of Luxembourg Luxembourg, ANR-17-CE40-0033,SoS,Structures sur des surfaces(2017)
المصدر: Leibniz International Proceedings in Informatics (LIPIcs) ; 39th International Symposium on Computational Geometry (SoCG 2023) ; https://inria.hal.science/hal-04125470Test ; 39th International Symposium on Computational Geometry (SoCG 2023), Jun 2023, Dallas, United States. pp.27:1--27:15, ⟨10.4230/LIPIcs.SoCG.2023.27⟩
مصطلحات موضوعية: 2012 ACM Subject Classification Mathematics of computing → Geometric topology, Theory of computation → Computational geometry phrases Hyperbolic geometry Topology Voronoi diagram Algorithm, Theory of computation → Computational geometry phrases Hyperbolic geometry, Topology, Voronoi diagram, Algorithm, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
جغرافية الموضوع: Dallas, United States
العلاقة: hal-04125470; https://inria.hal.science/hal-04125470Test; https://inria.hal.science/hal-04125470/documentTest; https://inria.hal.science/hal-04125470/file/LIPIcs-SoCG-2023-27.pdfTest
الإتاحة: https://doi.org/10.4230/LIPIcs.SoCG.2023.27Test
https://inria.hal.science/hal-04125470Test
https://inria.hal.science/hal-04125470/documentTest
https://inria.hal.science/hal-04125470/file/LIPIcs-SoCG-2023-27.pdfTest -
5مؤتمر
المساهمون: Goaoc, Xavier, Kerber, Michael
المصدر: Leibniz International Proceedings in Informatics (LIPIcs), 224 ; 38th International Symposium on Computational Geometry (SoCG 2022)
مصطلحات موضوعية: Theory of computation → Computational geometry, Dynamic time warping, Sequence Similarity Measures
وصف الملف: application/application/pdf
العلاقة: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-227-3; http://hdl.handle.net/20.500.11850/553721Test; urn:isbn:978-3-95977-227-3
الإتاحة: https://doi.org/20.500.11850/553721Test
https://doi.org/10.3929/ethz-b-000553721Test
https://doi.org/10.4230/LIPICS.SOCG.2022.20Test
https://hdl.handle.net/20.500.11850/553721Test -
6مؤتمر
المؤلفون: Bringmann, Karl, Kisfaludi‑Bak, Sándor, Künnemann, Marvin, Nusser, André, Parsaeian, Zahra
المساهمون: Goaoc, Xavier, Kerber, Michael
المصدر: Leibniz International Proceedings in Informatics (LIPIcs), 224 ; 38th International Symposium on Computational Geometry (SoCG 2022)
مصطلحات موضوعية: Hardness in P, Geometric Intersection Graph, Graph Diameter, Orthogonal Vectors, Hyperclique Detection, Theory of computation → Computational geometry
وصف الملف: application/application/pdf
العلاقة: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-227-3; http://hdl.handle.net/20.500.11850/553719Test; urn:isbn:978-3-95977-227-3
الإتاحة: https://doi.org/20.500.11850/553719Test
https://doi.org/10.3929/ethz-b-000553719Test
https://doi.org/10.4230/LIPICS.SOCG.2022.21Test
https://hdl.handle.net/20.500.11850/553719Test -
7كتاب
المصدر: ISSN: 1868-8969.
مصطلحات موضوعية: hyperbolic geometry, unit disk graphs, greedy routing, hyperbolic random graphs, graph classes, Theory of computation → Graph algorithms analysis, Theory of computation → Computational geometry, Mathematics of computing → Graph algorithms, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
العلاقة: info:eu-repo/semantics/altIdentifier/isbn/978-3-9597726-6-2; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000157578Test
-
8دورية أكاديمية
المؤلفون: Moschella, Luca, Melzi, Simone, Cosmo, Luca, Maggioli, Filippo, Litany, Or, Ovsjanikov, Maks, Guibas, Leonidas, Rodolà, Emanuele
المساهمون: Department of Informatics and System Sciences (Sapienza University of Rome), Università degli Studi di Roma "La Sapienza" = Sapienza University Rome (UNIROMA), Université de Venise Ca’ Foscari, Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), La Géometrie au Service du Numérique (GEOMERIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut Polytechnique de Paris (IP Paris), Stanford University
المصدر: ISSN: 0167-7055.
مصطلحات موضوعية: CCS Concepts Computing methodologies → Shape analysis, Theory of computation → Computational geometry, CCS Concepts, Computing methodologies → Shape analysis, [SCCO.COMP]Cognitive science/Computer science
العلاقة: hal-04352312; https://hal.science/hal-04352312Test; https://hal.science/hal-04352312/documentTest; https://hal.science/hal-04352312/file/specunions_paper_updated.pdfTest
الإتاحة: https://doi.org/10.1111/cgf.14483Test
https://hal.science/hal-04352312Test
https://hal.science/hal-04352312/documentTest
https://hal.science/hal-04352312/file/specunions_paper_updated.pdfTest -
9مؤتمر
المؤلفون: Maria, Clément
المساهمون: Understanding the Shape of Data (DATASHAPE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), ANR-20-CE48-0007,AlgoKnot,Aspects algorithmiques et combinatoires de la théorie des nœuds(2020)
المصدر: 37th International Symposium on Computational Geometry (SoCG 2021)
Symposium on Computational Geometry (SoCG)
https://hal.science/hal-02429767Test
Symposium on Computational Geometry (SoCG), Jun 2021, Buffalo (NY), United States. ⟨10.4230/LIPIcs.SoCG.2021.53⟩مصطلحات موضوعية: computational knot theory, parameterized complexity, quantum invariants, Theory of computation → Fixed parameter tractability, Theory of computation → Computational geometry, Mathematics of computing → Graphs and surfaces, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [MATH.MATH-QA]Mathematics [math]/Quantum Algebra [math.QA]
جغرافية الموضوع: Buffalo (NY), United States
العلاقة: info:eu-repo/semantics/altIdentifier/arxiv/1910.00477; hal-02429767; https://hal.science/hal-02429767Test; https://hal.science/hal-02429767/documentTest; https://hal.science/hal-02429767/file/main.pdfTest; ARXIV: 1910.00477
الإتاحة: https://doi.org/10.4230/LIPIcs.SoCG.2021.53Test
https://hal.science/hal-02429767Test
https://hal.science/hal-02429767/documentTest
https://hal.science/hal-02429767/file/main.pdfTest -
10مؤتمر
المساهمون: Understanding the Shape of Data (DATASHAPE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), Institute of Science and Technology Klosterneuburg, Austria (IST Austria), ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019), European Project: 339025,EC:FP7:ERC,ERC-2013-ADG,GUDHI(2014)
المصدر: SoCG 2021 - 37th Symposium on Computational Geometry ; https://inria.hal.science/hal-03006663Test ; SoCG 2021 - 37th Symposium on Computational Geometry, Jun 2021, Buffalo, United States. ⟨10.4230/LIPICS.SOCG.2021.17⟩ ; https://cse.buffalo.edu/socg21/socg.htmlTest
مصطلحات موضوعية: permutahedron, PL-approximations, Isosurfacing, Kuhn triangulation, Coxeter triangulation, 2012 ACM Subject Classification Theory of computation → Computational geometry phrases Coxeter triangulation, isomanifolds/solution manifolds/isosurfacing XX:2 Isomanifold Tracing in R d, using Coxeter-Freudenthal-Kuhn Triangulations, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-AT]Mathematics [math]/Algebraic Topology [math.AT], [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT]
جغرافية الموضوع: Buffalo, United States
العلاقة: info:eu-repo/grantAgreement/EC/FP7/339025/EU/Algorithmic Foundations of Geometry Understanding in Higher Dimensions/GUDHI; hal-03006663; https://inria.hal.science/hal-03006663Test; https://inria.hal.science/hal-03006663v3/documentTest; https://inria.hal.science/hal-03006663v3/file/tracingmanifolds-SoCG2021-fullversion.pdfTest
الإتاحة: https://doi.org/10.4230/LIPICS.SOCG.2021.17Test
https://inria.hal.science/hal-03006663Test
https://inria.hal.science/hal-03006663v3/documentTest
https://inria.hal.science/hal-03006663v3/file/tracingmanifolds-SoCG2021-fullversion.pdfTest
