Search

Abstract: This paper presents an algorithm for approximating arbitrary polygonal meshes with subdivision surfaces, with the objective of preserving the relevant features of the object while searching the coarsest possible control mesh. The main idea is to firstly extract the feature lines of the object, and secondly construct the subdivision surface over this network. Control points are created by approximating these lines while the connectivity is built with respect to the anisotropy of the object. Our algorithm reinforces the similarity between the subdivision surface and the original shape by affecting an integer sharpness degree to each control edge in order to accurately reproduce the different curvature radii of corresponding fillets and blends. [Copyright &y& Elsevier]

In this paper, we present a search method with multi-class probability estimates for sketch-based 3D engineering part retrieval. The purpose of using probabilistic output from classification is to support high-quality part retrieval by motivating user relevance feedback from a ranked list of top categorical choices. Given a free-hand user sketch, we use an ensemble of classifiers to estimate the likelihood of the sketch belonging to each predefined category by exploring the strengths of various individual classifiers. Complementary shape descriptors are used to generate classifiers with probabilistic output using support vector machines (SVM). A weighted linear combination rule, called adapted minimum classification error (AMCE), is developed to concurrently minimize the classification errors and the log likelihood errors. Experiments are conducted using our Engineering Shape Benchmark database to evaluate the proposed combination rule. User studies show that users can easily identify the desired classes and then the parts under the proposed method and algorithms. Compared with the best individual classifier, the classification accuracy using AMCE increased by 7% for 3D models, and the average best rank improved by 11.6% for sketches. [Copyright &y& Elsevier]

Abstract: In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. While the conventional line drawing algorithms perform linear time computations to find the location of the pixels, our algorithm takes logarithmic time. Also, experimental results show that the quality of line is acceptable and comparable to the well-known Bresenham''s line-drawing algorithm. [Copyright &y& Elsevier]