On Polyhedra Induced by Point Sets in Space
暂无分享,去创建一个
Godfried T. Toussaint | Pankaj K. Agarwal | Ferran Hurtado | Joan Trias | P. Agarwal | G. Toussaint | F. Hurtado | J. Trias
[1] Jean-Daniel Boissonnat. Reconstruction of solids , 1985, SCG '85.
[2] Joseph O'Rourke,et al. On reconstructing polyhedra from parallel slices , 1996, Int. J. Comput. Geom. Appl..
[3] G. Toussaint. Solving geometric problems with the rotating calipers , 1983 .
[4] J. O´Rourke,et al. Computational Geometry in C: Arrangements , 1998 .
[5] J. O'Rourke,et al. Connect-the-dots: a new heuristic , 1987 .
[6] Sung Yong Shin,et al. A Linear Time Algorithm for Triangulating a Point-Visible Polygon , 1985, ACM Trans. Graph..
[7] Godfried T. Toussaint,et al. Efficient triangulation of simple polygons , 1991, The Visual Computer.
[8] Godfried T. Toussaint. A linear-time algorithm for solving the strong hidden-line problem in a simple polygon , 1986, Pattern Recognit. Lett..
[9] N. J. Lennes. Theorems on the Simple Finite Polygon and Polyhedron , 1911 .
[10] Raimund Seidel,et al. On the difficulty of triangulating three-dimensional Nonconvex Polyhedra , 1992, Discret. Comput. Geom..
[11] Michael C. Gemignani. More on Finite Subsets and Simple Closed Polygonal Paths , 1966 .
[12] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[13] Jirí Matousek,et al. Dynamic half-space range reporting and its applications , 2005, Algorithmica.
[14] E. Schönhardt,et al. Über die Zerlegung von Dreieckspolyedern in Tetraeder , 1928 .
[15] Godfried T. Toussaint. A new linear algorithm for triangulating monotone polygons , 1984, Pattern Recognit. Lett..
[16] Chung-Wu Ho,et al. 60.10 Decomposition of a polygon into triangles , 1976, The Mathematical Gazette.
[17] Leonidas J. Guibas,et al. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.
[18] Selim G. Akl,et al. A Fast Convex Hull Algorithm , 1978, Inf. Process. Lett..
[19] M. Gemignani. On Finite Subsets of the Plane and Simple Closed Polygonal Paths , 1966 .
[20] J. Davenport. Editor , 1960 .
[21] A. M. Andrew,et al. Another Efficient Algorithm for Convex Hulls in Two Dimensions , 1979, Inf. Process. Lett..
[22] Louis V. Quintas,et al. On Some Properties of Shortest Hamiltonian Circuits , 1965 .
[23] Jorge Urrutia,et al. Onion Polygonizations , 1996, Information Processing Letters.
[24] F. Bagemihl,et al. On Indecomposable Polyhedra , 1948 .
[25] David Sanders. Metric spaces in which minimal circuits cannot self-intersect , 1976 .
[26] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[27] Bernard Chazelle,et al. Triangulating a non-convex polytype , 1989, SCG '89.
[28] Thomas C. Shermer. Computing Bushy and Thin Triangulations , 1991, Comput. Geom..
[29] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[30] Michael Ian Shamos,et al. Geometric complexity , 1975, STOC.
[31] Godfried T. Toussaint,et al. On Computing General Position Views of Data in Three Dimensions , 2002, J. Vis. Commun. Image Represent..
[32] David G. Kirkpatrick,et al. Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..
[33] Harald Trost. Computational Morphology , 2003 .
[34] Joseph O'Rourke,et al. Computational Geometry in C. , 1995 .
[35] Bernard Chazelle,et al. Triangulating a nonconvex polytope , 1990, Discret. Comput. Geom..