Search for Author All Reviews
	Dobkin, David     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 5 reviews       Learning how to match fresco fragments Funkhouser T., Shin H., Toler-Franklin C., Castañeda A., Brown B., Dobkin D., Rusinkiewicz S., Weyrich T. Journal on Computing and Cultural Heritage 4(2): 1-13, 2011.  Type: Article This paper was presented at Eurographics 2011. Being among the conference’s best papers, it was revised and republished in this ACM journal. In general, the authors present their approach as new; however, while this is not th...... Mar 8 2012     Maintenance of geometric extrema ∈ Dobkin D., Suri S. Journal of the ACM 38(2): 275-298, 1991.  Type: Article Some computational geometry problems involve computing the maximum or minimum value of a bivariate function f : S × S → &RR; +, defined over a set S of geometric o...... Dec 1 1991     Contour tracing by piecewise linear approximations Dobkin D., Wilks A., Levy S., Thurston W. ACM Transactions on Graphics (TOG) 9(4): 389-423, 1990.  Type: Article The authors present the mathematics of a technique for contouring a given function, using a local technique. Given a starting point, the contour is followed by a process of localized triangulation, evaluation of the vertices, and then ...... Jun 1 1991     Partitioning space for range queries Yao F., Dobkin D., Edelsbrunner H. (ed), Paterson M. (ed) SIAM Journal on Computing 18(2): 371-384, 1989.  Type: Article This paper assumes that S is a set of n points in R3 and presents efficient solutions to such range query problems in R3 as half-plane queries, in which it is necessary to find all poin...... Jun 1 1990     Finding extremal polygons Boyce J., Dobkin D., Robert L. I., Guibas L. SIAM Journal on Computing 14(1): 134-147, 1985.  Type: Article This delightful paper examines the problem of finding maximum area or perimeter k-gons inscribed in a given convex polygon of n vertices. The authors first show that the search may be restricted to k-gons whose ver...... Nov 1 1985
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy