Search the dblp DataBase
Christopher J. Van Wyk :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Robert Endre Tarjan , Christopher J. Van Wyk An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:1, pp:143-178 [Journal ] Christopher J. Van Wyk A Class Library for Solving Simultaneous Equations. [Citation Graph (0, 0)][DBLP ] C++ Conference, 1991, pp:229-234 [Conf ] Kenneth L. Clarkson , Robert Endre Tarjan , Christopher J. Van Wyk A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1988, pp:18-22 [Conf ] Steven Fortune , Christopher J. Van Wyk Efficient Exact Arithmetic for Computational Geometry. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:163-172 [Conf ] Peter W. Shor , Christopher J. Van Wyk Detecting and Decomposing Self-Overlapping Curves. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1989, pp:44-50 [Conf ] Robert Endre Tarjan , Christopher J. Van Wyk Correction to ``A Linear-Time Algorithm for Triangulating Simple Polygons'' [Citation Graph (0, 0)][DBLP ] FOCS, 1987, pp:486- [Conf ] Steven Fortune , Christopher J. Van Wyk Robust Implementation of Geometric Algorithms Using Exact Arithmetic. [Citation Graph (0, 0)][DBLP ] IMA Conference on the Mathematics of Surfaces, 1994, pp:233-248 [Conf ] Theodosios Pavlidis , Christopher J. Van Wyk An automatic beautifier for drawings and illustrations. [Citation Graph (0, 0)][DBLP ] SIGGRAPH, 1985, pp:225-234 [Conf ] Robert Endre Tarjan , Christopher J. Van Wyk A Linear-Time Algorithm for Triangulating Simple Polygons [Citation Graph (0, 0)][DBLP ] STOC, 1986, pp:380-388 [Conf ] Brian W. Kernighan , Christopher J. Van Wyk Extracting Geometric Information form Architectural Drawings. [Citation Graph (0, 0)][DBLP ] WACG, 1996, pp:167-176 [Conf ] David P. Dobkin , Diane L. Souvaine , Christopher J. Van Wyk Decomposition and Intersection of Simple Splinegons. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1988, v:3, n:, pp:473-485 [Journal ] Christopher J. Van Wyk , Jeffrey Scott Vitter The Complexity of Hashing with Lazy Deletion. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1986, v:1, n:1, pp:17-29 [Journal ] Christopher J. Van Wyk Printing Common Words. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1987, v:30, n:7, pp:593-599 [Journal ] Christopher J. Van Wyk Literate Programming: An Assessment. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1990, v:33, n:3, pp:361- [Journal ] Christopher J. Van Wyk , Eric Hamilton , Don Colner Expanding Generalized Regular Expressions. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1988, v:31, n:12, pp:1376-1385 [Journal ] Christopher J. Van Wyk , Michael Jackson , David W. Wall Processing Transactions. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1987, v:30, n:12, pp:1000-1010 [Journal ] Christopher J. Van Wyk , Donald C. Lindsay , Harold W. Thimbleby A File Difference Program. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1989, v:32, n:6, pp:740-755 [Journal ] Christopher J. Van Wyk , Norman Ramsey Waving A Language-Independent WEB. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1989, v:32, n:9, pp:1051-1055 [Journal ] Peter W. Shor , Christopher J. Van Wyk Detecting and Decomposing Self-overlapping Curves. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1992, v:2, n:, pp:31-50 [Journal ] Brian W. Kernighan , Christopher J. Van Wyk Page Makeup by Postprocessing Text Formatter Output. [Citation Graph (0, 0)][DBLP ] Computing Systems, 1989, v:2, n:2, pp:103-132 [Journal ] Christopher J. Van Wyk Clipping to the boundary of a circular-arc polygon. [Citation Graph (0, 0)][DBLP ] Computer Vision, Graphics, and Image Processing, 1984, v:25, n:3, pp:383-392 [Journal ] Kenneth L. Clarkson , Robert Endre Tarjan , Christopher J. Van Wyk A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1989, v:4, n:, pp:423-432 [Journal ] Khun Yee Fung , Tina M. Nicholl , Robert Endre Tarjan , Christopher J. Van Wyk Simplified Linear-Time Jordan Sorting and Polygon Clipping. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:35, n:2, pp:85-92 [Journal ] Alejandro A. Schäffer , Christopher J. Van Wyk Convex Hulls of Piecewise-Smooth Jordan Curves. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1987, v:8, n:1, pp:66-94 [Journal ] John A. Morrison , Larry A. Shepp , Christopher J. Van Wyk A Queueing Analysis of Hashing with Lazy Deletion. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1987, v:16, n:6, pp:1155-1164 [Journal ] Robert Endre Tarjan , Christopher J. Van Wyk Erratum: An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:5, pp:1061- [Journal ] Emanuel Derman , Christopher J. Van Wyk A Simple Equation Solver and its Application to Financial Modelling. [Citation Graph (0, 0)][DBLP ] Softw., Pract. Exper., 1984, v:14, n:12, pp:1169-1181 [Journal ] Brian W. Kernighan , Christopher J. Van Wyk Timing Trials, or the Trials of Timing: Experiments with Scripting and User-Interface Languages. [Citation Graph (0, 0)][DBLP ] Softw., Pract. Exper., 1998, v:28, n:8, pp:819-843 [Journal ] Christopher J. Van Wyk AWK as Glue for Programs. [Citation Graph (0, 0)][DBLP ] Softw., Pract. Exper., 1986, v:16, n:4, pp:369-388 [Journal ] Christopher J. Van Wyk Arithmetic Equality Constraints as C++ Statements. [Citation Graph (0, 0)][DBLP ] Softw., Pract. Exper., 1992, v:22, n:6, pp:467-494 [Journal ] Steven Fortune , Christopher J. Van Wyk Static Analysis Yields Efficient Exact Integer Arithmetic for Computational Geometry. [Citation Graph (0, 0)][DBLP ] ACM Trans. Graph., 1996, v:15, n:3, pp:223-248 [Journal ] Christopher J. Van Wyk A High-Level Language for Specifying Pictures. [Citation Graph (0, 0)][DBLP ] ACM Trans. Graph., 1982, v:1, n:2, pp:163-182 [Journal ] Diane L. Souvaine , Christopher J. Van Wyk Clamping a polygon. [Citation Graph (0, 0)][DBLP ] The Visual Computer, 1994, v:10, n:8, pp:484-494 [Journal ] Search in 0.046secs, Finished in 0.048secs