Pages that link to "Item:Q5361650"
From MaRDI portal
The following pages link to Approximate convex decomposition of polygons (Q5361650):
Displaying 15 items.
- Approximate convex decomposition of polyhedra and its applications (Q735498) (← links)
- A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (Q1001364) (← links)
- Decomposition and intersection of simple splinegons (Q1105375) (← links)
- Efficient regular polygon dissections (Q1573694) (← links)
- Decomposable near polygons (Q1890397) (← links)
- Algorithms for the decomposition of a polygon into convex polygons (Q1969864) (← links)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- Approximate convex decomposition of polygons (Q2507162) (← links)
- Convex Decomposition of Polyhedra and Robustness (Q3990658) (← links)
- Computing deviations from convexity in polygons (Q4274674) (← links)
- Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm (Q4419828) (← links)
- (Q4763415) (← links)
- (Q4945679) (← links)
- Algorithms and a Library for the Exact Computation of the Cumulative Distribution Function of the Euclidean Distance Between a Point and a Random Variable Uniformly Distributed in Disks, Balls, or Polygones and Application to Probabilistic Seismic Hazard (Q6173262) (← links)