Computational Geometry and Morphology
暂无分享,去创建一个
[1] D. T. Lee,et al. Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.
[2] B. Chazelle,et al. Optimal Convex Decompositions , 1985 .
[3] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[4] Godfried T. Toussaint,et al. NEW RESULTS IN COMPUTATIONAL GEOMETRY RELEVANT TO PATTERN RECOGNITION IN PRACTICE , 1986 .
[5] Leonidas J. Guibas,et al. Visibility-polygon search and euclidean shortest paths , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[6] Václav Medek. On the boundary of a finite set of points in the plane , 1981 .
[7] Matthew T. Mason,et al. Robot Motion: Planning and Control , 1983 .
[8] David G. Kirkpatrick,et al. On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.
[9] Ugo Montanari,et al. Continuous Skeletons from Digitized Images , 1969, JACM.
[10] H. Blum. Biological shape and visual science (part I) , 1973 .
[11] Marvin Minsky,et al. Perceptrons: An Introduction to Computational Geometry , 1969 .
[12] Kenneth J. Supowit,et al. The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.
[13] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.
[14] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[15] D. T. Lee,et al. Computational Geometry—A Survey , 1984, IEEE Transactions on Computers.
[16] D'arcy W. Thompson. On growth and form i , 1943 .
[17] D. Avis,et al. REMARKS ON THE SPHERE OF INFLUENCE GRAPH , 1985 .
[18] Joseph O'Rourke. Computing the relative neighborhood graph in the L1 and Linfinity metrics , 1982, Pattern Recognit..
[19] P. V. de Souza,et al. Computer location of medial axes. , 1977, Computers and biomedical research, an international journal.
[20] Leonidas J. Guibas,et al. Visibility and intersectin problems in plane geometry , 1985, SCG '85.
[21] D. T. Lee,et al. Medial Axis Transformation of a Planar Shape , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[22] Ugo Montanari,et al. A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance , 1968, J. ACM.
[23] F. Bookstein. The line-skeleton , 1979 .
[24] D. T. Lee,et al. Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..
[25] Hiroshi Imai,et al. Computational-geometric methods for polygonal approximations of a curve , 1986, Comput. Vis. Graph. Image Process..
[26] J. Sack,et al. Minimum Decompositions of Polygonal Objects , 1985 .
[27] Godfried T. Toussaint. Shortest Path Solves Translation Separability of Polygons , 1986, IAS.
[28] Gustav Bernroider. The Foundation of Computational Geometry: Theory and Application of the Point-Lattice-Concept within Modern Structure Analysis , 1978 .
[29] W. E. Hartnett,et al. Shape Recognition, Prairie Fires, Convex Deficiencies and Skeletons , 1968 .
[30] Christian Lantuéjoul,et al. Geodesic methods in quantitative image analysis , 1984, Pattern Recognit..
[31] Azriel Rosenfeld,et al. Computer representation of planar regions by their skeletons , 1967, CACM.
[32] HARRY BLUM,et al. Shape description using weighted symmetric axis features , 1978, Pattern Recognit..
[33] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..
[34] G. Matheron. Random Sets and Integral Geometry , 1976 .
[35] J M Kennedy,et al. Illusory Contours Can Arise in Dot Figures , 1978, Perception.
[36] D. T. Lee. Relative neighborhood graphs in the Li-metric , 1985, Pattern Recognit..
[37] Godfried T. Toussaint,et al. PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .
[38] J. Reif,et al. Shortest Paths in Euclidean Space with Polyhedral Obstacles. , 1985 .
[39] Godfried T. Toussaint,et al. Computational Geometric Problems in Pattern Recognition , 1982 .
[40] Godfried T. Toussaint. A linear-time algorithm for solving the strong hidden-line problem in a simple polygon , 1986, Pattern Recognit. Lett..
[41] David G. Kirkpatrick,et al. Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[42] D. Kirkpatrick,et al. A Framework for Computational Morphology , 1985 .
[43] Roderick Urquhart,et al. Some properties of the planar Euclidean relative neighbourhood graph , 1983, Pattern Recognit. Lett..
[44] Manabu Ichino,et al. The relative neighborhood graph for mixed feature variables , 1985, Pattern Recognit..
[45] F. Bookstein,et al. The Measurement of Biological Shape and Shape Change. , 1980 .
[46] D. T. Lee,et al. Computing the visibility polygon from an edge , 1986, Comput. Vis. Graph. Image Process..
[47] Godfried T. Toussaint,et al. Shortest path solves edge-to-edge visibility in a polygon , 1986, Pattern Recognit. Lett..
[48] Robert E. Tarjan,et al. A linear-time algorithm for triangulating simple polygons , 1986, STOC '86.
[49] Bernard Chazelle,et al. A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[50] Michael E. Mortenson,et al. Geometric Modeling , 2008, Encyclopedia of GIS.
[51] Leonidas J. Guibas,et al. Linear time algorithms for visibility and shortest path problems inside simple polygons , 2011, SCG '86.