Minimal enclosing parallelepiped in 3D - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

Minimal enclosing parallelepiped in 3D

Abstract

We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n three-dimensional points. We give two mathematical properties of these parallelepipeds, from which we derive two algorithms of theoretical complexity O(n^6). Experiments show that in practice our quickest algorithm runs in O(n^2) (at least for $n \leq 10^5$n 10^5). We also present our application in structural biology.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4685.pdf (461.27 Ko) Télécharger le fichier
RR2002-49.pdf (580.34 Ko) Télécharger le fichier

Dates and versions

inria-00071901 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071901 , version 1

Cite

Frédéric Vivien, Nicolas Wicker. Minimal enclosing parallelepiped in 3D. [Research Report] RR-4685, LIP RR-2002-49, INRIA, LIP. 2002. ⟨inria-00071901⟩
102 View
587 Download

Share

Gmail Facebook Twitter LinkedIn More