Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Tessellation of Quadratic Elements

  • Conference paper
Algorithms and Computation (ISAAC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4288))

Included in the following conference series:

Abstract

Topology-based methods have been successfully used for the analysis and visualization of piecewise-linear functions defined on triangle meshes. This paper describes a mechanism for extending these methods to piecewise-quadratic functions defined on triangulations of surfaces. Each triangular patch is tessellated into monotone regions, so that existing algorithms for computing topological representations of piecewise-linear functions may be applied directly to piecewise-quadratic functions. In particular, the tessellation is used for computing the Reeb graph, which provides a succinct representation of level sets of the function.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Reeb, G.: Sur les points singuliers d’une forme de pfaff completement integrable ou d’une fonction numrique. Comptes Rendus Acad. Sciences 222, 847–849 (1946)

    MATH  MathSciNet  Google Scholar 

  2. Worsey, A., Farin, G.: Contouring a bivariate quadratic polynomial over a triangle. Comput. Aided Geom. Des. 7(1-4), 337–351 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  3. Nielson, G., Hamann, B.: The asymptotic decider: resolving the ambiguity in marching cubes. In: Proc. Visualization 1991, pp. 83–91. IEEE Computer Society Press, Los Alamitos (1991)

    Chapter  Google Scholar 

  4. Nielson, G.: On marching cubes. IEEE Trans. Visualization and Comp. Graph. 9(3), 283–297 (2003)

    Article  Google Scholar 

  5. Pascucci, V., Cole-McLaughlin, K.: Efficient computation of the topology of level sets. In: Proc. Visualization 2002, pp. 187–194. IEEE Computer Society Press, Los Alamitos (2002)

    Chapter  Google Scholar 

  6. Carr, H.: Topological Manipulation of Isosurfaces. PhD thesis, University of British Columbia (2004)

    Google Scholar 

  7. Carr, H., Snoeyink, J., Axen, U.: Computing contour trees in all dimensions. Comput. Geom. Theory Appl. 24(2), 75–94 (2003)

    MATH  MathSciNet  Google Scholar 

  8. Cole-McLaughlin, K., Edelsbrunner, H., Harer, J., Natarajan, V., Pascucci, V.: Loops in reeb graphs of 2-manifolds. In: Proc. of the 19th annual symposium on computational geometry, pp. 344–350. ACM Press, New York (2003)

    Google Scholar 

  9. Chiang, Y.J., Lenz, T., Lu, X., Rote, G.: Simple and optimal output-sensitive construction of contour trees using monotone paths. Comput. Geom. Theory Appl. 30(2), 165–195 (2005)

    MATH  MathSciNet  Google Scholar 

  10. Bajaj, C.L., Pascucci, V., Schikore, D.R.: The contour spectrum. In: Proc. Visualization 1997, pp. 167–174. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  11. Takahashi, S., Nielson, G.M., Takeshima, Y., Fujishiro, I.: Topological volume skeletonization using adaptive tetrahedralization. In: Proc. Geometric Modeling and Processing 2004, pp. 227–236. IEEE Computer Society Press, Los Alamitos (2004)

    Chapter  Google Scholar 

  12. Weber, G.H., Scheuermann, G., Hagen, H., Hamann, B.: Exploring scalar fields using critical isovalues. In: Proc. Visualization 2002, pp. 171–178. IEEE Computer Society Press, Los Alamitos (2002)

    Chapter  Google Scholar 

  13. Carr, H., Snoeyink, J., van de Panne, M.: Simplifying flexible isosurfaces using local geometric measures. In: Proc. Visualization 2004, pp. 497–504. IEEE Computer Society Press, Los Alamitos (2004)

    Chapter  Google Scholar 

  14. Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T.L.: Topology matching for fully automatic similarity estimation of 3d shapes. In: Proce. 28th annual conference on computer graphics and interactive techniques, pp. 203–212. ACM Press, New York (2001)

    Chapter  Google Scholar 

  15. Zhang, E., Mischaikow, K., Turk, G.: Feature-based surface parameterization and texture mapping. ACM Trans. Graph. 24(1), 1–27 (2005)

    Article  Google Scholar 

  16. Milnor, J.W.: Morse Theory. Princeton University Press, Princeton, New Jersey (1963)

    MATH  Google Scholar 

  17. Dillard, S.E.: Tessellation of quadratic elements. Technical report, University of California, Davis, Department of Computer Science (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Davis

    Scott E. Dillard, Vijay Natarajan, Gunther H. Weber & Bernd Hamann

  2. Lawrence Livermore National Laboratory,  

    Valerio Pascucci

  3. Institute for Data Analysis and Visualization,  

    Scott E. Dillard, Vijay Natarajan, Gunther H. Weber, Valerio Pascucci & Bernd Hamann

Authors
  1. Scott E. Dillard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vijay Natarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gunther H. Weber
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Valerio Pascucci
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bernd Hamann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Japan Advanced Institute of Science and Technology, Japan

    Tetsuo Asano

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dillard, S.E., Natarajan, V., Weber, G.H., Pascucci, V., Hamann, B. (2006). Tessellation of Quadratic Elements. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_72

Download citation

  • DOI: https://doi.org/10.1007/11940128_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49694-6

  • Online ISBN: 978-3-540-49696-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation