Abstract
We discuss an optimisation procedure for triangulated polyhedral surfaces (referred to as (2-3)D triangulations) which allows us to process self–intersecting surfaces. As an optimality criterion we use minimisation of total absolute extrinsic curvature (MTAEC) and as a local transformation – a diagonal flip, defined in a proper way for (2-3)D triangulations. This diagonal flip is a natural generalisation of the diagonal flip operation in 2D, known as Lawson’s procedure. The difference is that the diagonal flip operation in (2-3)D triangulations may produce self-intersections. We analyze the optimisation procedure for (2-3)D closed triangulations, taking into account possible self–intersections. This analysis provides a general insight on the structure of triangulations, allows to characterise the types of self–intersections, as well as the conditions for global convergence of the algorithm. It provides also a new view on the concept of optimisation on the whole and is useful in the analysis of global and local convergence for other optimisation algorithms. At the end we present an efficient implementation of the optimality procedure for (2-3)D triangulations of the data, situated in the convex position, and conjecture possible results of this procedure for non–convex data.
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
Aichholzer, O., Hurtado, F., Alboul, L.: On flips in polyhedral surfaces. Int. J. of Found. of Comp. Sc. 13(2), 303–311 (2002)
Alboul, L., van Damme, R.: Polyhedral metrics in surface reconstruction. In: Mullineux, G. (ed.) The Mathematics of Surfaces VI, pp. 171–200. Clarendon Press, Oxford (1996)
Alboul, L., van Damme, R.: Polyhedral metrics in surface reconstruction: Tight triangulations. In: Goodman, T. (ed.) The Mathematics of Surfaces VII, pp. 309–336. Clarendon Press, Oxford (1997)
Alboul, L., Kloosterman, G., Traas, C.R., van Damme, R.: Best datadependent triangulations. J. of Comp. and Applied Math. 119, 1–12 (2000)
Alboul, L., van Damme, R.: On flips in polyhedral surfaces: a new development. In: Proc. of EWCG 2002, Warsaw, April 10-12, pp. 80–84 (2002)
Alliez, P., Meyer, M., Desbrun, M.: Interactive geometry remeshing. ACM Transactions on Graphics (TOG) 21(3), 347–354 (2002)
Bischoff, S., Kobbelt, L.: Towards robust broadcasting of geometry data. To appear in Computers and Graphics (2001)
Brehm, U., Kühnel, W.: Smooth approximation of polyhedral surfaces with respect to curvature measures. In: Global differential geometry, pp. 64–68 (1979)
Choi, B.K., Shin, H.Y., Yoon, Y.I., Lee, J.W.: Triangulations of Scattered Data in 3D Space. Comp. Aided Design 20(5), 239–248 (1988)
Desbrun, M., Meyer, M., Schröder, P., Barr, A.H.: Discrete Differential-Geometry Operators for Triangulated 2-Manifolds. In: Proc. of the Int. Workshop on Visualization and Mathematics (VisMath 2002), Berlin, p. 27 (2002)
do Carmo, M.P.: Differential geometry of curves and surfaces. Prentice-Hall, Englewood Cliffs (1976)
Dyn, N., Goren, I., Rippa, A.: Transforming Triangulations in Polygonal Domains. Computer Aided Geometric Design 10, 531–536 (1993)
Dyn, N., Hormann, K., Kim, S.-J., Levin, D.: Optimising 3D triangulations using discrete curvature analysis. In: Lyche, T., Schumaker, L.L. (eds.) Mathematical Methods in CAGD, pp. 1–12. Vanderbilt University Press, Nashville (2001)
Falcidieno, B., Spagnuolo, M.: A new method for the characterization of topographic surfaces. Int. J. Geographical information systems 5(4), 397–412 (1991)
Francis, G.K.: A Topological Picturebook. Springer, Heidelberg (1987)
Ignatiev, Y., Matveev, I., Mikushin, V.: Generating consistent triangulation for b-rep models with parametric face representation in 3D–Vision system. Grid Generation: Theory and Applications, RAS, 241–266 (2002), ISBN 5-201-09784-7, 3D–Vision system, industrial software Internet: http://www.ccas.ru/gridgen/ggta02/papers/Matveev.pdf
Kobbelt, L.: Fairing by finite difference methods. In: Daehlen, M., Lyche, T., Schumaker, L.L. (eds.) Mathematical Methods for Curves and Surfaces II, pp. 279–286. Vanderbilt University Press, Nashville (1998)
Krsek, P., Lucács, G., Martin, R.R.: Algorithms for computing curvatures from range data. In: Cripps, R. (ed.) The Mathematics of Surfaces VIII 1998, pp. 1–16 (1998)
Kühnel, W.: Tight Polyhedral Submanifolds and Tight Triangulations. Lecture Notes in Mathematics, vol. 1612. Springer, Heidelberg (1995)
Lawson, C.: Transforming triangulations. Discrete mathematics 3, 365–372 (1972)
Ma, L., Wang, Q., Kai Yun, T.C.: Recursive Algorithms for 3D Triangulation Decomposition and 2D Parameterization. In: 5th International Conference on Computer Integrated Manufacturing (ICCIM), Singapore, March 28-30, p. 12 (2000)
Maltret, J.-L., Daniel, M.: Discrete curvatures and applications: a survey, http://creatis-www.insa-lyon.fr/~frog/curvature
Morris, D.D., Kanade, T.: Image-Consistent Surface Triangualtion. In: Proc. 19th Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 332–338. IEEE, Los Alamitos (2000)
Negami, S.: Diagonal flips of triangulations on surfaces. Yokohama Math. J. 47, 1–40 (1999)
Rocchini, C., Cignoni, P., Montani, C., Pingi, P., Scopigno, R.: A low cost 3D scanner based on structured light. In: EUROGRAPHICS 2001, vol. 20(3), pp. 298–307 (2001)
van Damme, R., Alboul, L.: Tight triangulations. In: Daehlen, M., et al. (eds.) Mathematical methods in CAGD III, pp. 517–526 (1995)
Wagner, K.: Bemekungen zum Vierfarbenproblem. J. der Deut. Math. 46(1), 26–32 (1936)
Weinert, K., Mehnen, J., Albersmann, F., Drerup, P.: New solutions for surface reconstruction from discrete point data by means of computational intelligence. In: Int’l seminar on intelligent computation in manufacturing engineering (ICME 1998), pp. 431–438 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alboul, L. (2003). Optimising Triangulated Polyhedral Surfaces with Self–intersections. In: Wilson, M.J., Martin, R.R. (eds) Mathematics of Surfaces. Lecture Notes in Computer Science, vol 2768. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39422-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-39422-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20053-6
Online ISBN: 978-3-540-39422-8
eBook Packages: Springer Book Archive