Skip to main content
SpringerLink
Log in

A comparison of algorithms for vertex normal computation

  • original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

We investigate current vertex normal computation algorithms and evaluate their effectiveness at approximating analytically computable (and thus comparable) normals for a variety of classes of model. We find that the most accurate algorithm depends on the class and that for some classes, none of the available algorithms is particularly good. We also compare the relative speeds of all algorithms.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Desbrun M, Meyer M, Schröder P, Barr A (1999) Implicit fairing of irregular meshes using diffusion and curvature flow. Proceedings of SIGGRAPH 99, pp 317–324

  2. Ebert D et al. (1998) Texturing and modeling: a procedural approach, (2nd edn). Academic Press, San Diego, CA

    Google Scholar 

  3. Gouraud H (1971) Continuous shading of curved surfaces. IEEE Trans Comput C-20(6):623–629

  4. Max N (1999) Weights for computing vertex normals from facet normals. J Graph Tools 4(2):1–6

    Article  Google Scholar 

  5. Meyer M (2004) Discrete differential operators for computer graphics. Dissertation, California Institute of Technology

  6. Lorenson W, Cline H (1987) Marching cubes: a high resolution 3D surface construction algorithm. Comput Graph 21(4):163–169

    Article  Google Scholar 

  7. Overveld C, Wyvill B (1997) Phong normal interpolation revisited. ACM Trans Graph 16(4):379–419

    Google Scholar 

  8. Phillips M (2000) Geomview Manual. The Geometry Center, http://www.geomview.org

  9. Thurmer G, Wuthrich C (1998) Computing vertex normals from polygonal facets. J Graph Tools 3(1):43–46

    Article  Google Scholar 

  10. Treece GM, Prager RW, Gee AH (1998) Regularised marching tetrahedra: improved iso-surface extraction. Comput Graph 23(4):583–598

    Article  Google Scholar 

  11. Wyvill G, McPheeters C, Wyvill B (1986) Data structure for soft objects. Vis Comput 2(4):227–234

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, Washington State University, 2710 University Drive, Richland, WA, 99354, USA

    Shuangshuang Jin, Robert R. Lewis & David West

Authors
  1. Shuangshuang Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert R. Lewis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David West
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert R. Lewis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jin, S., Lewis, R. & West, D. A comparison of algorithms for vertex normal computation. Vis Comput 21, 71–82 (2005). https://doi.org/10.1007/s00371-004-0271-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-004-0271-1

Keywords

Search

Navigation