Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2003: Computing and Combinatorics pp 20–29Cite as

Cylindrical Hierarchy for Deforming Necklaces

  • Conference paper
  • First Online:

  • 874 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2697))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. K. Agarwal, B. Aronov, and M. Sharir. Line traversals of balls and smallest enclosing cylinders in three dimensions. Discrete Comput. Geom., 21:373–388, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. K. Agarwal and C. M. Procopiuc. Approximation algorithms for projective clustering. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pp. 538–547, 2000.

    Google Scholar 

  3. T. Chan. Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pp. 300–309, 2000.

    Google Scholar 

  4. S. De and K. J. Bathe. The method of finite spheres. Computational Mechanics, 25:329–345, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  5. L. Guibas, F. Xie, and L. Zhang. Kinetic data structures for efficient simulation. In Proc. IEEE Intern. Conf. on Robotics and Automation, 3:2903–2910, 2001.

    Google Scholar 

  6. L. J. Guibas. Kinetic data structures — a state of the art report. In P. K. Agarwal, L. E. Kavraki, and M. Mason, editors, Proc. Workshop Algorithmic Found. Robot., pp. 191–209. A. K. Peters, Wellesley, MA, 1998.

    Google Scholar 

  7. L. J. Guibas, A. Nguyen, D. Russel, and L. Zhang. Collision detection for deforming necklaces. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 33–42, 2002.

    Google Scholar 

  8. D. Halperin and M. Overmars. Spheres, molecules, and hidden surface removal. Comput. Geom. Theory Appl., 11(2):83–102, 1998.

    MATH  MathSciNet  Google Scholar 

  9. S. Har-Peled and K. Varadarajan. Projective clustering in high dimensions using core-sets. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 312–318.

    Google Scholar 

  10. V. Koltun and M. Sharir. The partition technique for overlays of envelopes. In Proc. 43nd Annu. IEEE Sympos. Found. Comput. Sci., pp. 637–646.

    Google Scholar 

  11. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. ACM, 30(4):852–865, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  12. S. Quinlan. Efficient distance computation between non-convex objects. pp. 3324–3329, 1994.

    Google Scholar 

  13. J. Sadoc and N. Rivier. Boerdijk-coxeter helix and biological helices. The European Physical Journal B, 12(2):309–318, 1999.

    Article  MathSciNet  Google Scholar 

  14. E. Schömer, J. Sellen, M. Teichmann, and C. K. Yap. Smallest enclosing cylinders. Algorithmica, 27(2):170–186, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  15. B. Zhu. Approximating 3D points with cylindrical segments. In Proc. 8th Ann. Internat. Conf. Computing and Combinatorics, pp. 420–429, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, Box 830688, Richardson, TX, 75083, USA

    Sergei Bespamyatnikh

Authors
  1. Sergei Bespamyatnikh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Austin, One University Station, C0500, Austin, TX, 78712, USA

    Tandy Warnow

  2. Department of Computer Science, Montana State University, EPS 357, Bozeman, MT, 59717, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bespamyatnikh, S. (2003). Cylindrical Hierarchy for Deforming Necklaces. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45071-8_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40534-4

  • Online ISBN: 978-3-540-45071-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation