1. Home
  2. Issues
  3. Volume 33, Issue 3 (2022)
  4. Efficient Speed-Up of the Smallest Enclo ...

Informatica


Cited by 4
Efficient Speed-Up of the Smallest Enclosing Circle Algorithm

Simple and Efficient Acceleration of the Smallest Enclosing Ball for Large Data Sets in $$E^2$$: Analysis and Comparative Results
Vaclav Skala, Matej Cerny, Josef Yassin Saleh
https://doi.org/10.1007/978-3-031-08751-6_52
Book:  Lecture Notes in Computer Science (Computational Science – ICCS 2022) Volume 13350 (2022), p. 720
A New Algorithm for the Closest Pair of Points for Very Large Data Sets Using Exponent Bucketing and Windowing
Vaclav Skala, Alejandro Esteban Martinez, David Esteban Martinez, Fabio Hernandez Moreno
https://doi.org/10.1007/978-3-031-36021-3_40
Book:  Lecture Notes in Computer Science (Computational Science – ICCS 2023) Volume 14074 (2023), p. 381
A New Highly Efficient Preprocessing Algorithm for Convex Hull, Maximum Distance and Minimal Bounding Circle in E2: Efficiency Analysis
Vaclav Skala
https://doi.org/10.1007/978-3-031-63759-9_7
Book:  Lecture Notes in Computer Science (Computational Science – ICCS 2024) Volume 14834 (2024), p. 54
Modernizing Tongue Diagnosis: AI Integration With Traditional Chinese Medicine for Precise Health Evaluation
Lanyu Jia, Jiaxin Zhang, Ruibing Zhuo, Yue Li, Rui Zhao, Min Zhang, Shu Wang
https://doi.org/10.1109/ACCESS.2024.3486118
Journal:  IEEE Access Volume 12 (2024), p. 161670


Share


RSS