Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference9 articles.
1. Efficient algorithms for computing the maximum distance between two finite planar sets;Bhattacharya;J. Algorithms,1983
2. Detection is easier than computation;Chazelle,1980
3. Optimal algorithms for the intersection and the minimum distance problems between planar polygons;Chin,1982
4. Fast detection of polyhedral intersections;Dobkin,1982
5. A linear algorithm for finding the convex hull of a simple polygon;McCallum;Inform. Process. Lett.,1979
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. New variants of perfect non-crossing matchings;Discrete Applied Mathematics;2024-01
2. On Computing the Time-varying Distance between Moving Bodies;ACM Transactions on Spatial Algorithms and Systems;2023-11-20
3. Collision Detection of NURBS Surface Split Technology;2021 International Conference on Big Data Analytics for Cyber-Physical System in Smart City;2022
4. Construction of Hyperplane, Supporting Hyperplane, and Separating Hyperplane on ℝ
n
and Its Application;Journal of Physics: Conference Series;2021-02-01
5. The distance between two convex sets in Hilbert space;THE 2ND SCIENCE AND MATHEMATICS INTERNATIONAL CONFERENCE (SMIC 2020): Transforming Research and Education of Science and Mathematics in the Digital Age;2021