A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (Q1001364): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11750-008-0055-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2114531006
@@ Property / OpenAlex ID: W2114531006 / rank @@
+Normal rank
@@ Property / cites work @@
+The concept of state in discrete dynamic programming
+Normal rank
@@ Property / cites work @@
+DECOPOL -- Codes for decomposing a polygon into convex subpolygons
+Normal rank
@@ Property / cites work @@
+Algorithms for the decomposition of a polygon into convex polygons
+Normal rank
@@ Property / cites work @@
+FIST: fast industrial-strength triangulation of polygons
+Normal rank
@@ Property / cites work @@
+Q3670558
@@ Property / cites work: Q3670558 / 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 @@
+Approximate convex decomposition of polygons
@@ Property / cites work: Approximate convex decomposition of polygons / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTATIONAL GEOMETRY COLUMN 29
@@ Property / cites work: COMPUTATIONAL GEOMETRY COLUMN 29 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
+Normal rank