Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Empty monochromatic simplices

Autor
Aichholzer, O.; Fabila, R.; Hackl, T.; Huemer, C.; URRUTIA, J.
Tipus d'activitat
Article en revista
Revista
Discrete and computational geometry
Data de publicació
2014-03-01
Volum
51
Número
2
Pàgina inicial
362
Pàgina final
393
DOI
https://doi.org/10.1007/s00454-013-9565-2 Obrir en finestra nova
Projecte finançador
Geometría Discreta: Problemas de Combinatoria y Computación
PROBLEMAS DE COMBINATORIA Y DE COMPUTACION
Puntos y grafos: puentes geométricos (IP04 en CRP Comb. of points sets, ComPoSe,EuroGIGA ESF)
Repositori
http://hdl.handle.net/2117/26662 Obrir en finestra nova
Resum
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...
Citació
Aichholzer, O. [et al.]. Empty monochromatic simplices. "Discrete and computational geometry", 01 Març 2014, vol. 51, núm. 2, p. 362-393.
Paraules clau
Colored point sets, Convex polygons, Empty monochromatic simplices, High dimensional triangulations, Point sets, Simplicial complex, Triangles
Grup de recerca
DCG - Discrete and Combinatorial Geometry

Participants

  • Aichholzer, Oswin  (autor)
  • Fabila Monroy, Ruy  (autor)
  • Hackl, Thomas  (autor)
  • Huemer, Clemens  (autor)
  • Urrutia Galicia, Jorge  (autor)

Arxius