A fast las vegas algorithm for triangulating a simple polygon
暂无分享,去创建一个
[1] Bernard Chazelle,et al. Triangulation and shape-complexity , 1984, TOGS.
[2] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..
[3] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.
[4] Richard Cole,et al. Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[5] Kenneth L. Clarkson,et al. A fast Las Vegas algorithm for triangulating a simple polygon , 1988, SCG '88.
[6] Kenneth L. Clarkson,et al. New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..
[7] Kurt Mehlhorn,et al. Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees , 1986, Inf. Control..
[8] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[9] Robert E. Tarjan,et al. An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..
[10] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[11] Robert E. Tarjan,et al. Simplified Linear-Time Jordan Sorting and Polygon Clipping , 1990, Inf. Process. Lett..
[12] Alain Fournier,et al. Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.
[13] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .