Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Parallel HyperFun Polygonizer

  • Conference paper
  • First Online:
Parallel and Distributed Processing and Applications (ISPA 2003)

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

  • 341 Accesses

Abstract

An advanced HyperFun polygonizer which produces high quality visualization from an object represented by the HyperFun geometric modeling language and a parallel HyperFun grid system which distributes the calculations of the HyperFun polygonizer over many computers through a network are presented. We show that distributing the calculation for visualization of HyperFun function represented models via a heterogeneous computer network with our parallel polygonization method can yield HyperFun polygonal models of reduced size in a shorter period of time.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. HyperFun Project: http://www.hyperfun.org

    Google Scholar 

  2. Adzhiev, A., Cartwright, R. Fausett, E., Ossipov, A., Pasko, A., and Savchenko, V., “HyperFun project: Language and Software tools for F-rep Shape Modeling”, Proceedings of Eurographics/ACM SIGGRAPH Workshop Implicit Surfces’ 99, (Bordeaux, France, September 13–15 1999), J. Hughes and C. Schlick (Eds.), pp. 59–69.

    Google Scholar 

  3. Bloomenthal, J., “Polygonization of Implicit Surfaces”, Computer Aided Geometric Design, Vol. 5, 341–355, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  4. Bloomenthal, J., “An Implicit Surface Polygonizer”, Graphics Gems IV, 1994.

    Google Scholar 

  5. Aaron W. F. Lee, Wim Sweldens, Peter Schroder, Lawrence Cowsar, David Dobkin. “MAPS: Multiresolution Adaptive Parameterization of Surfaces”, Computer Graphics Proceedings (SIGGRAPH 98), pp. 95–104, 1998.

    Google Scholar 

  6. Pasko A.A., Pilyugin V.V., Pokrovskiy V.V. “Geometric modeling in the analysis of trivariate functions”, Communications of Joint Institute of Nuclear Research, P10-86-310, Dubna, USSR, 1986 (in Russian).

    Google Scholar 

  7. Pasko A.A., Pilyugin V.V., Pokrovskiy V.V. “Geometric modeling in the analysis of trivariate functions”, Computers and Graphics, vol. 12, Nos. 3/4, 1988, pp. 457–465.

    Article  Google Scholar 

  8. PVM: Parallel Virtual Machine: http://www.epm.ornl.gov/pvm/pvm home.html

    Google Scholar 

  9. M. Hayano, T. Matsuoka, K. Ueda, “Mesh Simplification Using Edge Operation with Feature Detection”, Ricoh Technical Report, 24, pp. 7–76, 1998 (Japanese).

    Google Scholar 

  10. I. S. Sedukhin, S. G. Sedukhin, A. A. Pasko, V. V. Savachenko, N. N. Mirenkov “Parallel Rendering of Functionally Represented Geometric Object with the Network Linda System”, Technical Report 95-1-001, Department of Computer Software, The University of Aizu. 1995.

    Google Scholar 

  11. Sergey Ten, Andrey Savchenko, Alexander Pasko, Vladimir Savachenko “Distributed Animation of Volumetric Objects”, Technical Report 95-1-016, Department of Computer Software, The University of Aizu. 1995.

    Google Scholar 

  12. William E. Lorensen and Harvey E. Cline, “Marching cubes: A high resolution 3D surface construction algorithm”, Computer Graphics, 21(4):163–169, July 1987.

    Article  Google Scholar 

  13. Gregory M. Nielson and Bernd Hamann, “The asymptotic decider: Resolving the ambiguity in the marching cubes”, Proceedings Visualization’ 91 — sponsored by the IEEE Computer Society, pages 83–91, 1991.

    Google Scholar 

  14. Hugues Hoppe “Progresssive Meshes”, SIGGRAPH 96 Proc., pages 99–108, 1996.

    Google Scholar 

  15. Hugues Hoppe, Tony DeRose, Tom Duchamp, John McDonald, and Werner Stuetzel, “Mesh optimization”, SIGGRAPH 93 Proc., pages 19–26, 1993.

    Google Scholar 

  16. Michael Garland and Paul S. Heckbert, “Surface Simplification Using Quadric Error Metrics”, SIGGRAPH 97 Proc., pages 209–216, 1997.

    Google Scholar 

  17. Junji Horikawa and Takashi Totsuka, “A Hierarchical Approximation for 3D Polygon Models”, Proceeding of the 5th Sony Research Forum, pp. 3–7, 1995.

    Google Scholar 

  18. C. R. Callafine, “Gaussian curvature and shell structure”, The Mathematics of Surfaces, Oxford University Press, pp. 179–196,1986.

    Google Scholar 

  19. HyperFun Tutorial (Japanese): http://www.hyperfun.org

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Aizu, Aizu-Wakamatsu City, Fukushima Prefecture, 965-8580, Japan

    Tsuyoshi Yamamoto & Carl Vilbrandt

Authors
  1. Tsuyoshi Yamamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carl Vilbrandt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Software, The University of Aizu, Aizu-Wakamatsu City, Fukushima, 965-8580, Japan

    Minyi Guo

  2. Department of Computer Science, St. Francis Xavier University, Antigonish, NS, B2G 2W5, Canada

    Laurence Tianruo Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamamoto, T., Vilbrandt, C. (2003). Parallel HyperFun Polygonizer. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-37619-4_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40523-8

  • Online ISBN: 978-3-540-37619-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation