Results 51 to 60 of about 266 (143)
Extended Reeb Graphs for Surface Understanding and Description [PDF]
, 2000 The aim of this paper is to describe a conceptual model for surface representation based on topological coding, which defines a sketch of a surface usable for classification or compression purposes. Theoretical approaches based on differential topology and geometry have been used for surface coding, for example Morse theory and Reeb graphs.
Biasotti S, Falcidieno B, Spagnuolo M
openaire +2 more sources
Business Strategy and the Environment, Volume 34, Issue 5, Page 5336-5369, July 2025.ABSTRACT Over the past two decades, eco‐innovation (EI) has emerged as a priority for both national and international public authorities due to its potential to drive sustainable development and enhance resilience in business and regional contexts.
Beatriz Forés
wiley +1 more source
Contemporary Accounting Research, Volume 42, Issue 2, Page 774-806, Summer 2025.Abstract Lenders are reluctant to finance firms' innovation activities because such activities tend to be opaque, with a high likelihood of negative outcomes that could hamper loan repayment. We posit that public credit registries (PCRs), which play an important role in credit information sharing in many countries, can facilitate financing by reducing ...
Fangfang Hou +3 more
wiley +1 more source
Structure of hyperbolic polynomial automorphisms of C2${\mathbb {C}^2}$ with disconnected Julia sets
Proceedings of the London Mathematical Society, Volume 130, Issue 6, June 2025.Abstract For a hyperbolic polynomial automorphism of C2$\mathbb {C}^2$ with a disconnected Julia set, and under a mild dissipativity condition, we give a topological description of the components of the Julia set. Namely, there are finitely many “quasi‐solenoids” that govern the asymptotic behavior of the orbits of all nontrivial components.
Romain Dujardin, Mikhail Lyubich
wiley +1 more source
Algorithms for Dynamic Reeb Graphs
CoRR, 2014 There was a problem with the argument used in the original submission. It seems that the truly dynamic nature of the problem puts it in the category of problems such as dynamic graph connectivity that do not have known poly-logarithmic algorihtms. To see the claims in the abstract and a reduction of the problem to a dynamic graph problem refer to my ...
openaire +3 more sources
A Reeb sphere theorem in graph theory
CoRR, 2019 We prove a Reeb sphere theorem for finite simple graphs. The result bridges two different definitions of spheres in graph theory. We also reformulate Morse conditions in terms of the center manifolds, the level surface graphs {f=f(x)} in the unit sphere S(x).
openaire +2 more sources
AN ESTIMATION OF HEMPEL DISTANCE BY USING REEB GRAPH [PDF]
Journal of Knot Theory and Its Ramifications, 2011 Let P, Q be Heegaard surfaces of a closed orientable 3-manifold. In this paper, we introduce a method for giving an upper bound of (Hempel) distance of P by using the Reeb graph derived from a certain horizontal arc in the ambient space [0, 1] × [0, 1] of the Rubinstein–Scharlemann graphic derived from P and Q.
openaire +2 more sources
Uncovering Heterogeneity in Alzheimer's Disease from Graphical Modeling of the Tau Spatiotemporal Topography. [PDF]
Med Image Comput Comput Assist Interv, 2023 Yue J, Shi Y.
europepmc +1 more source
A Computational Geometry Approach for Modeling Neuronal Fiber Pathways. [PDF]
Med Image Comput Comput Assist Interv, 2021 Shailja S, Zhang A, Manjunath BS.
europepmc +1 more source
Nonplanar 3D Printing of Bifurcating Forms. [PDF]
3D Print Addit Manuf, 2022 Mitropoulou I +2 more
europepmc +1 more source