Empty monochromatic simplices
Visualitza/Obre
Cita com:
hdl:2117/26662
Tipus de documentArticle
Data publicació2014-03-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Let S be a k-colored (finite) set of n points in , da parts per thousand yen3, in general position, that is, no (d+1) points of S lie in a common (d-1)-dimensional hyperplane. We count the number of empty monochromatic d-simplices determined by S, that is, simplices which have only points from one color class of S as vertices and no points of S in their interior. For 3a parts per thousand currency signka parts per thousand currency signd we provide a lower bound of and strengthen this to Omega(n (d-2/3)) for k=2.; On the way we provide various results on triangulations of point sets in . In particular, for any constant dimension da parts per thousand yen3, we prove that every set of n points (n sufficiently large), in general position in , admits a triangulation with at least dn+Omega(logn) simplices.
CitacióAichholzer, O. [et al.]. Empty monochromatic simplices. "Discrete and computational geometry", 01 Març 2014, vol. 51, núm. 2, p. 362-393.
ISSN0179-5376
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
afhhu-ems-13.pdf | 457,9Kb | Visualitza/Obre |