Computational and structural advantages of circular boundary representation

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

Volumn 4619 LNCS, Issue , 2007, Pages 374-385

  Aichholzer, O ^a   Aurenhammer, F ^a   Hackl, T ^a   Juttler B ^b   Oberneder, M ^b   Sir Z ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY;

BOUNDARY APPROXIMATION; BOUNDARY REPRESENTATION; PLANAR SHAPES;

BOUNDARY CONDITIONS;

EID: 38149085434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73951-7_33     Document Type: Conference Paper

References (33)

1. Alt, H., Cheong, O., Vigneron, A.: The Voronoi diagram of curved objects. Discrete & Computational Geometry 34, 439-453 (2005)
2. Attali, D., Boissonnat, J.-D., Edelsbrunner, H.: Stability and computation of medial axes - a state-of-the-art report. In: Mller, T., Hamann, B., Russell, B. (eds.) Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, Springer Series on Mathematics and Visualization (to appear)
3. Avis, D., Toussaint, G.T.: An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognition 13, 395-398 (1981)
4. Bhattacharya, B.K., El Gindy, H.: A new linear convex hull algorithm for simple polygons. IEEE Trans. Information Theory IT-30, 85-88 (1984)
5. th ACM Symp. Solid Modeling and Applications, pp. 243-248 (2004)
6. Chazal, F., Soufflet, R.: Stability and finiteness properties of medial axis and skeleton. J. Dynamical and Control Systems 10, 149-170 (2004)
7. rd IEEE Symp. FOCS, pp. 339-349 (1982)
8. Chin, F., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 382-391. Springer, Heidelberg (1995)
9. Choi, H.I., Choi, S.W., Moon, H.P.: Mathematical theory of medial axis transform. Pacific J. Mathematics 181, 57-88 (1997)
10. Dobkin, D.P., Souvaine, D.L.: Computational geometry in a curved world. Algorithmica 5, 421-457 (1990)
11. Emiris, LZ., Kakargias, A., Pion, S., Teíllaud, M., Tsigaridas, E.P.: Towards an open curved kernel. In: Proc. 20th Ann. ACM Symp. Computational Geometry, pp. 438-446 (2004)
12. Farin, G.: Curves and Surfaces for Computer Aided Geometric Design. Academic Press, San Diego (1997)
13. Farin, G., Hoschek, J., Kim, M.-S.: Handbook of Computer Aided Geometric Design. Elsevier, Amsterdam (2002)
14. Garey, M.R., Johnson, D.S., Preparata, F.P., Tarjan, R.E.: Triangulating a simple polygon. Information Processing Letters 7, 175-179 (1978)
15. Graham, R.L.: An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters 1, 132-133 (1972)
16. Graham, R.L., Yao, F.F.: Finding the convex hull of a simple polygon. J. Algorithms 4, 324-331 (1984)
17. Held, M., Eibl, J.: Biarc approximation of polygons with asymmetric tolerance bands. Computer-Aided Design 37, 357-371 (2005)
18. Hertel, S., Mehlhorn, K.: Fast triangulation of the plane with respect to simple polygons. Information & Control 64, 52-76 (1985)
19. Klein, R., Mehlhorn, K., Meiser, S.: Randomized incremental construction of abstract Voronoi diagrams. Computational Geometry: Theory and Applications 3, 157-184 (1993)
20. Kong, X., Everett, H., Toussaint, G.T.: The Graham scan triangulates simple polygons. Pattern Recognition Letters 11, 713-716 (1990)
21. Lee, D.T.: Medial axis transformation of a planar shape. IEEE Trans. Pattern Analysis and Machine Intelligence PAMI-4, 363-369 (1982)
22. Lee, D.T., Preparata, F.P.: Location of a point in a planar subdivision and its applications. SIAM J. Computing 6, 594-606 (1977)
23. McCallum, D., Avis, D.: A linear algorithm for finding the convex hull of a simple polygon. Information Processing Letters 9, 201-206 (1979)
24. Meek, D.S., Walton, D. J.: Approximation of a planar cubic Bézier spiral by circular arcs. J. Computational and Applied Mathematics 75, 47-56 (1996)
25. Meek, D.S., Walton, D.J.: Spiral arc spline approximation to a planar spiral. J. Computational and Applied Mathematics 107, 21-30 (1999)
26. Melkman, A.: On-line construction of the convex hull of a simple polygon. Information Processing Letters 25, 11-12 (1987)
27. Ong, CJ., Wong, Y.S., Loh, H.T., Hong, X.G.: An optimization approach for biarc curve fitting of B-spline curves. Computer-Aided Design 28, 951-959 (1996)
28. Ramamurthy, R., Farouki, R.T.: Voronoi diagram and medial axis algorithm for planar domains with curved boundaries I. Theoretical foundations. J. Computational and Applied Mathematics 102, 119-141 (1999)
29. Reif, U.: Uniform B-spline approximation in Sobolev spaces. Numerical Algorithms 15, 1-14 (1997)
30. Sabin, M. A.: The use of circular arcs to form curves interpolated through empirical data points. Rep. VTO/MS/164, British Aircraft Corporation (1976)
31. Šír, Z., Feichtinger, R., Jüttler, B.: Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics. Computer-Aided Design 38, 608-618 (2006)
32. Yang, X.: Efficient circular arc interpolation based on active tolerance control. Computer-Aided Design 34, 1037-1046 (2002)
33. Yap, C.K.: An O(nlogn) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete k Computational Geometry 2, 365-393 (1987)