• Refine your search:
  • 
    Keyword:
    
    • Delaunay (2)
    • Delaunay triangulation (2)
    • OHCP (2)
    • [INFO.INFO-CG]Computer Science [cs] / Computational Geometry [cs.CG] (2)
    • homology generators (2)
    • simplicial homology (2)
    • surface reconstruction (2)
    • triangulation (2)
    • Data processing Computer science (1)
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access:
    • free (4)
    • subject to license (0)

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 4 of 4 1 Efficient open surface reconstruction from lexicographic optimal chains and critical bases Cohen-Steiner, David; Lieutier, André; Vuillamy, Julien In: https://hal.archives-ouvertes.fr/hal-03456390 ; 2021 (2021) BASE Show details 2 Efficient open surface reconstruction from lexicographic optimal chains and critical bases Cohen-Steiner, David; Lieutier, André; Vuillamy, Julien In: https://hal.archives-ouvertes.fr/hal-03456390 ; 2021 (2021) Abstract: Previous works on lexicographic optimal chains have shown that they provide meaningful geometric homology representatives while being easier to compute than their l 1-norm optimal counterparts. This work presents a novel algorithm to efficiently compute lexicographic optimal chains with a given boundary in a triangulation of 3-space, by leveraging Lefschetz duality and an augmented version of the disjoint-set data structure. Furthermore, by observing that lexicographic minimization is a linear operation, we define a canonical basis of lexicographic optimal chains, called critical basis, and show how to compute it. In applications, the presented algorithms offer new promising ways of efficiently reconstructing open surfaces in difficult acquisition scenarios. Keyword: [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]; Delaunay triangulation; homology generators; surface reconstruction URL: https://hal.archives-ouvertes.fr/hal-03456390/file/paper.pdf https://hal.archives-ouvertes.fr/hal-03456390/document https://hal.archives-ouvertes.fr/hal-03456390 BASE Hide details 3 Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations Cohen-Steiner, David; Vuillamy, Julien. - : LIPIcs - Leibniz International Proceedings in Informatics. 36th International Symposium on Computational Geometry (SoCG 2020), 2020 BASE Show details 4 Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations ... Cohen-Steiner, David; Lieutier, André; Vuillamy, Julien. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 4 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0