Zobrazeno 1 - 10
of 14
pro vyhledávání: '"CHUNXU XU"'
Publikováno v:
Mathematics, Vol 11, Iss 13, p 2976 (2023)
We characterize some necessary and sufficient conditions of invertible Toeplitz operators acting on the Fock space. In particular, we study the Fredholm properties of Toeplitz operators with BMO1 symbols, where their Berezin transforms are bounded fu
Externí odkaz:
https://doaj.org/article/ddb8d69ae1e74e73ba40af814e822756
Autor:
Yu, Chunxu Xu, Tao
Publikováno v:
Mathematics; Volume 11; Issue 13; Pages: 2976
We characterize some necessary and sufficient conditions of invertible Toeplitz operators acting on the Fock space. In particular, we study the Fredholm properties of Toeplitz operators with BMO1 symbols, where their Berezin transforms are bounded fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::57764202b841d879d7c2478f7668c5df
Publikováno v:
Operators & Matrices; Dec2023, Vol. 17 Issue 4, p925-938, 14p
Publikováno v:
Czechoslovak Mathematical Journal. 71:1173-1188
Let μ be a finite positive measure on the unit disk and let j ⩾ 1 be an integer. D. Suarez (2015) gave some conditions for a generalized Toeplitz operator $$T_\mu ^{(j)}$$ to be bounded or compact. We first give a necessary and sufficient conditio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::379e8b7ab5f6c20149b10724f379def9
https://doi.org/10.21136/cmj.2021.0336-20
https://doi.org/10.21136/cmj.2021.0336-20
Publikováno v:
Spatial Synthesis ISBN: 9783030527334
The recent development of Artificial Intelligence (AI) has offered its tremendous capacity to intelligentize GIScience. In the meantime, such capacity could also generate problematic geospatial data. To explain how geospatial data can be affected by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b7b730e2f0968e29a268b06359eb4c4
https://doi.org/10.1007/978-3-030-52734-1_19
https://doi.org/10.1007/978-3-030-52734-1_19
Publikováno v:
Information Processing Letters. 124:10-14
Computing geodesic distances on 2-manifold meshes is a fundamental problem in computational geometry. To date, two notable classes of exact algorithms, namely, the Mitchell–Mount–Papadimitriou (MMP) algorithm and the Chen–Han (CH) algorithm, ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45e8f1c9f1191549afcec8481cf80431
https://doi.org/10.1016/j.ipl.2017.04.005
https://doi.org/10.1016/j.ipl.2017.04.005
Publikováno v:
ACM Transactions on Graphics. 35:1-10
Computing centroidal Voronoi tessellations (CVT) has many applications in computer graphics. The existing methods, such as the Lloyd algorithm and the quasi-Newton solver, are efficient and easy to implement; however, they compute only the local opti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::adea17a2bc8e09bc2fd9c5e0a05070d6
https://doi.org/10.1145/2980179.2982424
https://doi.org/10.1145/2980179.2982424
Publikováno v:
ACM Transactions on Graphics. 34:1-13
Delaunay meshes (DM) are a special type of triangle mesh where the local Delaunay condition holds everywhere. We present an efficient algorithm to convert an arbitrary manifold triangle mesh M into a Delaunay mesh. We show that the constructed DM has
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cabcb71f91025fd8de6d1e6e8c09e3ee
https://doi.org/10.1145/2816795.2818076
https://doi.org/10.1145/2816795.2818076
Publikováno v:
IEEE transactions on visualization and computer graphics. 21(7)
Computing geodesic distances on triangle meshes is a fundamental problem in computational geometry and computer graphics. To date, two notable classes of algorithms, the Mitchell-Mount-Papadimitriou (MMP) algorithm and the Chen-Han (CH) algorithm, ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b23d61e551d8121d9c53e4491f8fcc9
https://pubmed.ncbi.nlm.nih.gov/26357244
https://pubmed.ncbi.nlm.nih.gov/26357244
Intrinsic Delaunay triangulation (IDT) is a fundamental data structure in computational geometry and computer graphics. However, except for some theoretical results, such as existence and uniqueness, little progress has been made towards computing ID
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::979bc10a0ffb62f5cc039ee66e820967
http://arxiv.org/abs/1505.05590
http://arxiv.org/abs/1505.05590