書目名稱Geometric Modeling for Scientific Visualization影響因子(影響力)學科排名
書目名稱Geometric Modeling for Scientific Visualization網(wǎng)絡公開度
書目名稱Geometric Modeling for Scientific Visualization網(wǎng)絡公開度學科排名
書目名稱Geometric Modeling for Scientific Visualization被引頻次
書目名稱Geometric Modeling for Scientific Visualization被引頻次學科排名
書目名稱Geometric Modeling for Scientific Visualization年度引用
書目名稱Geometric Modeling for Scientific Visualization年度引用學科排名
書目名稱Geometric Modeling for Scientific Visualization讀者反饋
書目名稱Geometric Modeling for Scientific Visualization讀者反饋學科排名
作者: conflate 時間: 2025-3-21 21:57 作者: instulate 時間: 2025-3-22 01:33
Empirical Analysis of Surface Interpolation by Spatial Environment Graphshe algorithm are the reconstruction of open surfaces with boundaries from data sets of variable density, and the treatment of sharp edges, that is, locations of infinite curvature. The empirical data in particular confirm a formal analysis which has been performed for compact surfaces of limited cur作者: 一起 時間: 2025-3-22 08:00
Smooth Polylines on Polygon Meshesmentation with possible applications to visualization, reconstruction and parameterization of complex surfaces. In this paper a simple and efficient algorithm for building smooth polylines on triangulated 2D-manifold polygonal meshes is introduced. The algorithm combines geometrical optimization wit作者: jeopardize 時間: 2025-3-22 09:25 作者: Hyperplasia 時間: 2025-3-22 15:56
Access to Surface Properties up to Order Two for Visualization Algorithmsreviously presented visualization methods were developed for a specific type of surface, although principally applicable to generic surfaces. In this paper we discuss a model for a general access to surface properties up to order two, i.e., surface-point locations, normals, and curvature properties,作者: Hyperplasia 時間: 2025-3-22 20:06
Modeling Rough Surfacesfractal dimension [1, 14]. Rough surfaces are observed at all scales independent of their origin; for example, a microscopic view of metal substrate, a cauliflower, ice, and mountains are all rough at some level. Additionally, rough surfaces are frequently generated by various technical processes, s作者: GUILT 時間: 2025-3-22 22:41 作者: VEST 時間: 2025-3-23 04:17 作者: 幻想 時間: 2025-3-23 07:41
Tree-based Data Structures for Triangle Mesh Connectivity Encodingstructures able to represent them efficiently. This is not a trivial task given that the size of a typical meshes can vary from few hundreds triangles, up to hundreds of millions of triangles for some very detailed models.作者: critique 時間: 2025-3-23 10:37 作者: STIT 時間: 2025-3-23 17:49
New Results in Signal Processing and Compression of Polygon Mesheswith limited accuracy. To support internet access to 3D models of complex virtual environments or assemblies for electronic shopping, collaborative CAD, multi-player video games, and scientific visualization, representations of 3D shapes must be compressed by several orders of magnitude. Furthermore作者: 減少 時間: 2025-3-23 21:12
Adaptively Represented Complete Distance Fields of Polygonal Modelsa quantitative measure of error nor fully capture detailed distance fields caused by corners in 3D geometries. We discuss here a complete distance field representation (CDFR) of polygonal models that does not rely on Nyquist sampling theory. In a CDFR volume, each voxel has a complete description of作者: Meditative 時間: 2025-3-23 23:28 作者: Sedative 時間: 2025-3-24 02:41 作者: 紋章 時間: 2025-3-24 06:48
Geometric Modeling for Scientific Visualization978-3-662-07443-5Series ISSN 1612-3786 Series E-ISSN 2197-666X 作者: Affection 時間: 2025-3-24 13:58 作者: 羊齒 時間: 2025-3-24 18:13 作者: HARP 時間: 2025-3-24 19:44 作者: 陰郁 時間: 2025-3-25 01:47
Dynamisches Verhalten des Schlackenbades, engineering, ranging from fluid flow over mechanical properties of solids to numerical relativity. Sometimes it is interesting to interpret them in a geometrical way, as distortions of a flat metric. The visualization of an isometric embedding of the corresponding surface can help to get an intuiti作者: 刪除 時間: 2025-3-25 06:38 作者: 盡管 時間: 2025-3-25 11:12
Dynamomaschinen für Gleich- und Wechselstromhe algorithm are the reconstruction of open surfaces with boundaries from data sets of variable density, and the treatment of sharp edges, that is, locations of infinite curvature. The empirical data in particular confirm a formal analysis which has been performed for compact surfaces of limited cur作者: DEAF 時間: 2025-3-25 13:27
https://doi.org/10.1007/978-3-540-31744-9mentation with possible applications to visualization, reconstruction and parameterization of complex surfaces. In this paper a simple and efficient algorithm for building smooth polylines on triangulated 2D-manifold polygonal meshes is introduced. The algorithm combines geometrical optimization wit作者: rods366 時間: 2025-3-25 17:37 作者: 內(nèi)向者 時間: 2025-3-25 21:06
Olga Inozemtseva,Edgar Mejía Nú?ezreviously presented visualization methods were developed for a specific type of surface, although principally applicable to generic surfaces. In this paper we discuss a model for a general access to surface properties up to order two, i.e., surface-point locations, normals, and curvature properties,作者: 軍火 時間: 2025-3-26 00:17 作者: Supplement 時間: 2025-3-26 04:39
https://doi.org/10.1007/978-1-4615-4169-1ble to surface B. The most commonly used method in the literature is iterative closest point (ICP). ICP uses either the whole surface description or feature points on the surfaces. The drawback of ICP is that it requires a good initial estimation to achieve convergence. This paper proposes a variati作者: mettlesome 時間: 2025-3-26 09:32
Bijeenkomst 1 Dyslexie nader bekeken,. Wavelet transforms based on B-spline scaling functions are frequently used to obtain continuous surface- and volume representations at multiple levels of resolution. Starting with a fine-resolution data set, wavelet decomposition provides a sequence of coarser approximations based on B-spline scal作者: Boycott 時間: 2025-3-26 14:51
Caroline Poleij,Yvonne Stikkelbroekstructures able to represent them efficiently. This is not a trivial task given that the size of a typical meshes can vary from few hundreds triangles, up to hundreds of millions of triangles for some very detailed models.作者: Preamble 時間: 2025-3-26 17:56
Zeynep Birsin ?z?akar,Fato? Yal??nkayahat all details lie in a known normal direction and hence the mesh depends only on a .. Such meshes are ideally suited for progressive compression. We demonstrate such a compression algorithm for normal meshes representing complex, arbitrary topology surfaces as they appear in 3D scanning and scient作者: subordinate 時間: 2025-3-26 22:59
https://doi.org/10.1007/978-3-319-71964-1with limited accuracy. To support internet access to 3D models of complex virtual environments or assemblies for electronic shopping, collaborative CAD, multi-player video games, and scientific visualization, representations of 3D shapes must be compressed by several orders of magnitude. Furthermore作者: uveitis 時間: 2025-3-27 01:59
Daniel Schmidt-Martin,Eamonn M. M. Quigleya quantitative measure of error nor fully capture detailed distance fields caused by corners in 3D geometries. We discuss here a complete distance field representation (CDFR) of polygonal models that does not rely on Nyquist sampling theory. In a CDFR volume, each voxel has a complete description of作者: 排他 時間: 2025-3-27 05:18 作者: BUOY 時間: 2025-3-27 10:48
https://doi.org/10.1007/978-3-662-07443-5Analysis; CAE; Triangulation; algorithms; composing; construction; data structures; geometric modeling; geom作者: 廢墟 時間: 2025-3-27 13:55
Dynamomaschinen für Gleich- und Wechselstromhe algorithm are the reconstruction of open surfaces with boundaries from data sets of variable density, and the treatment of sharp edges, that is, locations of infinite curvature. The empirical data in particular confirm a formal analysis which has been performed for compact surfaces of limited curvature without boundary.作者: 消散 時間: 2025-3-27 19:02 作者: Fibrillation 時間: 2025-3-28 01:42 作者: miniature 時間: 2025-3-28 03:26
Empirical Analysis of Surface Interpolation by Spatial Environment Graphshe algorithm are the reconstruction of open surfaces with boundaries from data sets of variable density, and the treatment of sharp edges, that is, locations of infinite curvature. The empirical data in particular confirm a formal analysis which has been performed for compact surfaces of limited curvature without boundary.作者: FLAG 時間: 2025-3-28 06:17 作者: TAIN 時間: 2025-3-28 11:52
Tree-based Data Structures for Triangle Mesh Connectivity Encodingstructures able to represent them efficiently. This is not a trivial task given that the size of a typical meshes can vary from few hundreds triangles, up to hundreds of millions of triangles for some very detailed models.作者: 別炫耀 時間: 2025-3-28 18:29 作者: 贊美者 時間: 2025-3-28 20:33
Mesh-Independent Surface Interpolationhe general problem of approximating a (. ? 1)-dimensional manifold in ?., . ≥ 2. The approach is applicable for interpolating or smoothing curve and surface data, as demonstrated here by some graphical examples.作者: 疏遠天際 時間: 2025-3-29 00:49 作者: 動脈 時間: 2025-3-29 05:29 作者: 皮薩 時間: 2025-3-29 08:31
Fully Dynamic Constrained Delaunay Triangulationsand fixed on line. As a result, a fully Dynamic Constrained Delaunay Triangulation is achieved, able to efficiently maintain a consistent triangulated representation of dynamic polygonal domains. Several applications in the fields of data visualization, reconstruction, geographic information systems and collision-free path planning are discussed.作者: 腫塊 時間: 2025-3-29 12:29
1612-3786 d disciplines, each with their own series of workshops, conferences and journals. But clearly both disciplines overlap, which led to the idea of composing a book on Geometric Modeling for Scientific Visualization. The editors received 39 submissions of high-quality research and survey papers, from w作者: overreach 時間: 2025-3-29 15:36
Olga Inozemtseva,Edgar Mejía Nú?ezpaper we discuss a model for a general access to surface properties up to order two, i.e., surface-point locations, normals, and curvature properties, (almost) regardless of the origin of the surface. Surface types and access algorithms are compared and summarized. At the end of this paper we shortly present an implementation of this model.作者: 喚起 時間: 2025-3-29 21:47 作者: Inferior 時間: 2025-3-30 01:40 作者: 藐視 時間: 2025-3-30 07:15
https://doi.org/10.1007/978-3-540-31744-9h topological modifications in order to iteratively smooth an initial crude polyline. One key feature of this algorithm is that it relies solely on the geometry of the surface and the polyline. Another key feature is that during the smoothing the polylines always stay on the surface. Different smoothing criteria are proposed.作者: 遺留之物 時間: 2025-3-30 09:52
Smooth Polylines on Polygon Meshesh topological modifications in order to iteratively smooth an initial crude polyline. One key feature of this algorithm is that it relies solely on the geometry of the surface and the polyline. Another key feature is that during the smoothing the polylines always stay on the surface. Different smoothing criteria are proposed.作者: 翻動 時間: 2025-3-30 14:06 作者: 灌溉 時間: 2025-3-30 18:36
Conference proceedings 2004But clearly both disciplines overlap, which led to the idea of composing a book on Geometric Modeling for Scientific Visualization. The editors received 39 submissions of high-quality research and survey papers, from which the 27 strongest are published in this book. All papers underwent a strict re作者: 代替 時間: 2025-3-30 22:04
1612-3786 Interpolation; Surface Interrogation and Modeling; Wavelets and Compression on Surfaces; Topology, Distance Fields and Solid Modeling; and others. .978-3-642-07263-5978-3-662-07443-5Series ISSN 1612-3786 Series E-ISSN 2197-666X 作者: 種屬關系 時間: 2025-3-31 01:31
Dynamisches Verhalten des Schlackenbades,lgorithmic method to construct a surface that corresponds to these discrete values. The fundamental idea is to use Euclidean distances to build up the surface ring by ring. The needed distances are based upon a curvature estimation of the surface and the metric.作者: 系列 時間: 2025-3-31 05:23
Bijeenkomst 1 Dyslexie nader bekeken,itate local computation of decomposition and reconstruction. We survey the most relevant results regarding wavelets and present different biorthogonal wavelet constructions based on highly efficient and simple-to-use lifting operations. Our approaches are suitable for lossy and lossless compression of large-scale data sets.作者: Lice692 時間: 2025-3-31 11:41 作者: GREEN 時間: 2025-3-31 13:22 作者: 帽子 時間: 2025-3-31 19:45 作者: antiandrogen 時間: 2025-3-31 22:39
New Results in Signal Processing and Compression of Polygon Mesheserential equations. This paper is an overview of some of our recent results in this area: Dual Mesh Resampling, Linear Anisotropic Mesh Filtering, Bi-Level Isosurface Compression, Space-Optimized Texture Maps, and Volume Warping for Adaptive Isosurface Extraction.
