Computing farthest neighbors on a convex polytope. (Q1401257): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Farthest neighbors, maximum spanning trees and related problems in higher dimensions
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding all farthest neighbors in a convex polygon
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the three-dimensional diameter problem
+Normal rank
@@ Property / cites work @@
+Applications of random sampling in computational geometry. II
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for the all-nearest-neighbors problem
+Normal rank