Heilbronn triangle‐type problems in the unit square [0,1] <sup>2</sup>-Reference-Cited by-同舟云学术

Heilbronn triangle‐type problems in the unit square [0,1] ²

Published:2022-07-25 Issue:3 Volume:62 Page:585-599
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Algorithms

Author:

Benevides Fabricio S.¹,Hoppen Carlos²,Lefmann Hanno³,Odermann Knut³

Affiliation:

1. Departamento de Matemática Universidade Federal do Ceará (UFC), Campus do Pici Fortaleza Ceará Brazil

2. Instituto de Matemática e Estatística Universidade Federal do Rio Grande do Sul (UFRGS), Avenida Bento Gonçalves Porto Alegre Rio Grande do Sul Brazil

3. Fakultät für Informatik Technische Universität Chemnitz Chemnitz Germany

Funder

CNPq

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.21109

Reference25 articles.

1. Extremal uncrowded hypergraphs

2. A Lower Bound for Heilbronn's Triangle Problem in d Dimensions

3. G.BarequetandJ.Naor.Largek−D$$ \mathrm{k}-\mathrm{D} $$simplices in theD$$ \mathrm{D} $$‐dimensional unit cube Proc. 17th Canadian Conf. Comput. Geometry CCCG'05; 2005:31‐34.http://www.cccg.ca/proceedings/2005/27.ps

4. On Heilbronn triangle‐type problems in higher dimensions;Benevides F. S.;Acta Math. Univ. Comen.,2019

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Global Optimization for Heilbronn Problem of Convex Polygons Based on Bilinear Matrix Inequalities Solving;Journal of Systems Science and Complexity;2024-09-07