AN O(n log log n)-TIME ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON (1988)

by Robert E. Tarjan , Christopher J. Van Wyk
Citations:38 - 3 self

Active Bibliography

384 Self-adjusting binary search trees – Daniel Dominic Sleator, Robert Endre Tarjan - 1985
544 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
621 Voronoi diagrams -- a survey of a fundamental geometric data structure – Franz Aurenhammer - 1991
550 A new approach to the maximum flow problem – Andrew V. Goldberg, Robert E. Tarjan - 1988
557 How bad is selfish routing? – Tim Roughgarden, √Čva Tardos - 2002
564 Program Analysis and Specialization for the C Programming Language – Lars Ole Andersen - 1994
1725 Nonlinear dimensionality reduction by locally linear embedding – Sam T. Roweis, Lawrence K. Saul - 2000
792 Introduction to Algorithms, Second Edition – T H Leiserson, C E Cormen, R L Rivest, C Stein - 2001
1717 The probabilistic method – Noga Alon, Joel H. Spencer - 2000