Numerically robust computation of circular visibility (Q1693670): Difference between revisions

@@ Property / author @@
-Thomas Sauer
@@ Property / author: Thomas Sauer / rank @@
-Normal rank
@@ Property / author @@
+Thomas Sauer
@@ Property / author: Thomas Sauer / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2774042655
@@ Property / OpenAlex ID: W2774042655 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03356
@@ Property / arXiv ID: 1611.03356 / rank @@
+Normal rank
@@ Property / cites work @@
+CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for constructing a circular visibility diagram
+Normal rank
@@ Property / cites work @@
+The Problem of Apollonius
@@ Property / cites work: The Problem of Apollonius / rank @@
+Normal rank
@@ Property / cites work @@
+BIARC APPROXIMATION, SIMPLIFICATION AND SMOOTHING OF POLYGONAL CURVES BY MEANS OF VORONOI-BASED TOLERANCE BANDS
+Normal rank
@@ Property / cites work @@
+Optimal arc spline approximation
@@ Property / cites work: Optimal arc spline approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Q2949594
@@ Property / cites work: Q2949594 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1693670