OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
From MaRDI portal
Recommendations
Cites work
- A counterexample to an algorithm for computing monotone hulls of simple polygons
- A polynomial solution for the Potato-peeling problem
- An Optimal Algorithm for Finding the Kernel of a Polygon
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An optimal algorithm for intersecting line segments in the plane
- Euclidean shortest paths in the presence of rectilinear barriers
- Finding the largest area axis-parallel rectangle in a polygon
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Minimizing support structures and trapped area in two-dimensional layered manufacturing
- On minimum-area hulls
- On some geometric optimization problems in layered manufacturing
- Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
- Simplified linear-time Jordan sorting and polygon clipping
- Simultaneous inner and outer approximation of shapes
- Visibility and intersection problems in plane geometry
Cited in
(2)
This page was built for publication: OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818564)