• Corpus ID: 63879684

The Research on the Complexity of Progressive Die Edge

@article{Qiyang2006TheRO,
  title={The Research on the Complexity of Progressive Die Edge},
  author={Zuo Qi-yang},
  journal={Journal of Engineering Graphics},
  year={2006},
  url={https://api.semanticscholar.org/CorpusID:63879684}
}
  • Zuo Qi-yang
  • Published 2006
  • Engineering
  • Journal of Engineering Graphics
In this paper, the research about how to describe and measure a graphic’s complexity was emphasized, two quantificational definition, B and C, were brought forward and the method to calculate C was presented.
No Paper Link Available
5 Citations
Background Citations
1
Methods Citations
1

5 Citations

Complexity Computation of Two-dimensional Graphics and Complexity Analysis of Leaf Contour

A new method called Standard Deviation of Distance (SDD) is proposed, under the method which is rotation invariant, all the complexity of two-dimensional graphics can be calculated and it can be well popularized to the study of plant leaves.

Comparative Study on the Effect of Shape Complexity on the Efficiency of Different Overlay Analysis Algorithms

The experimental results show that the calculated performances of the intersection, union, difference and symmetric difference operators belonging to the same algorithm are similar to their sensitivity to thesame polygon shape.

Copyright authentication of digital vector maps based on spatial autocorrelation indices

The robustness suggests that this method can readily support business applications for copyright certification of digital vector maps and is robust to translation, scaling, compression, rotation and edit operations.

Multicore Parallelized Spatial Overlay Analysis Algorithm Using Vector Polygon Shape Complexity Index Optimization

A data partitioning method based on shape complexity index optimization, which achieves data equalization among multicore parallel computing tasks, and multicore parallelism is achieved based on OpenMP.

A Data Allocation Strategy for Geocomputation Based on Shape Complexity in A Cloud Environment Using Parallel Overlay Analysis of Polygons as an Example

Experimental results showed that the spatial data allocation strategy based on the complexity of polygon shape computing effectively solved the problem of data skew in the parallel spatial analysis of massive complex polygons.