scientific article; zbMATH DE number 3825165
From MaRDI portal
Publication:3670558
Cited in
(21)- A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
- On some union and intersection problems for polygons with fixed orientations
- Hidden-surface removal in polyhedral cross-sections
- An optimal visibility graph algorithm for triangulated simple polygons
- Triangulations, visibility graph and reflex vertices of a simple polygon
- Triangulating a simple polygon in linear time
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
- Algorithms for the decomposition of a polygon into convex polygons
- Computing the intersection-depth to polyhedra
- Minimum \(r\)-star cover of class-3 orthogonal polygons
- A new triangulation-linear class of simple polygons
- Decomposing the boundary of a nonconvex polyhedron
- A generalized Winternitz theorem
- Decomposing the boundary of a nonconvex polyhedron
- Linear-time algorithms for weakly-monotone polygons
- Sweeping a domain with line-of-sight between covisible agents
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Algorithms for fair partitioning of convex polygons
- Minimum k-partitioning of rectilinear polygons
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670558)
