Computer Science

Computing Methodologies

68Uxx

1. David C. Banks and Stephen Linton, Counting cases in marching cubes: toward a generic algorithm for producing substitopes, in VIS '03: Proceedings of the 14th IEEE Visualization 2003 (VIS'03), IEEE Computer Society, Washington, DC, USA, 2003, pp. 8.^[doi]
2. Mireille Boutin and Gregor Kemper, Which point configurations are determined by the distribution of their pairwise distances?, Internat. J. Comput. Geom. Appl. 17 (2007), no. 1, 31–43.^[MR]
3. Xin Li, Marc Moreno Maza, and Éric Schost, On the virtues of generic programming for symbolic computation, Computational Science - ICCS 2007, Lecture Notes in Computer Science, vol. 4488/2007, Springer Berlin / Heidelberg, 2007, pp. 379–596.
4. S. Petitjean, Algebraic geometry and computer vision: Polynomial systems, real and complex roots, J. Math. Imaging Vision 10 (1999), no. 3, 191–220.^[MR]