A new algorithm for the minimal-area convex enclosure problem (Q1127205): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3999207
@@ Property / cites work: Q3999207 / rank @@
+Normal rank
@@ Property / cites work @@
+Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
+Normal rank
@@ Property / cites work @@
+Determining the minimum-area encasing rectangle for an arbitrary closed curve
+Normal rank
@@ Property / cites work @@
+Applied simulated annealing
@@ Property / cites work: Applied simulated annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023849
@@ Property / cites work: Q4023849 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1127205