Empty Monochromatic Simplices
- 期刊名称Discrete & Computational Geometry
- 作者Aichholzer, Oswin; Fabila-Monroy, Ruy; Hackl, Thomas; Huemer, Clemens; Urrutia, Jorge
- 卷第51卷
- 期第2期
- 印刷ISSN0179-5376
- 电子ISSN1432-0444
- 文件大小1118.84KB
- 发表时间2014-03
- DOI10.1007/s00454-013-9565-2
- 页码362-393
Pythagoras' Theorem for AreasJean-P. Quadrat, Jean B. Lasserre and Jean-B. Hiriart-Urruty · The American Mathematical Monthly · 2001
A discrete Farkas lemmaJean B. Lasserre · 2004
Representation of nonnegative convex polynomialsJean B. Lasserre · 2008
Robust global optimization with polynomialsJean B. Lasserre · Mathematical Programming · 2006
Convex sets with semidefinite representationJean B. Lasserre · 2009
On convex optimization without convex representationJean B. Lasserre · 2011
PrefaceOnésimo Hernández-Lerma; Jean B. Lasserre · 1991
The existence of Gaussian cubature formulasJean B. Lasserre · 2012
Two poset polytopesRichard P. Stanley · Discrete and Computational Geometry · 1986
Voronoi diagrams and arrangementsHerbert Edelsbrunner; Raimund Seidel · Discrete and Computational Geometry · 1986
Can you cover your shadows?H. E. Debrunner; P. Mani-Levitska · Discrete and Computational Geometry · 1986
Computing circular separabilityJoseph O'Rourke; S. Rao Kosaraju; Nimrod Megiddo · Discrete and Computational Geometry · 1986
Smooth, easy to compute interpolating splinesJohn D. Hobby · Discrete and Computational Geometry · 1986
On polyhedra with transitivity propertiesJ. M. Wills · Discrete and Computational Geometry · 1986
Approximation of convex discs by polygonsA. Florian · Discrete and Computational Geometry · 1986
Diameter partitioningDavid Avis · Discrete and Computational Geometry · 1986