Location:
Search - minkowski
Search list
Description: 分形维数作为科学研究的重要工具之一,它是描述自然界和非线性系统中不光滑和不规则几何体的有效工具,其
计算方法已经有多种,应用领域也是十分广泛。然而,各种方法各有不同,文中就此对常用分形维数计算方法进行了系统
的综合与研究,主要包括圆规法、明科斯基方法、变换方法、盒子计算方法、周长- 面积法、裂缝岛屿方法、分形布朗模型法,
对每种方法的含义和模型及相关的应用领域进行了阐述,并给出了其方法的计算机实现算法。-As one of science study tools ,fractal dimension is usually an effective way that used to describe the non- smooth and non- regu2
lar geometry objects in the nature and non- linear systems. There are all kinds of methods about calculating it . Its application is greatly
wide ,but there are distinctive differences between these methods. According to these , this paper studies and integrates these methods sys2
tematically ,including Compass Method ,Minkowski Method ,Variation Method ,Box counting Method ,Perimeter Area Method ,Slit island
Method ,Fractal Brown model Method. This paper also expatiated the meanings ,basic models and the application in each field. At the same
time ,algorithms of these methods implemented by the computer are found in the paper.
Platform: |
Size: 271360 |
Author: 范达内 |
Hits:
Description: A set (e.g. an image) is called "fractal" if it displays self-similarity: it can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole.
A possible characterisation of a fractal set is provided by the "box-counting" method: The number N of boxes of size R needed to cover a fractal set follows a power-law, N = N0 * R^(-DF), with DF<=D (D is the dimension of the space, usually D=1, 2, 3).
DF is known as the Minkowski-Bouligand dimension, or Kolmogorov capacity, or Kolmogorov dimension, or simply box-counting dimension.
Platform: |
Size: 1681408 |
Author: piri_small |
Hits:
Description: visibility graph code developed on matlab, which uses astar search algorithm and minkowski difference - developed and updated from the previosly uploaded java source code
Platform: |
Size: 7168 |
Author: jackass243 |
Hits:
Description: calculate minkowski distance
Platform: |
Size: 2908160 |
Author: fafa |
Hits:
Description: Minkowski香肠线 迭代分形图 Matlab-Minkowski sausage line iteration fractal images
Platform: |
Size: 1024 |
Author: 李立 |
Hits:
Description: ANN是一个构造数据索引结果的程序，可以实现最近邻、KD树等功能。ANN is designed for data sets that
are small enough that the search structure can be stored in main memory (in contrast to approaches from databases that assume that the data resides in secondary storage). Points are assumed to be represented as coordinate vectors of reals (or integers). The distance between two points can be defi ned in many ways. ANN assumes that distances are measured using any class of distance
functions called Minkowski metrics. These include the well known Euclidean distance, Manhattan distance, and max distance.-One diffi culty with exact nearest neighbor searching is that for virtually all methods other
than brute-force search, the running time or space grows exponentially as a function of dimension.
Consequently these methods are often not signifi cantly better than brute-force search, except in
fairly small dimensions.
Platform: |
Size: 999424 |
Author: fhqu |
Hits:
Description: Minkowski Addition
Platform: Any
Language: C
Graphical Library: Allegro
Platform: |
Size: 3072 |
Author: Ju994lo |
Hits:
Description: Generalized minkowski distance inplementation in matlab.
Platform: |
Size: 1024 |
Author: Mahtab |
Hits:
Description: CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和三维的点，2D加权Voronoi图，分割Voronoi图等），多边形（布尔操作，偏置），多面体（布尔运算），曲线整理及其应用，网格生成（二维Delaunay网格生成和三维表面和体积网格生成等），几何处理（表面网格简化，细分和参数化等），凸壳算法（2D，3D和dD），搜索结构（近邻搜索，kd树等），插值，形状分析，拟合，距离等。-The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... More on the projects using CGAL web page.
The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations, and Delaunay triangulations and periodic triangulations in 2D and 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi diagrams, and segment Voronoi diagrams), polygons (Boolean operations, offsets, straight skeleton), polyhedra (Boolean operations), arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums), mesh generation (2D Del
Platform: |
Size: 18593792 |
Author: a |
Hits:
Description: Mathematic Algorithm to make correlation Minkowski
Platform: |
Size: 80896 |
Author: Sophie |
Hits:
Description: Herman Minkowski Image Processing Correlation using Matlab
Platform: |
Size: 80896 |
Author: Sophie |
Hits:
Description: Minkowski curve matlab code
Platform: |
Size: 1024 |
Author: Mosi |
Hits:
Description: Classification using Minkowski Euclidean
Platform: |
Size: 1024 |
Author: ilam |
Hits:
Description: 这是一个实现简单的多数表决法的KNN算法。KNN算法涉及三个重要的步骤，分别是决定K的大小；距离的表达方法（一般有欧式距离，曼哈顿距离，Minkowski距离）；决策方法（多数表决法，KD树法等）。本程序是采用多数表决的决策方法，距离表达采用欧式距离。适用于小样本少特征的数据集。(KNN algorithm realized by MATLAB, useful for small training set and less features.)
Platform: |
Size: 2048 |
Author: 乃肥
|
Hits: