Gift-wrapping based preimage computation algorithm

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

Volumn 4992 LNCS, Issue , 2008, Pages 310-321

  Gerard, Yan ^a   Feschet, Fabien ^a   Coeurjolly, David ^b  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; DOMAIN DECOMPOSITION METHODS; PROBLEM SOLVING;

CONVEX HULLS; SUBSETS; VERTICES;

ROUGH SET THEORY;

EID: 43049138034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79126-3_28     Document Type: Conference Paper

References (16)

1. Rosenfeld, A., Klette, R.: Digital straightness. In: Int. Workshop on Combinatorial Image Analysis. Electronic Notes in Theoretical Computer Science, vol. 46, Elsevier Science Publishers, Amsterdam (2001)
2. Dorst, L., Smeulders, A.N.M.: Discrete representation of straight lines. IEEE Trans. on Pattern Analysis and Machine Intelligence 6, 450-463 (1984)
3. Mcllroy, M.D.: A note on discrete representation of lines. AT&T Technical Journal 64(2), 481-490 (1985)
4. Lindenbaum, M., Bruckstein, A.: On recursive, O(n) partitioning of a digitized curve into digital straigth segments. IEEE Trans. on Pattern Analysis and Machine Intelligence 15(9), 949-953 (1993)
5. Brimkov, V., Coeurjolly, D., Klette, R.: Digital planarity - a review. Discrete Applied Mathematics (2006)
6. Veelaert, P.: Geometric constructions in the digital plane. Journal of Mathematical Imaging and Vision 11, 99-118 (1999)
7. Vittone, J., Chassery, J.M.: Recognition of digital naive planes and polyhedization. In: Nyström, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol. 1953, pp. 296-307. Springer, Heidelberg (2000)
8. Dexet, M., Andres, E.: A generalized preimage for the standard and supercover digital hyperplane recognition. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 639-650. Springer, Heidelberg (2006)
9. Coeurjolly, D., Sivignon, I., Dupont, F., Feschet, F., Chassery, J.M.: On digital plane preimage structure. Discrete Applied Mathematics 151(1-3), 78-92 (2005)
10. Coeurjolly, D., Brimkov, V.: Computational aspects of digital plane and hyperplane recognition. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds.) IWClA 2006. LNCS, vol. 4040, Springer, Heidelberg (2006)
11. Gérard, Y., Debled-Rennesson, I., Zimmermann, P.: An elementary digital plane recognition algorithm. Discrete Applied Mathematics 151, 169-183 (2005)
12. Reveillès, J.P.: Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse d'etat, Université Louis Pasteur, Strasbourg, France (1991)
13. Preparata, F.P., Sharnos, M.I.: Computational Geometry : An Introduction. Springer, Heidelberg (1985)
14. de Berg, M., Schwarzkopf, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)
15. Sivignon, I.: De la caractérisation des primitives à reconstruction polyhèdrique de surfaces en géométrie discrète. PhD thesis, Laboratoire des Images et des Signaux, INPG, Grenoble (2004)
16. Avis, D.: 1rs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm (1999), http://cgm.cs.mcgill.ca/~ayis/C/lrs.html