scientific article; zbMATH DE number 3767037
From MaRDI portal
Publication:3948588
Cited in
(22)- A fixed parameter algorithm for optimal convex partitions
- Digitization scheme that assures faithful reconstruction of plane figures
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
- On convex partitions of polygonal regions
- Erased arrangements of linear and convex decompositions of polyhedra
- Algorithms for the decomposition of a polygon into convex polygons
- Approximate convex decomposition of polygons
- Decomposing the boundary of a nonconvex polyhedron
- Convex polygons made from few lines and convex decompositions of polyhedra
- SFCDecomp: multicriteria optimized tool path planning in 3D printing using space-filling curve based domain decomposition
- Convex Partitions with 2-Edge Connected Dual Graphs
- Minimum weight convex Steiner partitions
- Rectangularization of digital objects and its relation with straight skeletons
- Minimum convex partition of a polygon with holes by cuts in given directions
- Convex partitions with 2-edge connected dual graphs
- Decomposing the boundary of a nonconvex polyhedron
- On the minimality of polygon triangulation
- A decision procedure for optimal polyhedron partitioning
- Rectangular partition is polynomial in two dimensions but NP-complete in three
- Minimum k-partitioning of rectilinear polygons
- Triangulating a nonconvex polytope
- Some theoretical challenges in digital geometry: a perspective
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 Q3948588)
