Decomposing a simple polygon into pseudo-triangles and convex polygons (Q934018): Difference between revisions

@@ Property / cites work @@
+Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+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 @@
+Q3750120
@@ Property / cites work: Q3750120 / rank @@
+Normal rank
@@ Property / cites work @@
+Ray shooting in polygons using geodesic triangulations
+Normal rank
@@ Property / cites work @@
+Minimum convex partition of a constrained point set
+Normal rank
@@ Property / cites work @@
+Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
+Normal rank
@@ Property / cites work @@
+Minimum weight pseudo-triangulations
@@ Property / cites work: Minimum weight pseudo-triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a Polygon into Simpler Components
@@ Property / cites work: Decomposing a Polygon into Simpler Components / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
+Normal rank
@@ Property / cites work @@
+KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
@@ Property / cites work: KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Minimum Convex Partition Problem
+Normal rank
@@ Property / cites work @@
+Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
+Normal rank
@@ Property / cites work @@
+Q3601515
@@ Property / cites work: Q3601515 / rank @@
+Normal rank
@@ Property / cites work @@
+Topologically sweeping visibility complexes via pseudotriangulations
+Normal rank
@@ Property / cites work @@
+Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
+Normal rank