On piercing (pseudo)lines and boxes
Data(s) |
2012
|
---|---|
Resumo |
We say a family of geometric objects C has (l;k)-property if every subfamily C0C of cardinality at most lisk- piercable. In this paper we investigate the existence of g(k;d)such that if any family of objects C in Rd has the (g(k;d);k)-property, then C is k-piercable. Danzer and Gr̈ unbaum showed that g(k;d)is infinite for fami-lies of boxes and translates of centrally symmetric convex hexagons. In this paper we show that any family of pseudo-lines(lines) with (k2+k+ 1;k)-property is k-piercable and extend this result to certain families of objects with discrete intersections. This is the first positive result for arbitrary k for a general family of objects. We also pose a relaxed ver-sion of the above question and show that any family of boxes in Rd with (k2d;k)-property is 2dk- piercable. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/47724/1/Cana_Conf_Comp_Geom_1_2012.pdf Bharadwaj, Subramanya BV and Rao, Chintan H and Ashok, Pradeesha and Govindarajan, Sathish (2012) On piercing (pseudo)lines and boxes. In: 24th Canadian Conference on Computational Geometry, August 8-10, 2012, Charlottetown, Prince Edward Island, Canada. |
Publicador |
Pacific Institute for the Mathematical Sciences |
Relação |
http://www.pims.math.ca/scientific-event/120808-2cccg http://eprints.iisc.ernet.in/47724/ |
Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
Tipo |
Conference Paper PeerReviewed |