Applications of random sampling to on-line algorithms in computational geometry (Q1192610): Difference between revisions

@@ Property / author @@
-René Schott
@@ Property / author: René Schott / rank @@
-Normal rank
@@ Property / author @@
+René Schott
@@ Property / author: René Schott / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3716335
@@ Property / cites work: Q3716335 / rank @@
+Normal rank
@@ Property / cites work @@
+A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
+Normal rank
@@ Property / cites work @@
+On the randomized construction of the Delaunay tree
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for intersecting line segments in the plane
+Normal rank
@@ Property / cites work @@
+Combinatorial complexity bounds for arrangements of curves and spheres
+Normal rank
@@ Property / cites work @@
+Applications of random sampling in computational geometry. II
+Normal rank
@@ Property / cites work @@
+Higher-dimensional Voronoi diagrams in linear expected time
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038708
@@ Property / cites work: Q4038708 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3975933
@@ Property / cites work: Q3975933 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1192610