An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing

Author： Lipovetsky Evgeny   Dyn Nira  

Publisher： Springer Publishing Company

ISSN： 1019-7168

Source： Advances in Computational Mathematics, Vol.26, Iss.1-3, 2007-01, pp. : 269-282

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

An efficient algorithm for fuzzy weighted average

By Dong H.L.   Park D.  

Fuzzy Sets and Systems, Vol. 87, Iss. 1, 1997-04 ,pp. : 39-45

Elsevier

Access to resources Recommend Favorite

A convex optimization algorithm for frequency‐domain identification in the v‐gap metric

By  

INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING, Vol. 29, Iss. 3, 2015-03 ,pp. : 362-371

John Wiley & Sons Inc

Access to resources Recommend Favorite

Convex Polygons and Common Transversals

By  

American Mathematical Monthly, Vol. 122, Iss. 9, 2015-11 ,pp. : 836-844

Mathematical Association of America

Access to resources Recommend Favorite

An Efficient Algorithm for Solving Convex–Convex Quadratic Fractional Programs

By Yamamoto R.   Konno H.  

Journal of Optimization Theory and Applications, Vol. 133, Iss. 2, 2007-05 ,pp. : 241-255

Springer Publishing Company

Access to resources Recommend Favorite

A note on the compactness of the index set in convex optimization. Application to metric regularity

By Canovas M. J.  

Optimization, Vol. 59, Iss. 4, 2010-05 ,pp. : 477-483

Taylor & Francis Ltd

Access to resources Recommend Favorite