Computing an obnoxious anchored segment. (Q1413920): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a Segment Center for a Planar Point Set
@@ Property / cites work: Computing a Segment Center for a Planar Point Set / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of Point Sets by 1-Corner Polygonal Chains
+Normal rank
@@ Property / cites work @@
+The Largest Empty Annulus Problem
@@ Property / cites work: The Largest Empty Annulus Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a largest empty anchored cylinder, and related problems
+Normal rank
@@ Property / cites work @@
+Q3141900
@@ Property / cites work: Q3141900 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the width of a set
@@ Property / cites work: Computing the width of a set / rank @@
+Normal rank
@@ Property / cites work @@
+-Segment Center Problems
@@ Property / cites work: 1-Segment Center Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric complexity of some location problems
@@ Property / cites work: Geometric complexity of some location problems / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
+Normal rank
@@ Property / cites work @@
+Q4325546
@@ Property / cites work: Q4325546 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing largest empty circles with location constraints
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(03)00015-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1994404645
@@ Property / OpenAlex ID: W1994404645 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1413920