The Visual Computer

, Volume 10, Issue 8, pp 425–431 | Cite as


  • Godfried T. Toussaint


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Akl SG, Toussaint GT (1978) An improved algorithm to check for polygon similarity. Inf Process Lett 7:127–128Google Scholar
  2. Asberg B, Blanco G, Bose P, Garcia-Lopez J, Overmars M, Toussaint GT, Wilfong G, Zhu B (1993) Feasibility of design in stereolithography. In: Procedings of the 13th Conference on the Foundations of Software Technology and Theoretical Computer Science, Bombay. December 15–17, 1993 (LNCS, vol 761). Springer-Verlag, Berlin Heidelberg New York, pp 228–237Google Scholar
  3. Avis D (1993) Them-core properly contains them-divisible points in space. Patt Recogn Lett 14:702–705Google Scholar
  4. Avis D, Toussaint GT (1981 a) An efficient algorithm for decomposing a polygon into star-shaped pieces. Pattern Recogn 13:295–298Google Scholar
  5. Avis A, Toussaint GT (1981 b) An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Trans Comput C-30:910–914Google Scholar
  6. Bhattacharya BK, Toussaint GT (1988) Computing minimal sets of external visibility. Technical report CCS/LCCR TR 88-29, Simon Fraser University, Bornaby, B.C., CanadaGoogle Scholar
  7. Bhattacharya BK, Kirkpatrick D, Toussaint GT (1989) Determining sector visibility of a polygon. In: Proceedings of the Fifth Annual ACM Symposium on Computational Geometry, June 5–7, 1989, Saarbrucken, Germany. ACM Press, New York, pp 247–253Google Scholar
  8. Bose P, Toussaint GT (1993) Geometric and computational aspects of injection molding. In: Proceedings of the Third International Conference on CAD and Computer Graphics, August 23–26, 1993, Beijing, China, International Academic Publishers, Beijing, pp 237–242Google Scholar
  9. Bose P, Kreveld M van, Toussaint GT (1993) Filling polyhedral molds. Proceedings of the Third Workshop on Algorithms and Data Structures, August 11–13, 1993, Montreal, Canada. Springer-Verlag, Berlin, pp 210–221Google Scholar
  10. Cahn R, Poulsen R, Toussaint GT (1977) Segmentation of cervical cell images. J Histochem Cytochem 25:681–688Google Scholar
  11. Capoyleas V (1993) Clamping of polygonal objects. Patt Recogn Lett 14Google Scholar
  12. Dean JA, Lingas A, Sack JR (1988) Recognizing polygons, or how to spy. Vis Comput 3:344–355Google Scholar
  13. Eades P (1988) Symmetry finding algorithms. In: Toussaint GT (ed) Computational morphology. North-Holland, Amsterdam, pp 41–51Google Scholar
  14. ElGindy H, Toussaint GT (1989) On geodesic properties of polygons relevant to linear time triangulation. Vis Comput 5:68–74Google Scholar
  15. Feynman RP (1989) What do you care what other people think? Bantam, New YorkGoogle Scholar
  16. Hopcroft JE, Tarjan RE (1973) AVlogV algorithm for isomorphism of triconnected planar graphs. J Comput System Sci 7:323–331Google Scholar
  17. Horn A, Valentine FA (1949) Some properties ofL-sets in the plane. Duke Math J 16:131–140Google Scholar
  18. Ke Y (1988) Detecting the weak visibility of a simple polygon and related problems. Johns Hopkins University, manuscript, March 1988Google Scholar
  19. Klee V (1971) Shapes of the future. Am Sci 59:84–91Google Scholar
  20. Leou JJ, Tsai WH (1987) Automatic rotational symmetry determination for shape analysis. Patt Recogn 20:571–582Google Scholar
  21. Mishra B, Teichman M (1992) On immobility. LRA 4:145–153Google Scholar
  22. O'Rourke J (1987) Art Gallery Theorems and Algorithms. Oxford University Press, OxfordGoogle Scholar
  23. Poulsen R, Oliver L, Cahn R, Louis C, Toussaint GT (1977) High resolution analysis of cervical cells — a progress report. J Histochem Cytochem 25:689–695Google Scholar
  24. Preparata FP, Supowit KJ (1981) Testing a simple polygon for monotonicity. Inf Process Lett 12:161–164Google Scholar
  25. Sack JR, Suri S (1986) An optimal algorithm for detecting weak visibility of a polygon. Technical Report SCS-TR-114, Carleton University, Ottawa, CanadaGoogle Scholar
  26. Shermer T (1993) On recognizing unions of two convex polygons and related problems. Patt Recogn Lett 14Google Scholar
  27. Shermer T, Toussaint GT (1988) Characterizations of convex and star-shaped polygons. In: Toussaint G (ed) Snap-shots of computational and discrete geometry. Technical Report SOCS-88.11, School of Computer Science, McGill UniversityGoogle Scholar
  28. Skiena SS (1992) Interactive reconstruction via geometric probing. Proc IEEE 80:1364–1383Google Scholar
  29. Sugihara K (1984) An O (nlogn) algorithm for determining the congruity of polyhedra. J Comput Syst Sci 29:36–47Google Scholar
  30. Toussaint GT (1984) A new linear algorithm for triangulating monotone polygons. Patt Recogn Lett 2:155–158Google Scholar
  31. Toussaint GT (1985) Shortest path solves translation separability of polygons. Technical Report SOCS-85.27, School of Computer Science, McGill UniversityGoogle Scholar
  32. Toussaint GT (1989) Computing geodesic properties inside a simple polygon. Invited paper in special issue on geometric reasoning. Rev Intell Artif 3:9–42Google Scholar
  33. Toussaint GT (1991) Efficient triangulation of simple polygons. Vis Comput 7:280–295Google Scholar
  34. Toussaint GT, Avis D (1982) On a convex hull algorithm for polygons and its application to triangulation problems. Patt Recogn 15:23–29Google Scholar
  35. Yu SL, Thonnat M (1993) Description of object shapes by apparent boundary and convex hull. Patt Recogn 26:95–107Google Scholar

Copyright information

© Springer Verlag 1994

Authors and Affiliations

  • Godfried T. Toussaint
    • 1
  1. 1.Computational Geometry Laboratory School of Computer ScienceMcGill UniversityMontrealCanada

Personalised recommendations