Abstract
Recently, Guibas et al.[7] studied deformable necklaces - flexible chains of balls, called beads, in which only adjacent balls can intersect. In this paper, we investigate a problem of covering a necklace by cylinders. We consider several problems under different optimization criteria. We show that optimal cylindrical cover of a necklace with n beads in ℝ3 by k cylinders can be computed in polynomial time. We also study a bounding volume hierarchy based on cylinders. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Bespamyatnikh, S. (2003). Cylindrical hierarchy for deforming necklaces. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2697, 20–29. https://doi.org/10.1007/3-540-45071-8_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
