✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
Based on the $l_1$-metric structure for the 2D digital plane and using a Jaccard-like metric, we determine numerical characters for intersecting digital discs.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:This paper investigates problems in the characterization of the proximity of digital discs.
📊
Key Findings & Data:This paper investigates problems in the characterization of the proximity of digital discs.
💡
Conclusion & Impact:Based on the $l_1$-metric structure for the 2D digital plane and using a Jaccard-like metric, we determine numerical characters for intersecting digital discs.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Digital discs · $l_1$-metric · Jaccard like metric
Abstract
This paper investigates problems in the characterization of the proximity of digital discs. Based on the $l_1$-metric structure for the 2D digital plane and using a Jaccard-like metric, we determine numerical characters for intersecting digital discs.
🔖
Cite This Article
PETERS, J. F., KORDZAYA, K., DOCHVİRİ, İ. (2019). Computable Proximity of $\ell_1$-Discs on the Digital Plane. Communications in Advanced Mathematical Sciences, Cilt: 2 - Sayı: 3, 213–218. https://ajindex.com/articles/748288