.png){kind=icon}
Return
A new strategy for circularity problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0141-6359(01)00083-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The evaluation of circularity based on the minimum zone criterion as a non-linear and non-convex problem, which requires a substantial amount of computational effort in general, is investigated. A new strategy for improving the computational efficiency by collecting data points at the farthest and nearest locations from current minimum radial separation center until all collected data points meet the optimum criterion is proposed. A number of mathematical models developed in this paper indicate that the minimum circularity can be determined by using a small number of critical data points. The validated results show that the proposed strategy offers an effective way to identify the critical data points at the early stage of computation and gives an efficient approach to solve the circularity problems, especially when the number of data point is large. (C) 2001 Elsevier Science Inc. All rights reserved.
Keywords:
circularity
vertex
minimum zone
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
3.7
Papers:
3.3K
Citations:
8.3K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave no more
no more