Christopher J. Van Wyk

1. An O(nlog log n)-Time Algorithm for Triangulating a Simple Polygon
   1988/02/01 by Robert E. Tarjan, Christopher J. Van Wyk · 10 citations
   Computer Science · Engineering · Mathematics · #Computational Geometry and Mesh Generation #Optimization and Search Problems #Robotics and Sensor-Based Localization #Simple polygon #Combinatorics #Polygon covering #Diagonal #Mathematics #Polygon (computer graphics) #Partition (number theory) #Simple (philosophy) #Computational geometry #Time complexity #Binary logarithm #Vertex (graph theory) #Triangulation #Algorithm #SIMPLE algorithm #Sorting #Monotone polygon #Computer science #Graph #Geometry
2. A fast las vegas algorithm for triangulating a simple polygon
   1989/10/01 by Kenneth L. Clarkson, Robert E. Tarjan, Christopher J. Van Wyk · 4 citations
   Computer Science · Engineering · Mathematics · #3D Shape Modeling and Analysis #Algorithm #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Convex set #Data Management and Algorithms #Geometry #Las vegas #Mathematics #Polygon (computer graphics) #Polygon covering #Randomized algorithm #Regular polygon #SIMPLE algorithm #Simple (philosophy) #Simple polygon #Star-shaped polygon