CONY, an algorithm for a nonoverlapping covering of a nonconvex multipy connected polygon by simply connected sets.

Publication date: 12 November 2001

Published in: Revista Investigación Operacional (Search for Journal in Brave)

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: CONY, an algorithm for a nonoverlapping covering of a nonconvex multipy connected polygon by simply connected sets.

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