Placing two disks in a convex polygon

DOI10.1016/S0020-0190(99)00154-4zbMath0953.68616OpenAlexW2013803721MaRDI QIDQ1583047

Tae-Cheon Yang, Sung Kwon Kim, Chan-Su Shin

Publication date: 26 October 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00154-4

zbMATH Keywords

optimizationconvex polygoncomputational geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Packing two disks in a polygon ⋮ Packing two disks into a polygonal environment. ⋮ Three problems about simple polygons

Cites Work

• Unnamed Item
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• On the computational geometry of pocket machining
• Efficient randomized algorithms for some geometric optimization problems
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms

This page was built for publication: Placing two disks in a convex polygon