OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
DOI10.1142/S0218195902000918zbMath1152.68661OpenAlexW2124492190MaRDI QIDQ4818564
Danny Z. Chen, Xiaobo Sharon Hu, Xiao Dong Wu
Publication date: 29 September 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195902000918
shortest path queriesvisibility problemsmonotone polygon coversstar-shaped polygon coversstrip covers
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Medical applications (general) (92C50)
Cites Work
- Finding the largest area axis-parallel rectangle in a polygon
- Visibility and intersection problems in plane geometry
- Simplified linear-time Jordan sorting and polygon clipping
- A polynomial solution for the Potato-peeling problem
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Simultaneous inner and outer approximation of shapes
- On some geometric optimization problems in layered manufacturing
- Minimizing support structures and trapped area in two-dimensional layered manufacturing
- On minimum-area hulls
- Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
- Euclidean shortest paths in the presence of rectilinear barriers
- A counterexample to an algorithm for computing monotone hulls of simple polygons
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An Optimal Algorithm for Finding the Kernel of a Polygon
- An optimal algorithm for intersecting line segments in the plane
This page was built for publication: OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
