Login
Register
Home
Issues
Volume 33, Issue 3 (2022)
Efficient Speed-Up of the Smallest Enclo ...
Informatica
Information
Submit your article
For Referees
Help
ATTENTION!
Article info
Full article
Cited by
More
Article info
Full article
Cited by
Cited by
2
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
Export citation
Copy and paste formatted citation
Formatted citation
Placeholder
Citation style
AMS -- Americal Mathematical Society
APA -- American Psychological Association 6th ed.
Chicago -- The Chicago Manual of Style 17th ed.
Download citation in file
Export format
BibTeX
RIS
Authors
Placeholder
Share
RSS
To top