Skip to main content

Mesh Sizing with Additively Weighted Voronoi Diagrams

  • Conference paper
Proceedings of the 16th International Meshing Roundtable

Summary

We address the problem of generating mesh sizing functions from a set of points with specified sizing values. The sizing functions are shown to be maximal and K-Lipschitz, with arbitrary parameter K provided by the user. These properties allow generating low complexity meshes with adjustable gradation.

After constructing an additively weighted Voronoi diagram, our algorithm provides fast and accurate answers to arbitrary point queries. We have implemented our mesh sizing technique as a sizing criterion for the 2D triangle meshing component from the CGAL library. We demonstrate the performance advantages of our technique through experimental results on various inputs.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Nina Amenta and Marshall Bern. Surface reconstruction by voronoi filtering. In SCG ’98: Proceedings of the fourteenth annual symposium on Computational geometry, pages 39–48, New York, NY, USA, 1998. ACM Press.

    Google Scholar 

  2. Pierre Alliez, David Cohen-Steiner, Mariette Yvinec, and Mathieu Desbrun. Variational tetrahedral meshing. ACM Trans. Graph., 24(3):617–625, 2005.

    Article  Google Scholar 

  3. Jean-Daniel Boissonnat and Christophe Delage. Convex hull and voronoi diagram of additively weighted points. Algorithms - ESA 2005, 13th Annual European Symposium, pages 367–378, 2005.

    Google Scholar 

  4. Tom Bobach, Martin Hering-Bertram, and Georg Umlauf. Comparison of Voronoi based scattered data interpolation schemes. In Proceedings of International Conference on Visualization, Imaging and Image Processing, pages 342–349, 2006.

    Google Scholar 

  5. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. On the design of CGAL, a computational geometry algorithms library. Softw.–Pract. Exp., 30(11):1167–1202, 2000.

    Article  MATH  Google Scholar 

  6. Gary L. Miller, Dafna Talmor, and Shang-Hua Teng. Data generation for geometric algorithms on non-uniform distributions. Int. J. Comput. Geometry Appl, 9(6):577–599, 1999.

    Article  MATH  Google Scholar 

  7. Steve Oudot, Laurent Rineau, and Mariette Yvinec. Meshing volumes bounded by smooth surfaces. In Proc. 14th International Meshing Roundtable, pages 203–219, 2005.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Antani, L., Delage, C., Alliez, P. (2008). Mesh Sizing with Additively Weighted Voronoi Diagrams. In: Brewer, M.L., Marcum, D. (eds) Proceedings of the 16th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75103-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75103-8_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75102-1

  • Online ISBN: 978-3-540-75103-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics