Algorithms for the decomposition of a polygon into convex polygons

Author： Fernandez J. Canovas L. Pelegrn B.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.121, Iss.2, 2000-03, pp. : 330-342

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On genetic algorithms for the packing of polygons

By Jakobs S.

European Journal of Operational Research, Vol. 88, Iss. 1, 1996-01 ,pp. : 165-181

Elsevier

Access to resources Recommend Favorite

DECOPOL - Codes for decomposing a polygon into convex subpolygons

By Fernandez J. Canovas L. Pelegrin B.

European Journal of Operational Research, Vol. 102, Iss. 1, 1997-10 ,pp. : 242-243

Elsevier

Access to resources Recommend Favorite

Aperiodic orbits of piecewise rational rotations of convex polygons with recursive tiling

By Lowenstein J. H.

Dynamical Systems: An International Journal, Vol. 22, Iss. 1, 2007-03 ,pp. : 25-63

Taylor & Francis Ltd

Access to resources Recommend Favorite

Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem

By Stoyan Y.G. Novozhilova M.V. Kartashov A.V.

European Journal of Operational Research, Vol. 92, Iss. 1, 1996-07 ,pp. : 193-210

Elsevier

Access to resources Recommend Favorite

Iterative bundle-based decomposition for large-scale nonseparable convex optimization

By Park K. Shin Y.-S.

European Journal of Operational Research, Vol. 111, Iss. 3, 1998-12 ,pp. : 598-616

Elsevier

Access to resources Recommend Favorite