標(biāo)題: Titlebook: Discrete Geometry for Computer Imagery; 9th International Co Gunilla Borgefors,Ingela Nystr?m,Gabriella Sanniti Conference proceedings 2000 [打印本頁] 作者: 相似 時(shí)間: 2025-3-21 18:50
書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)
書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)學(xué)科排名
書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開度
書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete Geometry for Computer Imagery被引頻次
書目名稱Discrete Geometry for Computer Imagery被引頻次學(xué)科排名
書目名稱Discrete Geometry for Computer Imagery年度引用
書目名稱Discrete Geometry for Computer Imagery年度引用學(xué)科排名
書目名稱Discrete Geometry for Computer Imagery讀者反饋
書目名稱Discrete Geometry for Computer Imagery讀者反饋學(xué)科排名
作者: 原諒 時(shí)間: 2025-3-22 00:18
978-3-540-41396-7Springer-Verlag GmbH Germany, part of Springer Nature 2000作者: 反復(fù)拉緊 時(shí)間: 2025-3-22 03:57
Discrete Geometry for Computer Imagery978-3-540-44438-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: AVID 時(shí)間: 2025-3-22 04:50 作者: ELUC 時(shí)間: 2025-3-22 10:21
Historical Observations of Supernovaer arbitrary digital spaces. We show that the digital fundamental group of a digital object is naturally isomorphic to the fundamental group of its continuous analogue. In addition, we state a digital version of the Seifert-Van Kampen theorem.作者: CON 時(shí)間: 2025-3-22 14:33
https://doi.org/10.1007/978-1-4020-5750-2as exactly two connectivity components. We present a new, short proof of this theorem using induction on the Euclidean length of the curve. We also prove that the theorem holds with another topology on the digital plane but then only for a restricted class of Jordan curves.作者: CON 時(shí)間: 2025-3-22 18:42 作者: POLYP 時(shí)間: 2025-3-22 23:27 作者: Lacerate 時(shí)間: 2025-3-23 03:11 作者: 蘆筍 時(shí)間: 2025-3-23 08:21
Gunilla Borgefors,Ingela Nystr?m,Gabriella SannitiIncludes supplementary material: 作者: BROW 時(shí)間: 2025-3-23 12:54 作者: ZEST 時(shí)間: 2025-3-23 17:33 作者: 紳士 時(shí)間: 2025-3-23 21:44
https://doi.org/10.1007/978-3-031-39719-6e a new approach in the framework of orders. We introduce the tesselation by connection, which is a transformation that preserves the connectivity, andcan be implemented by a parallel algorithm. We prove that this transformation possesses goodg eometrical properties. The extension of this transforma作者: Pantry 時(shí)間: 2025-3-24 01:55 作者: 自傳 時(shí)間: 2025-3-24 05:03 作者: lipoatrophy 時(shí)間: 2025-3-24 09:30 作者: 制造 時(shí)間: 2025-3-24 11:25
Soichi Omori,Tetsuya Komabayashid as finite cell complexes. The paper contains definitions and a theorem necessary to transfer some basic knowledge of the classical topology to finite topological spaces. The method is based on subdividing the given set into blocks of simple cells in such a way, that a .-dimensional block be homeom作者: 過分自信 時(shí)間: 2025-3-24 17:24
Superplumes: Beyond Plate Tectonicsproximity space. It is this notion, together with “nearness preserving mappings”, that we investigate in this paper. We first review basic examples as they naturally occur in digital topologies, making also brief comparison studies with other concepts in digital geometry. After this we characterize 作者: 線 時(shí)間: 2025-3-24 19:18
Soichi Omori,Tetsuya Komabayashientrate on structuring elements in the formo f discrete line segments, including periodic lines. We investigate fast algorithms, decomposition/cascade schemes, and translation invariance issues. Several application examples are provided.作者: Corporeal 時(shí)間: 2025-3-25 02:42
Britain and Britishness at the Crossroads, we give some decidable and undecidable properties concerning Hausdorff discretizations of algebraic sets and we prove that some Hausdorff discretizations of algebraic sets are diophantine sets. We refine the last results for algebraic curves and more precisely for straight lines.作者: 全等 時(shí)間: 2025-3-25 05:02 作者: 占卜者 時(shí)間: 2025-3-25 11:17
Structured Illumination Microscopyrs, is solved by the Gauss pivot. The problem investigated in this paper is very close to this classical question: we denote . the function of ?. defined by . and the question is now to determine if a given vector v ∈ ?. belongs to .. This problem can be easily seen as a sytem of inequalities and so作者: Prologue 時(shí)間: 2025-3-25 15:01
https://doi.org/10.1007/978-3-030-21691-7 when some known absorption is supposed. It is math-ematically interesting when the absorbed projection of a matrix element is the same as the absorbed projection of the next two consecutive el-ements together. We show that, in this special case, the non-uniquely determined matrices contain a certai作者: 使成核 時(shí)間: 2025-3-25 18:48 作者: Conducive 時(shí)間: 2025-3-25 22:56 作者: Cardioversion 時(shí)間: 2025-3-26 01:31 作者: 緯線 時(shí)間: 2025-3-26 05:38
Matthew Ballard,Charles Doran,Eric Sharpeble for classi.cation or compression purposes. Theoretical approaches based on di.erential topology and geometry have been used for surface coding, for example Morse theory and Reeb graphs. To use these approaches in discrete geometry, it is necessary to adapt concepts developed for smooth manifolds作者: 凝結(jié)劑 時(shí)間: 2025-3-26 12:10
Type II Superstrings in Four Dimensionsundary can be retrieved by digitizing the smoothed one. To this end, we propose a representation of the boundary of a discrete volume that we call Euclidean net and which is a generalization to the three-dimensional space of Euclidean Path introduced by Braquelaire and Vialard [.]. Euclidean nets ca作者: Ophthalmoscope 時(shí)間: 2025-3-26 15:56 作者: BUST 時(shí)間: 2025-3-26 18:52
Peter G. O. Freund,K. T. Mahanthappanning algorithm. The surface of an object composed of voxels is a seto f surfels (faces of voxels) which is the boundary between this object and its complementary. But this representation is not the classical one to visualize and to work on 3D objects, in frameworks like Computer Assisted Geometric 作者: cushion 時(shí)間: 2025-3-26 21:58
Homotopy in Digital Spacesr arbitrary digital spaces. We show that the digital fundamental group of a digital object is naturally isomorphic to the fundamental group of its continuous analogue. In addition, we state a digital version of the Seifert-Van Kampen theorem.作者: Inordinate 時(shí)間: 2025-3-27 03:23 作者: 考古學(xué) 時(shí)間: 2025-3-27 05:21 作者: Insatiable 時(shí)間: 2025-3-27 12:40
Hausdorff Discretizations of Algebraic Sets and Diophantine Sets we give some decidable and undecidable properties concerning Hausdorff discretizations of algebraic sets and we prove that some Hausdorff discretizations of algebraic sets are diophantine sets. We refine the last results for algebraic curves and more precisely for straight lines.作者: 做事過頭 時(shí)間: 2025-3-27 16:14
Object Discretization in Higher Dimensions This class is natural and quite general, including as special cases some known discretizations, like the standard covers and the naive discretizations. Various results are obtained in the proposed general setting.作者: 排名真古怪 時(shí)間: 2025-3-27 19:48
Homotopy in Digital Spacesr arbitrary digital spaces. We show that the digital fundamental group of a digital object is naturally isomorphic to the fundamental group of its continuous analogue. In addition, we state a digital version of the Seifert-Van Kampen theorem.作者: 輕彈 時(shí)間: 2025-3-28 00:28 作者: nurture 時(shí)間: 2025-3-28 04:37 作者: Mystic 時(shí)間: 2025-3-28 07:38 作者: nocturnal 時(shí)間: 2025-3-28 10:38 作者: 安裝 時(shí)間: 2025-3-28 16:08
A New Means for Investigating 3-Manifoldsd as finite cell complexes. The paper contains definitions and a theorem necessary to transfer some basic knowledge of the classical topology to finite topological spaces. The method is based on subdividing the given set into blocks of simple cells in such a way, that a .-dimensional block be homeom作者: BOOST 時(shí)間: 2025-3-28 21:03
Nearness in Digital Images and Proximity Spacesproximity space. It is this notion, together with “nearness preserving mappings”, that we investigate in this paper. We first review basic examples as they naturally occur in digital topologies, making also brief comparison studies with other concepts in digital geometry. After this we characterize 作者: 乞丐 時(shí)間: 2025-3-29 02:54 作者: Fecal-Impaction 時(shí)間: 2025-3-29 06:37
Hausdorff Discretizations of Algebraic Sets and Diophantine Sets we give some decidable and undecidable properties concerning Hausdorff discretizations of algebraic sets and we prove that some Hausdorff discretizations of algebraic sets are diophantine sets. We refine the last results for algebraic curves and more precisely for straight lines.作者: 羽毛長成 時(shí)間: 2025-3-29 10:04
An Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rays directions. We provide a polynomial-time algorithm for reconstructing Q-convex sets from their “approximate” X-rays. A Qconvex set is a special subset of Z2 having some convexity properties. This algorithm can be used for reconstructing convex subsets of Z2 from their exact X-rays in some sets of f作者: FISC 時(shí)間: 2025-3-29 12:14
A Question of Digital Linear Algebrars, is solved by the Gauss pivot. The problem investigated in this paper is very close to this classical question: we denote . the function of ?. defined by . and the question is now to determine if a given vector v ∈ ?. belongs to .. This problem can be easily seen as a sytem of inequalities and so作者: 琺瑯 時(shí)間: 2025-3-29 18:24
Reconstruction of Discrete Sets with Absorption when some known absorption is supposed. It is math-ematically interesting when the absorbed projection of a matrix element is the same as the absorbed projection of the next two consecutive el-ements together. We show that, in this special case, the non-uniquely determined matrices contain a certai作者: inspired 時(shí)間: 2025-3-29 20:58 作者: 慢跑 時(shí)間: 2025-3-30 03:28 作者: 潰爛 時(shí)間: 2025-3-30 07:24
Determining Visible Points in a Three-Dimensional Discrete Spaceother object points is determined by shooting a discrete ray from each surface point towards the center of projection considering the intersection of the ray with other object points. Since the projection of points onto the viewing plane is done by a continuous mapping, additionally to the discrete 作者: 青石板 時(shí)間: 2025-3-30 09:06 作者: 沒有準(zhǔn)備 時(shí)間: 2025-3-30 12:42 作者: choroid 時(shí)間: 2025-3-30 19:19 作者: 可耕種 時(shí)間: 2025-3-30 23:57 作者: reaching 時(shí)間: 2025-3-31 02:15
Structured Illumination Microscopyx geometry. We will see in this framework that the question v ∈ .? generalizes the problem of recognition of the finite parts of digital hyperplanes and we will give equivalent formulations which allow to solve it efficiently.作者: judiciousness 時(shí)間: 2025-3-31 05:04 作者: 天真 時(shí)間: 2025-3-31 12:33
A Question of Digital Linear Algebrax geometry. We will see in this framework that the question v ∈ .? generalizes the problem of recognition of the finite parts of digital hyperplanes and we will give equivalent formulations which allow to solve it efficiently.作者: Moderate 時(shí)間: 2025-3-31 16:18
Strong Thinning and Polyhedrization of the Surface of a Voxel Objectlgorithm to polyhedrize the boundary of a voxel object which uses the parallel thinning algorithm presented above. This method is speci.cally adapted to digital objects and is much more e.cient than such existing methods [.]. Some examples are shown, and a method to make the reverse operation (discretization) is briefly presented.作者: atopic 時(shí)間: 2025-3-31 18:17 作者: Basilar-Artery 時(shí)間: 2025-4-1 00:04
Digital ,-Pseudomanifold and n-Weakmanifold in a Binary (, + 1)-Digital Image the n-digital image, based on cubical complex decomposition. This enables us to translate some results from polyhedral topology into the digital space. Our main result extends the class of “thin” objects that are defined locally and verifies the Jordan-Brouwer separation theorem.作者: 粘土 時(shí)間: 2025-4-1 05:10
An Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rayst of Z2 having some convexity properties. This algorithm can be used for reconstructing convex subsets of Z2 from their exact X-rays in some sets of four prescribed lattice directions, or in any set of seven prescribed mutually nonparallel lattice directions.作者: 粗魯性質(zhì) 時(shí)間: 2025-4-1 08:14 作者: Armada 時(shí)間: 2025-4-1 12:18
The Reconstruction of the Digital Hyperbola Segment from Its Codeonding to the hyperbolas of the form y = α/x-β+γ inscribed into the (m × m )-integer grid. An O (m · (log(m + |β| )).) algorithm for recovering the digital hyperbola segment from its proposed code, is presented.作者: Banister 時(shí)間: 2025-4-1 18:03
Determining Visible Points in a Three-Dimensional Discrete Spacethe ray with other object points. Since the projection of points onto the viewing plane is done by a continuous mapping, additionally to the discrete ray, the location of the continuous projection ray is examined regarding its location to the surface points that are intersected by the discrete ray.作者: 煞費(fèi)苦心 時(shí)間: 2025-4-1 20:18 作者: 原始 時(shí)間: 2025-4-2 02:22
https://doi.org/10.2991/978-94-6239-246-5oles in X” which is not su.cient for our purpose but we use the linking number de.ned in [FM00]. In so doing, we formalize the proofs of several results stated without proof in the literature (Bertrand, Kong, Morgenthaler).作者: 魔鬼在游行 時(shí)間: 2025-4-2 05:05
