scientific article
From MaRDI portal
Publication:3670558
zbMath0521.68040MaRDI QIDQ3670558
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Related Items
Computing the intersection-depth to polyhedra ⋮ Hidden-surface removal in polyhedral cross-sections ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ An optimal visibility graph algorithm for triangulated simple polygons ⋮ Triangulations, visibility graph and reflex vertices of a simple polygon ⋮ Minimum r-Star Cover of Class-3 Orthogonal Polygons ⋮ Algorithms for fair partitioning of convex polygons ⋮ Minimum k-partitioning of rectilinear polygons ⋮ A generalized Winternitz theorem ⋮ A new triangulation-linear class of simple polygons ⋮ Algorithms for the decomposition of a polygon into convex polygons ⋮ Triangulating a simple polygon in linear time ⋮ Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures ⋮ Decomposing the boundary of a nonconvex polyhedron ⋮ Linear-time algorithms for weakly-monotone polygons ⋮ Decomposing the boundary of a nonconvex polyhedron ⋮ Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons ⋮ A practical algorithm for decomposing polygonal domains into convex polygons by diagonals ⋮ On some union and intersection problems for polygons with fixed orientations ⋮ A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
This page was built for publication:
