Optimising triangulated polyhedral surfaces with self-intersections

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2768, Issue , 2003, Pages 48-72

  Alboul, Lyuba ^a  

^a SHEFFIELD HALLAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; SURVEYING;

EFFICIENT IMPLEMENTATION; EXTRINSIC CURVATURES; GLOBAL CONVER-GENCE; INTERSECTING SURFACES; LOCAL TRANSFORMATIONS; OPTIMALITY CRITERIA; OPTIMISATION PROCEDURES; SELF-INTERSECTIONS;

TRIANGULATION;

EID: 33646158142     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39422-8_5     Document Type: Article

References (28)

1. Aichholzer, O., Hurtado, F., and Alboul, L.: On flips in polyhedral surfaces. Int. J. of Found. of Comp. Sc., 13(2), 2002, pp. 303-311.
2. Alboul, L., and van Damme, R.: Polyhedral metrics in surface reconstruction. In: Mullineux, G. (ed.), The Mathematics of Surfaces VI, Clarendon Press, Oxford, 1996, pp. 171-200.
3. Alboul L., and van Damme, R.: Polyhedral metrics in surface reconstruction: Tight triangulations. In: Goodman, T. (ed.), The Mathematics of Surfaces VII, Clarendon Press, Oxford, 1997, pp. 309-336.
4. Alboul, L., Kloosterman, G., Traas, C. R., and van Damme R.,: Best data-dependent triangulations. J. of Comp. and Applied Math., 119, 2000, pp. 1-12.
5. Alboul, L., and van Damme, R.: On flips in polyhedral surfaces: a new development. In Proc. of EWCG 2002, April 10-12, 2002, Warsaw, pp. 80-84.
6. Alliez, P., Meyer, M., and Desbrun, M.: Interactive geometry remeshing. ACM Transactions on Graphics (TOG), 21(3), 2002, pp. 347-354.
7. Bischoff, S., and Kobbelt, L.: Towards robust broadcasting of geometry data. 2001. To appear in Computers and Graphics.
8. Brehm, U., and Kühnel, W.: Smooth approximation of polyhedral surfaces with respect to curvature measures. In: Global differential geometry, 1979, pp. 64-68.
9. Choi, B. K., Shin, H. Y., Yoon, Y. I., and Lee, J. W.: Triangulations of Scattered Data in 3D Space. Comp. Aided Design, 20(5), 1988, pp. 239-248.
10. Desbrun, M., Meyer, M., Schröder, P., and Barr, A. H.: Discrete Differential-Geometry Operators for Triangulated 2-Manifolds. Proc. of the Int. Workshop on Visualization and Mathematics (VisMath'02), 2002, Berlin, 27 pp.
11. do Carmo, M. P.: Differential geometry of curves and surfaces. Prentice-Hall, 1976.
12. Dyn, N., Goren, I., and Rippa, A.: Transforming Triangulations in Polygonal Domains. Computer Aided Geometric Design, 10, 1993, pp. 531-536.
13. Dyn N., Hormann, K., Kim S.-J., and Levin, D.: Optimising 3D triangulations using discrete curvature analysis. In: Lyche, T., and Schumaker (eds.), Mathematical Methods in CAGD, Vanderbilt University Press, 2001, pp. 1-12.
14. Falcidieno, B., and Spagnuolo, M.: A new method for the characterization of topographic surfaces. Int. J. Geographical information systems, 5(4), 1991, pp. 397-412.
15. Francis, G. K.: A Topological Picturebook. Springer-Verlag, Berlin Heidelberg New York, 1987.
16. Ignatiev, Y., Matveev, I., and Mikushin, V.: Generating consistent triangulation for b-rep models with parametric face representation in 3D-Vision system, Grid Generation: Theory and Applications, RAS, 2002, p. 241-266. ISBN 5-201-09784-7. 3D-Vision system, industrial software. (Internet: http://www.ccas.ru/gridgen/ggta02/papers/Matveev.pdf)
17. Kobbelt, L.: Fairing by finite difference methods. In: Mathematical Methods for Curves and Surfaces II, M. Daehlen, T. Lyche, and L. L. Schumaker (eds.), Vanderbilt University Press, 1998, pp. 279-286.
18. Krsek, P., Lucács, G., and Martin, R. R.,: Algorithms for computing curvatures from range data. In: R. Cripps (ed.), The Mathematics of Surfaces VIII 1998, pp. 1-16.
19. Kühnel, W.: Tight Polyhedral Submanifolds and Tight Triangulations. Lecture Notes in Mathematics, Vol. 1612. Springer-Verlag, Berlin Heidelberg New York, 1995.
20. Lawson, C., Transforming triangulations. Discrete mathematics, 3, 1972, pp. 365-372.
21. Ma, L., Wang, Q., and Kai Yun, T.C.: Recursive Algorithms for 3D Triangulation Decomposition and 2D Parameterization. 5th International Conference on Computer Integrated Manufacturing (ICCIM) 2000, Singapore, 28-30 March 2000, 12 pp.
22. ∼frog/curvature
23. Morris, D. D., and Kanade, T.: Image-Consistent Surface Triangualtion. Proc. 19th Conf. Computer Vision and Pattern Recognition, IEEE, 1, 2000, pp. 332-338.
24. Negami, S.: Diagonal flips of triangulations on surfaces. Yokohama Math. J., 47, 1999, pp. 1-40.
25. Rocchini, C., Cignoni, P., Montani, C., Pingi, P., and Scopigno, R.: A low cost 3D scanner based on structured light. EUROGRAPHICS 2001, 20 (3), 2001, pp. 298-307.
26. van Damme, R., and Alboul, L.: Tight triangulations. In: Daehlen M. et al (eds.), Mathematical methods in CAGD III, 1995, pp.517-526.
27. Wagner, K.: Bemekungen zum Vierfarbenproblem. J. der Deut. Math., 46 (1), 1936, pp. 26-32.
28. Weinert, K., Mehnen, J., Albersmann, F., and 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 '98), pp. 431-438.