EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 25 / No 3 (1991) RAIRO-Theor. Inf. Appl., 25 3 (1991) 219-246 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 25, Number 3, 1991
Page(s) 219 - 246
DOI https://doi.org/10.1051/ita/1991250302191
Published online 01 February 2017
  1. 1. S. ANSALDI, L. DE FLORIANI et B. FALCIDIENO, Geometric modeling of solid objects by using a face adjacency graph representation, A.C.M., 1985, 19, 3, p. 131-139. [Google Scholar]
  2. 2. D. ARQUES et P. KOCH, Pavages tridimensionnels, BIGRE n° 61-62, avril 1989: Langages et Algorithmes du Graphique, p.5-15. [Google Scholar]
  3. 3. D. ARQUES et P. KOCH, Modélisation de solides par les pavages, Actes de PIXIM 1989, p. 47-61. [Google Scholar]
  4. 4. D. ARQUES, Une relation fonctionnelle nouvelle sur les cartes planaires pointées, J. Combin., Theory Ser. B, 1985, 39, n° 1, p. 27-42. [MR: 805455] [Zbl: 0571.05001] [Google Scholar]
  5. 5. D. ARQUES, Arbres, graphes planaires et synthèse d'images figuratives de végétaux, Cours de D.E.A., Univ. Franche-Comté, 1988. [Google Scholar]
  6. 6. P. BAUMANN, A formal specification of a boundary representation, EUROGRAPHIC'S 88, 1988, p. 141-154. [Google Scholar]
  7. 7. C. BERGE, Graphes et hypergraphes, Dunod Université, 1970, n° 604. [MR: 357173] [Zbl: 0332.05101] [Google Scholar]
  8. 8. M. BERGER, Géométrie. 3/Convexes et polytopes, polyèdres réguliers, aires et volumes, CEDIC, Fernand Nathan, Paris, 1978. [Zbl: 0423.51001] [Google Scholar]
  9. 9. R. CORI, Un code pour les graphes planaires et ses applications, Astérisque, 27, 1975. [MR: 404045] [Zbl: 0313.05115] [Google Scholar]
  10. 10. N. CHIBA, K. ONOGUCHI et T. NISHIZEKI, Drawing plane graphs nicely, Acta Infor., 1985, 22, p. 187-201. [MR: 797265] [Zbl: 0545.68057] [Google Scholar]
  11. 11. D. P. DOBKIN et M. J. LASZLO, Primitives for the manipulation of three-dimensional subdivisions. Algorithmica, 1989, 4, p.3-32. [MR: 983654] [Zbl: 0664.68023] [Google Scholar]
  12. 12. J. R. EDMONDS, A combinatorial representation for polyhedral surfaces, Amer. Math. Soc. Notices, 1960, 7, p. 646-650. [Google Scholar]
  13. 13. I. M. H. ETHERINGTON, Some Problems of Non-associative combinations (I), The Edinburgh Mathematical Notes, 1940, 32, p. 1-13. [MR: 6989] [Zbl: 0060.02505] [Google Scholar]
  14. 14. M. GONDRAN et M. MINOUX, Graphes et algorithmes, Éditions Eyrolles, Chapitre 4, 1985. [MR: 868083] [Zbl: 0497.05023] [Google Scholar]
  15. 15. L. GUIBAS et J. STOLFI, Primitives for the manipulation of general subdivisions and the computation of Voronoï Diagrams, A.C.M. Trans, on Graphics, 1985, 4, 2, p. 74-123. [Zbl: 0586.68059] [Google Scholar]
  16. 16. J. HOPCROFT et R. TARJAN, Efficient Planarity Testing. J. Assoc. Comput. Mach., 1974, 21, 4, p. 549-568. [MR: 359387] [Zbl: 0307.68025] [Google Scholar]
  17. 17. S. G. KETTLE, Families Enumerated by the Schröder-Etherington Sequence and a Renewal Array it Generates, Lecture Notes in Math., 1982, 1036, p. 244-274. [MR: 731586] [Zbl: 0523.05027] [Google Scholar]
  18. 18. P. LIENHARDT, Extension of the notion of map and subdivisions of a three-dimensional space, Lectures Notes in Comput. Sci., Springer-Verlag, 294, Proceedings of STACS, 1988. [MR: 935806] [Zbl: 0654.05026] [Google Scholar]
  19. 19. W. S. MASSEY, Algebraic Topology: An Introduction, Harbrace College Mathematics Series, 1967. [MR: 211390] [Zbl: 0153.24901] [Google Scholar]
  20. 20. W. M. NEWMAN et R. F. SPROULL, 1979. Principles of interactive computer graphics, McGraw-Hill, Computer Science Series, 1979. [Zbl: 0288.68017] [Google Scholar]
  21. 21. A. REQUICHA, Representations for Rigid Solids: Theory, Methods, and Systems. Computing Surveys, 1980, 12, 4, p. 437-464. [Google Scholar]
  22. 22. E. M. REINGOLD et J. S. TILFORD, Tidier Drawings of trees, I.E.E.E. Trans. Software Engrg., 1981, 7, 2, p. 223-228. [Google Scholar]
  23. 23. J. C. SPEHNER, La fusion dans les cartes et dans les pavages, Rapport de Recherche n° 48, Université de Haute Alsace, 1988. [Google Scholar]
  24. 24. W. T. TUTTE, Graph Theory. Ed. Addison-Wesley, Encyclopedia Math. Sci., 21, 1984. [MR: 746795] [Zbl: 0554.05001] [Google Scholar]
  25. 25. X. VIENNOT, G. EYROLLES, N. JANEY et D. ARQUES, Combinatorial Analysis of Ramified Patterns and Computer Imagery of Trees, A.C.M. Comput. Graphics, 1989, 23, 3, p. 31-40. [Google Scholar]
  26. 26. K. WEILER, Edge-based data structures for solid modeling in curved-surface environments, I.E.E.E. CG & A, 1985 , p. 21-40. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.