Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2009.04.019
@@ Property / DOI: 10.1016/j.dam.2009.04.019 / rank @@
-Normal rank
@@ Property / author @@
-Shin-ichi Tanigawa
@@ Property / author: Shin-ichi Tanigawa / rank @@
-Normal rank
@@ Property / author @@
+Shin-ichi Tanigawa
@@ Property / author: Shin-ichi Tanigawa / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2122233371
@@ Property / OpenAlex ID: W2122233371 / rank @@
+Normal rank
@@ Property / cites work @@
+Transforming spanning trees and pseudo-triangulations
+Normal rank
@@ Property / cites work @@
+Gray code enumeration of plane straight-line graphs
+Normal rank
@@ Property / cites work @@
+Sequences of spanning trees and a fixed tree theorem
+Normal rank
@@ Property / cites work @@
+On the number of plane geometric graphs
@@ Property / cites work: On the number of plane geometric graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A quadratic distance bound on sliding between crossing-free spanning trees
+Normal rank
@@ Property / cites work @@
+Q4945520
@@ Property / cites work: Q4945520 / rank @@
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
+Normal rank
@@ Property / cites work @@
+Enumerating constrained non-crossing minimally rigid frameworks
+Normal rank
@@ Property / cites work @@
+Enumerating pseudo-triangulations in the plane
@@ Property / cites work: Enumerating pseudo-triangulations in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for enumeration of triangulations
+Normal rank
@@ Property / cites work @@
+Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for determining the convex hull of a finite planar set
+Normal rank
@@ Property / cites work @@
+On local transformation of polygons with visibility properties.
+Normal rank
@@ Property / cites work @@
+Graphs of non-crossing perfect matchings
@@ Property / cites work: Graphs of non-crossing perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs of triangulations and perfect matchings
@@ Property / cites work: Graphs of triangulations and perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Flipping edges in triangulations
@@ Property / cites work: Flipping edges in triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of detecting crossingfree configurations in the plane
+Normal rank
@@ Property / cites work @@
+Corrections to Lee's visibility polygon algorithm
@@ Property / cites work: Corrections to Lee's visibility polygon algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Fast enumeration algorithms for non-crossing geometric graphs
+Normal rank
@@ Property / cites work @@
+Visibility of a simple polygon
@@ Property / cites work: Visibility of a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871757
@@ Property / cites work: Q4871757 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2009.04.019
@@ Property / DOI: 10.1016/J.DAM.2009.04.019 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:967420