Pages that link to "Item:Q2507162"
From MaRDI portal
The following pages link to Approximate convex decomposition of polygons (Q2507162):
Displaying 18 items.
- Convex partitions with 2-edge connected dual graphs (Q652620) (← links)
- Approximate convex decomposition of polyhedra and its applications (Q735498) (← links)
- Decomposition and intersection of simple splinegons (Q1105375) (← links)
- Efficient regular polygon dissections (Q1573694) (← links)
- Decomposable near polygons (Q1890397) (← links)
- A general method for decomposing self-intersecting polygon to normal based on self-intersection points (Q2006782) (← links)
- A new area-based convexity measure with distance weighted area integration for planar shapes (Q2010290) (← links)
- Fast and reliable transient simulation and continuous optimization of large-scale gas networks (Q2155383) (← links)
- Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization (Q2310126) (← links)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
- Weighted skeletons and fixed-share decomposition (Q2483555) (← links)
- Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application (Q3192956) (← links)
- Computing deviations from convexity in polygons (Q4274674) (← links)
- Morphological decomposition of 2-D binary shapes into convex polygons: a heuristic algorithm (Q4419828) (← links)
- SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition (Q5104667) (← links)
- Convex Partitions with 2-Edge Connected Dual Graphs (Q5323063) (← links)
- Approximate convex decomposition of polygons (Q5361650) (← links)
- A multi-dimensional unified concavity and convexity detection method based on geometric algebra (Q6577786) (← links)
