Minimum convex partition of a polygon with holes by cuts in given directions
From MaRDI portal
Publication:6487451
DOI10.1007/BFB0009508zbMATH Open1512.68418MaRDI QIDQ6487451FDOQ6487451
Authors: Andrzej Lingas, Valeriu Soltan 
Publication date: 25 January 2023
Recommendations
- Minimum convex partition of a polygon with holes by cuts in given directions
- MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
- Minimum convex partition of polygonal domains by guillotine cuts
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
- On convex partitions of polygonal regions
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Title not available (Why is that?)
- Planar Formulae and Their Uses
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Algorithms for Geometric Graph Search Problems
- Some NP-hard polygon decomposition problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposing a Polygon into Simpler Components
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding a manhattan path and related problems
- An O(n log n) Manhattan path algorithm
- Rectangular partition is polynomial in two dimensions but NP-complete in three
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
- Title not available (Why is that?)
- Partition of a plane set into a finite number of d-convex parts
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Minimum convex partition of a polygon with holes by cuts in given directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487451)
