The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes an efficient shape reconstruction method from sectional data in 3-axis Numerical Control (NC) machining. A merge-divide algorithm is proposed to construct triangle meshes for machined surfaces with arbitrary shape and genus. The algorithm is of linear complexity due to the special property of the NC data. The method is used to interference detection and space cutter compensation...
We introduce principal-channels for cutting out objects from an image by one-sided scribbles. We demonstrate that few scribbles, all from within the object of interest, are sufficient to mark it out. One-sided scribbles provide significantly less information than two-sided ones. Thus, it is required to maximize the use of image-information. Our approach is to first analyze the image with a large filter...
This paper presents a method to solve the problem of common design structure discovery from a large number of CAD models. First, a CAD model is transformed into a face adjacency graph (FAG) and each node of FAG is mapped to a point in two-dimensional plane after representing face shape information with two coordinates. So the shapes of models are directly compared through the point coordinates of...
In this paper we propose a new type of splines -biquadratic submesh splines over hierarchical T-meshes. The biquadratic submesh splines are in rational form consisting of some biquadratic B-splines defined over tensor-product submeshes of a hierarchical T-mesh, where every submesh is around a cell in the crossing-vertex relationship graph of the T-mesh. We provide an effective algorithm to locate...
This paper presents a reconstruction pipeline for recovering branching structure of trees from laser scanned data points. The process is made up of two main blocks: segmentation and reconstruction. Based on a variational k-means clustering algorithm, cylindrical components and ramified regions of data points are identified and located. An adjacency graph is then built from neighborhood information...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.