COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME (Q4513231): Difference between revisions

@@ Property / author @@
-Q208477
@@ Property / author: Q208477 / rank @@
-Normal rank
@@ Property / author @@
+David G. Kirkpatrick
@@ Property / author: David G. Kirkpatrick / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Computing shortest transversals
@@ Property / cites work: Computing shortest transversals / rank @@
+Normal rank
@@ Property / cites work @@
+Fast detection of polyhedral intersection
@@ Property / cites work: Fast detection of polyhedral intersection / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the extreme distances between two convex polygons
+Normal rank
@@ Property / cites work @@
+COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
+Normal rank
@@ Property / cites work @@
+Maintenance of configurations in the plane
@@ Property / cites work: Maintenance of configurations in the plane / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0218195999000054
+Normal rank
@@ Property / OpenAlex ID @@
+W2110595174
@@ Property / OpenAlex ID: W2110595174 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4513231