Geometric structures for three-dimensional shape representation

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Jon Louis Bentley , Bruce W. Weide , Andrew C. Yao, Optimal Expected-Time Algorithms for Closest Point Problems, ACM Transactions on Mathematical Software (TOMS), v.6 n.4, p.563-580, Dec. 1980 [doi>10.1145/355921.355927]
	2	BOISSONNAT, J.D. Representation of objects by triangulating points in 3-D space. In ICPR 82 (Munich). 1982, IEEE, Silver Springs, CA. pp. 830-832.
	3	BOWVER, A. Computing Dirichlet tessetations. Comput. J. 24, 2 (May 1981), 162-166.
	4	James P. Ducan , Susan G. Mair, Sculptured Surfaces in Engineering and Medicine, Cambridge University Press, New York, NY, 1983
	5	FAUGEaAS, O~ D., HEad.aT, M., Muss{, P., AND BOISSONNAT, J. }:). Polyhedral approximation of 3-D objects without holes. Comput. Graph. Image Proc. 25 {Feb. 1984}, 169-183.
	6	FRANKE, R. Scattered data interpolation: Test of some methods. Math. Comput. 38, 157 (Jan. 1982), 181-200.
	7	Jerome H. Freidman , Jon Louis Bentley , Raphael Ari Finkel, An Algorithm for Finding Best Matches in Logarithmic Expected Time, ACM Transactions on Mathematical Software (TOMS), v.3 n.3, p.209-226, Sept. 1977 [doi>10.1145/355744.355745]
	8	H. Fuchs , Z. M. Kedem , S. P. Uselton, Optimal surface reconstruction from planar contours, Communications of the ACM, v.20 n.10, p.693-702, Oct. 1977 [doi>10.1145/359842.359846]
	9	GmLiN, P.J. Graphs, Surface and Homology. Chapman and Hall, London, England, 1977.
	10	HERMELiNE P. Triangulation automatique d'un polyedre en dimension N. R.A.LR.O. Anal. Numer. 16, 3 {1982), 211-242.
	11	KLEE, V. On the complexity of d-dimensional Voronoi diagrams. Arch. Math. 34 (1980), 75-80.
	12	LEE, D. T. Medial axis transformation of a planar shape. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4, 4 (July 1982), 363-369.
	13	O'ROURKE, J. Triangulation of minimal area as 3-D object models. In Proceedings of the International Joint Confereace on Artificial Intelligence 81 (Vancouver, Canada). 1981, pp. 664- 666.
	14	F. P. Preparata , S. J. Hong, Convex hulls of finite sets of points in two and three dimensions, Communications of the ACM, v.20 n.2, p.87-93, Feb. 1977 [doi>10.1145/359423.359430]
	15	ROGEaS, C.A. Packing and Covering. Cambridge University Press, Cambridge, England, 1964.
	16	SATO, Y., KITAGAWAS, H., AND FtJJITA, H. Shape measurement of curved objects using multiple slit-ray projections. IEEE Trans. Pattern Anal. Much. Intell. PAMI 4, 6 (Nov. 1982).
	17	Michael Ian Shamos, Computational geometry., 1978
	18	SHAPIRO, L. G., AND HARALICK, R.M. Decomposition of two-dimensional shapes by graphtheoretical clustering. IEEE Trar~. Pattern Anal. Mach. Intel}. PAMI-3 (Jan, 1979), 10-20.
	19	SJBSON, R. Locally equiangular triangulation. Comput. J. 21 (1978), 243-245.
	20	WATSON, P. P. Computing the a-dimensional Delaunay triangulation with application to Voronoi polytopes. Comput. J. 24, 2 (May 1981), 167-172.
	21	WILLIAMS, J, W.J. Algorithm 232. Heapsort. Commun. ACM 7, 6 (June 1964), 347-348.
	22	ZAHN, C. T. Graph-theoretical methods for detecting and describing gestalt cluster. IEEE Trans. Compat. C-20 (Jan. 1971), 68-86.