z-logo
open-access-imgOpen Access
Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
Author(s) -
Robert E. Tarjan,
Christopher J. Van Wyk
Publication year - 1988
Publication title -
siam journal on computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.533
H-Index - 122
eISSN - 1095-7111
pISSN - 0097-5397
DOI - 10.1137/0217067
Subject(s) - simple (philosophy) , simple polygon , binary logarithm , combinatorics , time complexity , polygon (computer graphics) , algorithm , computer science , simple algorithm , mathematics , monotone polygon , physics , geometry , telecommunications , philosophy , epistemology , frame (networking) , thermodynamics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom