The weighted Fermat triangle problem.
Shen, Yujin, Tolosa, Juan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Shen, Yujin, Tolosa, Juan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
J. M. Hammersley (1951)
Compositio Mathematica
Similarity:
Mohammadi Daniali, H.R., Zsombor-Murray, P.J., Angeles, J. (1996)
Mathematica Pannonica
Similarity:
Dawson, Robert J. MacG., Doyle, Blair (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A. M. D'Azevedo Breda, Patrícia S. Ribeiro, Altino F. Santos (2010)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Mirzoev, Tigran, Vassilev, Tzvetalin (2010)
Serdica Journal of Computing
Similarity:
We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2...
Dawson, Robert J. MacG., Doyle, Blair (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
J. L. Brown, A. J. Worsey (1992)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
Zhang, Yuqin, Ding, Ren (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Andrew Bremner, Joseph R. Goggins, Michael J.T. Guy, Richard K. Guy (2000)
Acta Arithmetica
Similarity: