The following pages link to (Q3670558):
Displayed 20 items.
- A generalized Winternitz theorem (Q657008) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- Linear-time algorithms for weakly-monotone polygons (Q685601) (← links)
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q809630) (← links)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- Algorithms for fair partitioning of convex polygons (Q896117) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q982944) (← links)
- A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (Q1001364) (← links)
- On some union and intersection problems for polygons with fixed orientations (Q1067413) (← links)
- Hidden-surface removal in polyhedral cross-sections (Q1104083) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- Triangulations, visibility graph and reflex vertices of a simple polygon (Q1126249) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Algorithms for the decomposition of a polygon into convex polygons (Q1969864) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Minimum r-Star Cover of Class-3 Orthogonal Polygons (Q2946065) (← links)
- A new triangulation-linear class of simple polygons (Q3804191) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q5056155) (← links)