Jump to content

Talk:Minimum bounding box algorithms

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Zargulon (talk | contribs) at 21:16, 9 August 2009. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Why does nobody refer to the following publication: "A Linear Time Algorithm for the Minimum Area Rectangle Enclosing a Convex Polygon", by Arnon, Dennis S. and Gieselmann, John P., Tech. Report from Purdue University, 1983. Is it flawed in any way? Unable to detect username

  • Because it looks like Freeman and Shapira had already solved this problem in 1975..? Their algorithm has complexity n ln n as I recall, which it is acceptable to refer to as 'Linear Time'. Please sign your edits with four tildes.. Zargulon (talk) 21:16, 9 August 2009 (UTC)[reply]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Minimum_bounding_box_algorithms&oldid=307042058"