Lower and upper bounds on the number of empty cylinders and ellipsoids - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Lower and upper bounds on the number of empty cylinders and ellipsoids

Résumé

Given a set S of n points in three dimensions, we study the maximum numbers of quadrics spanned by subsets of points in S in several ways. Among various results we prove that the number of empty circular cylinders is between Omega(n3) and O(n4) while we have a tight bound Theta(n4) for empty ellipsoids. We also take interest in pairs of empty homothetic ellipsoids, with application to the number of combinatorially distinct Delaunay triangulations obtained by orthogonal projections of S on a two-dimensional plane, which is Omega(n4) and O(n5). A side result is that the convex hull in d dimensions of a set of n points, where one half lies in a subspace of odd dimension delta > d/2, and the second half is the (multi-dimensional) projection of the first half on another subspace of dimension delta, has complexity only O(n^(d/2-1)).
Fichier principal
Vignette du fichier
eurocg.pdf (150.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00412352 , version 1 (01-09-2009)

Identifiants

  • HAL Id : inria-00412352 , version 1

Citer

Oswin Aichholzer, Franz Aurenhammer, Olivier Devillers, Thomas Hackl, Monique Teillaud, et al.. Lower and upper bounds on the number of empty cylinders and ellipsoids. European Workshop on Computational Geometry, Mar 2009, Bruxelles, Belgium. pp.139-142. ⟨inria-00412352⟩
130 Consultations
89 Téléchargements

Partager

Gmail Facebook X LinkedIn More