Decomposition Algorithms in Geometry
暂无分享,去创建一个
[1] KEVIN Q. BROWN. Comments on “algorithms for reporting and counting geometric intersections” , 1981, IEEE Transactions on Computers.
[2] David G. Kirkpatrick,et al. Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3] Leonidas J. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.
[4] J. Mark Keil,et al. Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..
[5] Bernard Chazelle,et al. An optimal algorithm for intersecting line segments in the plane , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[6] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..
[7] Andrzej Lingas,et al. The Power of Non-Rectilinear Holes , 1982, ICALP.
[8] Kokichi Sugihara,et al. On good triangulations in three dimensions , 1992, Int. J. Comput. Geom. Appl..
[9] Alain Fournier,et al. Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.
[10] Steven Fortune,et al. A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.
[11] James H. Davenport,et al. Real Quantifier Elimination is Doubly Exponential , 1988, J. Symb. Comput..
[12] Kurt Mehlhorn,et al. Fast Triangulation of Simple Polygons , 1983, FCT.
[13] Chandrajit L. Bajaj,et al. Convex Decomposition of Polyhedra and Robustness , 1992, SIAM J. Comput..
[14] Kurt Mehlhorn,et al. Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees , 1986, Inf. Control..
[15] Franco P. Preparata,et al. Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..
[16] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[17] Joseph O'Rourke,et al. Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.
[18] B. Chazelle,et al. Optimal Convex Decompositions , 1985 .
[19] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..
[20] Bernard Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra , 1989, 30th Annual Symposium on Foundations of Computer Science.
[21] Takao Asano,et al. Partitioning a polygonal region into trapezoids , 1986, JACM.
[22] Jörg-Rüdiger Sack,et al. A computational geometry workbench , 1990, SCG '90.
[23] Leonidas J. Guibas,et al. A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications , 1989, ICALP.
[24] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.
[25] Fanica Gavril,et al. Algorithms for a maximum clique and a maximum independent set of a circle graph , 1973, Networks.
[26] Godfried T. Toussaint,et al. On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..
[27] Bernard Chazelle,et al. Triangulation and shape-complexity , 1984, TOGS.
[28] Chee-Keng Yap,et al. AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..
[29] Leonidas J. Guibas,et al. A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications , 1991, Theor. Comput. Sci..
[30] Takao Asano,et al. Minimum partition of polygonal regions into trapezoids , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[31] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[32] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[33] Bernard Chazelle,et al. Triangulating a non-convex polytype , 1989, SCG '89.
[34] Ketan Mulmuley,et al. A fast planar partition algorithm, II , 1989, JACM.
[35] David G. Kirkpatrick,et al. Polygon triangulation in O(n log log n) time with simple data-structures , 1990, SCG '90.
[36] Robert E. Tarjan,et al. An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..
[37] Kenneth L. Clarkson,et al. A fast las vegas algorithm for triangulating a simple polygon , 1989, Discret. Comput. Geom..
[38] Godfried T. Toussaint,et al. PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .
[39] Bernard Chazelle. Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..
[40] Raimund Seidel,et al. On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra , 1989, SCG '89.