scientific article; zbMATH DE number 1424299
From MaRDI portal
Publication:4945512
Recommendations
Cited in
(45)- Decompositions and boundary coverings of non-convex fat polyhedra
- Lower bounds for approximate polygon decomposition and minimum gap
- 3D rectangulations and geometric matrix multiplication
- Morphological decomposition and compression of binary images via a minimum set cover algorithm
- Untangling a polygon
- Decomposable near polygons
- A combinatorial property on angular orders of plane point sets
- Compressed algebraic cubature over polygons with applications to optical design
- Fair and square: cake-cutting in two dimensions
- Note on covering monotone orthogonal polygons with star-shaped polygons
- Rectangle transformation problem
- Approximation algorithms for decomposing octilinear polygons
- On guarding the vertices of rectilinear domains
- Weighted skeletons and fixed-share decomposition
- Approximate convex decomposition of polygons
- Fair multi-cake cutting
- 3D rectangulations and geometric matrix multiplication
- Decomposing Octilinear Polygons into Triangles and Rectangles
- Universal guard problems
- Minimum k-adjacent rectangles of orthogonal polygons and its application
- Polygon decomposition and switching function minimization
- Decomposing a Polygon into Simpler Components
- On k-convex polygons
- scientific article; zbMATH DE number 515326 (Why is no real title available?)
- Counting Blanks in Polygonal Arrangements
- scientific article; zbMATH DE number 2160477 (Why is no real title available?)
- scientific article; zbMATH DE number 1424443 (Why is no real title available?)
- Close-to-optimal algorithm for rectangular decomposition of 3D shapes.
- Convex Partitions with 2-Edge Connected Dual Graphs
- Cartesian product partitioning of multi-dimensional reachable state spaces
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem
- scientific article; zbMATH DE number 2197927 (Why is no real title available?)
- Cutting polygons into small pieces with chords: Laser-based localization
- Polygon decomposition for efficient construction of Minkowski sums
- Exact and approximation algorithms for computing optimal fat decompositions
- The structure of optimal partitions of orthogonal polygons into fat rectangles
- On geometric shape construction via growth operations
- Keep your distance: land division with separation
- On geometric shape construction via growth operations
- Shape decomposition algorithms for laser capture microdissection
- Convex partitions with 2-edge connected dual graphs
- Uniformly monotone partitioning of polygons
- Minimum star partitions of simple polygons in polynomial time
- Approximate convex decomposition of polyhedra and its applications
- Computing the Fréchet distance between simple 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 Q4945512)
