Minimum rectilinear polygons for given angle sequences
From MaRDI portal
(Redirected from Publication:824339)
Recommendations
- Minimum rectilinear polygons for given angle sequences
- Area bounds of rectilinear polygons realized by angle sequences
- Area Bounds of Rectilinear Polygons Realized by Angle Sequences
- Complexities of efficient solutions of rectilinear polygon cover problems
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
Cites work
- A polygon is determined by its angles
- An improved algorithm for reconstructing a simple polygon from its visibility angles
- Area bounds of rectilinear polygons realized by angle sequences
- Drawing polygons given angle sequences
- scientific article; zbMATH DE number 2185601 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Inapproximability of orthogonal compaction
- Minimum rectilinear polygons for given angle sequences
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On the complexity of orthogonal compaction
- Reconstructing polygons from scanner data
- Rectilinear Graphs and Their Embeddings
Cited in
(7)- Minimum degree triangulation for rectangular domains
- Minimum area polygons with two reflex angles enclosingkPoints
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
- Area Bounds of Rectilinear Polygons Realized by Angle Sequences
- Parameterized approaches to orthogonal compaction
- Parameterized approaches to orthogonal compaction
- Drawn tree decomposition: new approach for graph drawing problems
This page was built for publication: Minimum rectilinear polygons for given angle sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q824339)
