Algorithms for deciding the containment of polygons
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3911704
- A new algorithm for the two-polygon containment problem
- Containment of a single polygon using mathematical programming
- scientific article; zbMATH DE number 4211553
- An optimal algorithm for finding the separation of simple polygons
- Algorithms for the decomposition of a polygon into convex polygons
- Extremal polygon containment problems
- An algorithm for covering polygons with rectangles
- Algorithmic enumeration of surrounding polygons
Cites work
- scientific article; zbMATH DE number 3911704 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4051003 (Why is no real title available?)
- scientific article; zbMATH DE number 30304 (Why is no real title available?)
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Dynamization of order decomposable set problems
- Efficient maintenance of the union of intervals on a line, with applications
- Polygon containment under translation
- Topologically sweeping an arrangement
- Triangulating a simple polygon in linear time
Cited in
(6)- scientific article; zbMATH DE number 701117 (Why is no real title available?)
- scientific article; zbMATH DE number 3893909 (Why is no real title available?)
- scientific article; zbMATH DE number 4180839 (Why is no real title available?)
- scientific article; zbMATH DE number 4051003 (Why is no real title available?)
- scientific article; zbMATH DE number 3911704 (Why is no real title available?)
- Polygon containment under translation
This page was built for publication: Algorithms for deciding the containment of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671621)
