On Computing General Position Views of Data in Three Dimensions
暂无分享,去创建一个
Godfried T. Toussaint | Suneeta Ramaswami | Francisco Gómez | G. Toussaint | S. Ramaswami | Francisco Gómez
[1] Satoru Kawai,et al. A simple method for computing general position in displaying three-dimensional objects , 1988, Comput. Vis. Graph. Image Process..
[2] Joseph S. B. Mitchell,et al. Generating Random x-Monotone Polygons with Given Vertices , 1994, Canadian Conference on Computational Geometry.
[3] Prosenjit Bose,et al. Growing a Tree from Its Branches , 1995, J. Algorithms.
[4] Andrew M. Day. The implementation of an algorithm to find the convex hull of a set of three-dimensional points , 1990, TOGS.
[5] Kevin Q. Brown. Geometric transforms for fast geometric algorithms , 1979 .
[6] Raimund Seidel,et al. Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..
[7] Micha Sharir,et al. Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences , 2015, J. Comb. Theory, Ser. A.
[8] Leonidas J. Guibas,et al. A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..
[9] Prosenjit Bose,et al. Drawing Nice Projections of Objects in Space , 1999, J. Vis. Commun. Image Represent..
[10] John F. Canny,et al. A General Approach to Removing Degeneracies , 1995, SIAM J. Comput..
[11] Chee-Keng Yap. Geometric Consistency Theorem for a Symbolic Perturbation Scheme , 1990, J. Comput. Syst. Sci..
[12] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[13] John F. Canny,et al. An efficient approach to removing geometric degeneracies , 1992, SCG '92.
[14] Richard J. Lipton,et al. On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..
[15] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[16] Raimund Seidel. The Nature and Meaning of Perturbations in Geometric Computing , 1998, Discret. Comput. Geom..
[17] Kurt Mehlhorn,et al. On degeneracy in geometric computations , 1994, SODA '94.
[18] Charles S. Peskin,et al. On the construction of the Voronoi mesh on a sphere , 1985 .
[19] M. Iri,et al. Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic , 1992, Proc. IEEE.
[20] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.
[21] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[22] Azriel Rosenfeld,et al. Polygons in Three Dimensions , 1994, J. Vis. Commun. Image Represent..