Voronoi diagrams and offset curves of curvilinear polygons

CAD Computer Aided Design

Volumn 30, Issue 4, 1998, Pages 287-300

  Held, Martin ^a,b,c  

^a UNIVERSITY OF SALZBURG   (Austria)

^b STONY BROOK UNIVERSITY   (United States)

^c JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Experimental analysis; Offset curves; Voronoi diagrams

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; PERFORMANCE; PROBLEM SOLVING; SET THEORY; STATISTICS;

CURVILINEAR POLYGON; VORONOI DIAGRAMS; WAVEFRONT PROPAGATION ALGORITHM;

COMPUTATIONAL GEOMETRY;

EID: 0032046509     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4485(97)00071-7     Document Type: Article

References (32)

1. Whitesides, S. and Zhao, R. Y., Offsets of circular arc figures. In Proceedings of the 2nd Canadian Conference on Computer Geometry, 1990, pp. 362-365.
2. O'Dunlaing, C. and Yap, C. K., A retraction method for planning the motion of a disc. Journal of Algorithms, 1985, 6, 104-111.
3. Vermeer, P. J., Medial axis transform to boundary representation conversion. PhD thesis, Purdue University, West Lafayette, Indiana 47907-1398, USA, 1994.
4. Mayya, N. and Rajan, V. T., An efficient shape-representation scheme using Voronoi skeletons. Pattern Recogn. Lett., 1995, 16(2), 147-160.
5. Giirsoy, H. N. and Patrikalakis, N. M., An automatic coarse and fine surface mesh generation scheme based on medial axis transform - I. Algorithm. Engineering with Computers, 1992, 8, 121-137.
6. Srinivasan, V., Nackman, L. R., Tang, J. -M. and Meshkat, S. N., Automatic mesh generation using the symmetric axis transform of polygonal domains. Proceedings of the IEEE, 1992, 80(9), 1485-1501.
7. Held, M., On the Computatational Geometry of Pocket Machining, Vol. 500 of Lecture Notes in Computer Science. Springer, Berlin, 1991.
8. Held, M., Lukacs, G. and Andor, L., Pocket machining based on contour-parallel tool paths generated by means of proximity maps. Computer Aided Design, 1994, 26(3), 189-203.
9. Fortune, S., A sweepline algorithm for Voronoi diagrams. Algorithmica, 1987, 2(2), 153-174.
10. Yap, C. K., An O(n* log n) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Computer Geometry, 1987, 2(4), 365-393.
11. Lee, D. T., Medial axis transformation of a planar shape. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI, 1982, 4(4), 363-369.
12. Aggarwal, A., Guibas, L. J., Saxe, J. and Shor, P. W., A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Computer Geometry, 1989, 4(6), 591-604.
13. Devillers, O., Randomization yields simple O(n log* n) algorithms for difficult Ω(n) problems. International Journal of Computer Geometry and Applications, 1992, 2(1), 97-111.
14. Chin, F., Snoeyink, J. and Wang, C. -A., Finding the Medial Axis of a Simple Polygon in Linear Time. In Proceedings of the 6th Annuual International Symposium on Algorithms on Computer, Vol. 1004 of Lecture Notes on Computer Science. Springer, Berlin, 1995, pp. 382-391.
15. Alt, H. and Schwarzkopf, O., The Voronoi diagram of curved objects. In Proceedings of the 11th Annual ACM Symposium on Computer Geometry, Vancouver, BC, Canada, 1995, pp. 89-97.
16. Gold, C. M., Remmele, P. M. and Roos, T., Voronoi diagrams of line segments made easy. In Proceedings of the 7th Canadian Conference on Computer Geometry, Québec City, Québec, Canada, 1995, pp. 223-228.
17. Imai, T., A topology oriented algorithm for the Voronoi diagram of polygons. In Proceedings of the 8th Canadian Conference on Computer Geometry. Carleton University Press, 1996, pp. 107-112.
18. Fortune, S., Stable maintenance of point set triangulations in two dimensions. In Proceedings of the 30th Annual IEEE Symposium of the Foundation for Computer Science, 1989, pp. 494-505.
19. Edelsbrunner, H. and Mucke, E. P., Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transations on Graphics, 1990, 9(1), 66-104.
20. Avnaim, F., Boissonnat, J. -D., Devillers, O., Preparata, F. and Yvinec, M., Evaluation of a new method to compute signs of determinants. In Proceedings of the 11th Annual ACM Symposium on Computer Geometry, Vancouver, BC, Canada, 1995, pp. C16-C17.
21. Benouamer, M., Jaillon, P., Michelucci, D. and Moreau, J. -M., A lazy solution to imprecision in computational geometry. In Proceedings of the 5th Canadian Conference on Computer Geometry, Waterloo, Ontario, Canada, 1993, pp. 73-78.
22. Fortune, S. and Van Wyk, C. J., Efficient exact arithmetic for computational geometry. In Proceedings of the 9th Annual ACM Symposium on Computer Geometry, San Diego, CA, USA, May 1993, pp. 163-172.
23. Fortune, S. and Van Wyk, C. J., Static analysis yields efficient exact integer arithmetic for computational geometry. ACM Transactions on Graphics, 1996, 15(3), 223-248.
24. Burnikel, C., Mehlhorn, K. and Schirra, S., How to compute the Voronoi diagram of line segments: theoretical and experimental results. In Algorithms - Annual European Symposium Algorithms '94, no. 855 in Lecture Notes on Computer Science, ed. J. van Leeuwen, Utrecht, 1994, pp. 227-237.
25. Burnikel, C., Exact computation of Voronoi diagrams and line segment intersections. PhD thesis, MPI-Saarbrücken, D-66123 Saarbrücken, Germany, 1996.
26. Mehlhorn, K., Näher, S. and Uhrig, C., The LEDA User Manual. Version R3.4. MPI-Saarbrücken, D-66123 Saarbrücken, Germany, 1996.
27. Seel, M., An Accurate Arithmetic Implementation of Line Segment AVDS. Technical Report, MPI-Saarbrucken, D-66123 Saarbücken, Germany, 1996.
28. Chou, J. J., Voronoi diagrams for planar shapes. IEEE Computer Graphics Applications, 1995, 15(2), 5259.
29. Persson, H., NC machining of arbitrarily shaped pockets. Computer Aided Design, 1978, 10(3), 169-174.
30. Yao, C. and Rokne, J., A straightforward algorithm for computing the medial axis of a simple polygon. International Journal of Computers and Mathematics, 1991, 39, 51-60.
31. Srinivasan, V. and Nackman, R., Voronoi diagrams for multiply-connected polygonal domains - 1. Algorithm. IBM Journal of Research and Development, 1987. 31(3), 361-372.
32. Auer, T. and Held, M. Heuristics for the generation of random polygons. In Proceedings of the 8th Canadian Conference on Computer Geometry. Carleton University Press, pp. 38-44.