Talk:Minimum bounding box algorithms

1983 Linear Time Paper

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? —Preceding unsigned comment added by [[User:{{{1}}}|{{{1}}}]] ([[User talk:{{{1}}}|talk]] • [[Special:Contributions/{{{1}}}|contribs]])

• 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)

1999 Paper

There is this paper which might be useful as a reference: "A minimum bounding box algorithm and its application to rapid prototyping", C K Chan and S T Tan, The University of Hong Kong, 1999. http://utw10945.utweb.utexas.edu/Manuscripts/1999/1999-019-Chan.pdf. It doesn't require a three-dimensional convex hull, only 2D ones from projections of the 3D model. Mjmouse (talk) 23:30, 8 August 2023 (UTC)

No scientific interest. Also Wikipedia does not like to use primary sources as references. - Altenmann >talk 00:11, 9 August 2023 (UTC)