Placing two disks in a convex polygon

DOI10.1016/S0020-0190(99)00154-4MaRDI QIDQ1583047zbMATH OpenOpenAlexFDO

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

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

computational geometryconvex polygonoptimization

Mathematics Subject Classification ID

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

Cites work

• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Efficient randomized algorithms for some geometric optimization problems
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• On the computational geometry of pocket machining

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583047)