Literatur
[C82] Chazelle, B. A theorem on polygon cutting with applications, Proc. 23rd Annual IEEE on
Found. of Comput. Sci. (1982), 339-349.
[C90] Chazelle, B. Triangulating a simple polygon in linear time, Princeton Univ. Computer Science
Tech. Rep. CS-TR-264-90; to appear in Proc. 31st Annual IEEE Symp. on Found. of Comput.
Sci. (1990)
[CI] Chazelle, B., Incerpi, J. Triangulation and shape-complexity, ACM Trans. on Graphics 3 (1984),
135-152.
[CC] Clarkson, K. and Cole, R. Private Communication.
[CTV] Clarkson, K., Tarjan, R.E., Van Wyk, C.J. A fast Las Vegas algorithm for triangulating a
simple polygon, Disc. and Comput.Geom. 4(5) (1989), 432-432.
[FM] Fournier, A., Montuno, D.Y. Triangulating simple polygons and equivalent problems, ACM
Trans. on Graphics 3. (1984), 153-174.
[GJPT] Garey, M.R., Johnson, D.S., Preparata, F.P., Tarjan, R.E. Triangulating a simple polygon,
Inform. Process. Lett. 7 (1978), 175-180.
[HM] Hertel, S., Mehlhorn, K. Fast triangulation of a simple polygon, Proc. Conf. Found. Comput.
Theory, New York, Lecture Notes on Computer Science 158 (1983), 207-218.
[HMRT] Ho.man, K., Mehlhorn, K., Rosenstiehl, P., Tarjan, R.E. Sorting Jordan sequences in linear
time using level-linked search trees, Infor. and Control 68 (1986), 170-184.
[KKT] Kirkpatrick, D.G., Klawe, M.M, Tarjan, R.E. O(n log log n) polygon triangulation with simple
data structures, Proc. 6th Annual ACM Symp. Comput. Geom. (1990), 34-43.
[TA82] Toussaint, G. and Avis, D. On a convex hull algorithm for convex polygons and its applications
to triangulation problems, Pattern Recognition 15,1 (1982), 23-29.
[TV] Tarjan, R.E., Van Wyk, C.J. An O(n log log n)-time algorithm for triangulating a simple poly-
gon, SIAM J. Comput. 17 (1988), 143-178.
[T88] Toussaint, G. An aoutput-complexity-sensitive polygon triangulation algorithm, Report SICS-
86.3, McGil. University, Montreal, 1988.
|
