Triangulations intersect nicely (Q1816461): Difference between revisions

@@ Property / author @@
-Oswin Aichholzer
@@ Property / author: Oswin Aichholzer / rank @@
-Normal rank
@@ Property / author @@
-Franz Aurenhammer
@@ Property / author: Franz Aurenhammer / rank @@
-Normal rank
@@ Property / author @@
-Naoki Katoh
@@ Property / author: Naoki Katoh / rank @@
-Normal rank
@@ Property / author @@
-Günter Rote
@@ Property / author: Günter Rote / rank @@
-Normal rank
@@ Property / author @@
-Yin-Feng Xu
@@ Property / author: Yin-Feng Xu / rank @@
-Normal rank
@@ Property / author @@
+Oswin Aichholzer
@@ Property / author: Oswin Aichholzer / rank @@
+Normal rank
@@ Property / author @@
+Franz Aurenhammer
@@ Property / author: Franz Aurenhammer / rank @@
+Normal rank
@@ Property / author @@
+Naoki Katoh
@@ Property / author: Naoki Katoh / rank @@
+Normal rank
@@ Property / author @@
+Günter Rote
@@ Property / author: Günter Rote / rank @@
+Normal rank
@@ Property / author @@
+Yin-Feng Xu
@@ Property / author: Yin-Feng Xu / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198785
@@ Property / cites work: Q4198785 / rank @@
+Normal rank
@@ Property / cites work @@
+Comments on bases in dependence structures
@@ Property / cites work: Comments on bases in dependence structures / rank @@
+Normal rank
@@ Property / cites work @@
+Some properties of basic families of subsets
@@ Property / cites work: Some properties of basic families of subsets / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained independence system and triangulations of planar point sets
+Normal rank
@@ Property / cites work @@
+Q3484375
@@ Property / cites work: Q3484375 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast greedy triangulation algorithms.
@@ Property / cites work: Fast greedy triangulation algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A space efficient greedy triangulation algorithm
@@ Property / cites work: A space efficient greedy triangulation algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Flipping edges in triangulations
@@ Property / cites work: Flipping edges in triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a subgraph of the minimum weight triangulation
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+The greedy triangulation can be computed from the Delaunay triangulation in linear time
+Normal rank
@@ Property / cites work @@
+Q4875212
@@ Property / cites work: Q4875212 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4525730
@@ Property / cites work: Q4525730 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1816461