Advertisement

On boundary approximation

  • Fridrich Sloboda
  • Bedrich Zat'ko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 970)

Abstract

Approximation of boundaries of characteristic compact sets of f: R2R1 in implicit forms by gridding techniques is described. The coresponding algorithm is based on the notion of the shortest polygonal path in a polygonally bounded compact set. One of the most important boundaries of characteristic sets of f is the boundary of convexity of f.

Keywords

Jordan Curve Short Path Problem Simple Polygon Implicit Form Polygonal Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. D. Alexandrov, Intrinsic Geometry of Convex Surfaces, (in Russian) OGIZ, Moscow (1948).Google Scholar
  2. [2]
    B. Chazelle, Triangulating a Simple Polygon in Linear Time, Discrete Comput. Geom. 6 (1991) 485–524.Google Scholar
  3. [3]
    Y.-J. Chiang, F. P. Preparata, R. Tamasia, A Unified Approach to Dynamic Point Location, Ray Shooting and Shortest Paths in Planar Maps, Proc. 4th ACM-SIAM Symp. on Discrete Algorithms (1993) 44–53.Google Scholar
  4. [4]
    J. G. Dunham, Optimum Uniform Picewise Linear Approximation of Planar Curves, IEEE Trans. on Patt. Anal. Mach. Intell., PAMI-8 (1986) 67–75.Google Scholar
  5. [5]
    P. Ferianc, F. Sloboda, B. Zat'ko, On Properties of the Shortest Path Problem Solution in a Polygonally Bounded Compact Set, Techn. Report of the Inst. of Control Theory and Robotics, Bratislava (1993).Google Scholar
  6. [6]
    A. Fournier, D. Y. Montuno, Triangulating Simple Polygons and Equivalent Problems, ACM Trans. on Graph. 3 (1984) 153–174.Google Scholar
  7. [7]
    S. Hertel, K. Mehlhorn, Fast triangulation of simple polygons, Proc. Conf. Found. Comput. Theory, Springer Verlag, New York (1983), 207–218.Google Scholar
  8. [8]
    J. Kittler, J. Illingworth, Minimum Error Thresholding, Pattern Recognition 19 (1986) 41–47.Google Scholar
  9. [9]
    D. T. Lee, F. P. Preparata, Location of a Point in a Planar Subdivision and its Applications, SIAM J. Comput.6 (1977) 594–606.Google Scholar
  10. [10]
    D. T. Lee, F. P. Preparata, Euclidean Shortest Paths in the Presence of Rectilinear Barriers, Networks 14 (1984) 393–410.Google Scholar
  11. [11]
    D. Marr, E. C. Hildreth, Theory of Edge Detection, Proc. Roy. Soc. London, B207 (1980) 187–217.Google Scholar
  12. [12]
    N. Otsu, A Threshold Selection Method from Gray-Level Histograms, IEEE Trans. Syst., Man, Cyber. 9 (1979) 62–66.Google Scholar
  13. [13]
    J. M. Ortega, W. C. Rheinboldt, Iterative Solution of Nonlinear Equation in Several Variables, Academic Press, New York, London (1970).Google Scholar
  14. [14]
    A. Rosenfeld, J. L. Pfaltz, Sequential Operations in Digital Image Processing, J. ACM 13 (1966) 471–494.Google Scholar
  15. [15]
    P. K. Sahoo, S. Soltani, A. K. Wong, A Survey of Thresholding Techniques, Computer Vision, Graphics and Image Process. 41 (1988) 233–260.Google Scholar
  16. [16]
    J. Sklansky, R. L. Chazin, B. J. Hansen, Minimum Perimeter Polygon of digitized Silhouettes, IEEE Trans. on Comp. 21 (1972) 260–268.Google Scholar
  17. [17]
    F. Sloboda, J. Stoer, On Piecewise Linear Approximation of Planar Jordan Curves, to appear in J. Comp. Applied Mathematics (1995).Google Scholar
  18. [18]
    F. Sloboda, J. Stoer, On Piecewise Linear Approximation of Planar Jordan Arcs, Techn. Report of the Inst. of Control Theory and Robotics, Bratislava (1995).Google Scholar
  19. [19]
    F. Sloboda, B. Zat'ko, On Linear Time Algorithm for the Shortest Path Problem in a Polygonally Bounded Compact Set, Techn. Report of the Inst. of Control Theory and Robotics, Bratislava (1993).Google Scholar
  20. [20]
    F. Sloboda, B. Zat'ko, On Shortest Path Problem Solution in a Polygon, Techn. Report of the Inst. of Control Theory and Robotics, Bratislava (1994).Google Scholar
  21. [21]
    F. Sloboda, B. Zat'ko, On Approximation of Planar Jordan Curves and Arcs in Implicit Forms, Techn. Report of the Inst. of Control Theory and Robotics, Bratislava (1995).Google Scholar
  22. [22]
    G. T. Toussaint, Efficient Triangulation of Simple Polygons, Visual Computer 7 (1991) 280–295.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Fridrich Sloboda
    • 1
  • Bedrich Zat'ko
    • 1
  1. 1.Institute of Control Theory and RoboticsSlovak Academy of SciencesBratislavaSlovakia

Personalised recommendations