Summary
Curves on surfaces can be very useful to visualize surface features at low graphical and memory cost. Curves on surfaces are also used for surface segmentation with possible applications to visualization, reconstruction and parameterization of complex surfaces. In this paper a simple and efficient algorithm for building smooth polylines on triangulated 2D-manifold polygonal meshes is introduced. The algorithm combines geometrical optimization with topological modifications in order to iteratively smooth an initial crude polyline. One key feature of this algorithm is that it relies solely on the geometry of the surface and the polyline. Another key feature is that during the smoothing the polylines always stay on the surface. Different smoothing criteria are proposed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Axo, A., And Lillivian, J. Data structures and algorithms. Addison-Wesley, 1979.
Aleksandrov, A. D., And Zalgaller, V. A. Intrinsic geometry of surfaces. Translation of Mathematical Monographs 15 (1967).
Cormen, T., Leiserson, C., And Rivest, R. Introduction to Algorithms. MIT Press, 1990.
Dijkstra, E. A note on two problems in connection with graphs. Numer. Math 1 (1959), 269–271.
Eck, M., Derose, T., Duchamp, T., Hoppe, H., Lounsbery, T., And Stuetzle, W. Multiresolution analysis of arbitrary meshes. In Proceedings of Siggraph 1995 (1995), Computer Graphics Proceedings, Annual Conference Series, ACM, ACM Press/ACM Siggraph, pp. 173–182.
Floater, M. Parameterization and smooth approximation of surface triangulations. CAGD 14 (1997), 231–250.
Kimmel, R., AND Seithan, J. Fast marching method on triangulated domains. Proceedings of the National Academy of Science 95 (1998).
Krishnamurthy, V. Fitting Smooth Surfaces to Dense Polygon Meshes. PhD thesis, Stanford University, 2000.
Krishnamurthy, V., AND Levoy, M. Fitting smooth surfaces to dense polygon meshes. In Proceedings of SIGGRAPH 1996 (1996), Computer Graphics Proceedings, Annual Conference Series, ACM, ACM Press/ACM Siggraph, pp. 312–324.
MA, K.-L., AND Interrante, V. Extracting feature lines from 3d unstructured grids. In Proceedings of Visualization 1997 (1997), IEEE, pp. 285–292.
Mitchell, J., And Mount, D. The discrete geodesic problem. SIAM J. Copmput. 16 (1987), 647–668.
Pham-Tronc, V. Détermination géométrique de chemins géodésiques sur des surfaces de subdivision. PhD thesis, Université Joseph Fourier, Grenoble, 2001.
Polthiea, K., And Schmies, M. Straightest geodesics on polyhedral surfaces. In Mathematical Visualization, 1998. In H.C. Hege, K. Posthiers (eds.), Springer, 1998.
Praun, E., Sweldens, W., And Schröder, P. Consistent mesh parameterizations. Computer Graphics Proceedings (SIGGRAPH 01) (2001), 179–184.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonneau, GP., Hahmann, S. (2004). Smooth Polylines on Polygon Meshes. In: Brunnett, G., Hamann, B., Müller, H., Linsen, L. (eds) Geometric Modeling for Scientific Visualization. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07443-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-07443-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07263-5
Online ISBN: 978-3-662-07443-5
eBook Packages: Springer Book Archive