You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/unesp/360735
Title: 
Heilbronn triangles in the unit square
Author(s): 
Pegg Jr, Ed
Language: 
eng
Description: 
  • none
  • For n points in a square of side length one, find the three points that make the triangle with minimal area. Finding the placement of n points that produces the largest such triangle is known as the Heilbronn triangle problem. The point placements within this Demonstration are the best known. Minimal triangles are colored red. All solutions above 12 points are due to Mark Beyleveld and David Cantrell, with optimization and exact solutions found by Mathematica
  • Componente Curricular::Ensino Fundamental::Séries Finais::Matemática
Issue Date: 
  • 2008
  • 11-Sep-2008
  • 11-Sep-2008
  • 11-Sep-2008
  • 10-Sep-2008
Keywords: 
  • Computational Geometry
  • Foundations of Mathematics
  • Triangles
  • Educação Básica::Ensino Fundamental Final::Matemática::Espaço e forma
Notes: 
Show the Heilbronn Triangles in the Unit Square
Credits: 
This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
Source: 
http://objetoseducacionais2.mec.gov.br/handle/mec/5223
URI: 
http://acervodigital.unesp.br/handle/unesp/360735
Rights: 
Demonstration freeware using Mathematica Player
Type: 
outro
Appears in Collections:MEC - Objetos Educacionais (BIOE) - OE

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.