This paper describes an optimization-based algorithm for reconstructing a 3D model from a single, inaccurate, 2D edge-vertex graph. The graph, which serves as input for the reconstruction process, is obtained from an ...
详细信息
This paper describes an optimization-based algorithm for reconstructing a 3D model from a single, inaccurate, 2D edge-vertex graph. The graph, which serves as input for the reconstruction process, is obtained from an inaccurate freehand sketch of a 3D wireframe object. Compared with traditional reconstruction methods based on line labelling, the proposed approach is more tolerant of faults in handling both inaccurate vertex positioning and sketches with missing entities. Furthermore, the proposed reconstruction method supports a wide scope of general (manifold and non-manifold) objects containing flat and cylindrical faces. Sketches of wireframe models usually include enough information to reconstruct the complete body. The optimization algorithm is discussed, and examples from a working implementation are given. Copyright (C) 1996 Elsevier Science Ltd.
The process of converting a given design into the form of a rawstock minus a series of machining features is known as machining-features extraction. One step towards automatic machining-features extraction is the extr...
详细信息
The process of converting a given design into the form of a rawstock minus a series of machining features is known as machining-features extraction. One step towards automatic machining-features extraction is the extraction of machining regions. The paper is concerned with the extraction of machining regions from the constructive-solid-geometry representation of a given object. The proposed method for the extraction of machining regions is based on manipulating the original CSG tree, representing the object, evaluating the various machining regions by using octrees, and pruning the CSG tree accordingly. If necessary, an additional stage of compacting follows. As a result, each machining region is represented by a compact CSG tree offering the following advantages. The CSG tree to be analysed is reduced in size, and thus the problem of machining-features extraction is simplified. The information is compact and concise. Moreover, no information is lost (CSG representation is kept rather than boundary representation), and the designer's intensions are conveyed to the process planner more clearly. In the special case in which the machining regions are identical to machining features, the method does offer the automatic extraction of machining features. In addition, the nesting level of the various machining regions is determined when needed.
The paper deals with design of shapes by interpolation, that is, cases where the desired shape is somehow "in between" two given shapes. The main issues involved in design by interpolation are: (a) capturing...
详细信息
The manufacturing industry constantly needs to verify machined objects against their original cad models. Given a prototype design, an engineer should be able to determine whether the part was manufactured well;that i...
详细信息
This paper describes an optimization-based algorithm for reconstructing a 3D model from a single, inaccurate, 2D edge-vertex graph. The graph, which serves as input for the reconstruction process, is obtained from an ...
详细信息
There are several open problems that are viewed as a bottleneck in the reverse engineering process: (1) The topology is unknown;therefore, point connectivity relations are undefined. (2) The fitted surface must satisf...
详细信息
This paper proposes a new adaptive parametrization method to overcome the problems of using laser scanners in Reverse engineering. The method is based on the following stages: (a) Detecting a 3D boundary of the parame...
详细信息
Conventional algorithms for tool path generation from measured points did not use the region-by-region idea to generate adaptive tool paths since it is difficult to obtain geometric information of scattered points dir...
详细信息
Conventional algorithms for tool path generation from measured points did not use the region-by-region idea to generate adaptive tool paths since it is difficult to obtain geometric information of scattered points directly, which is necessary for adaptive tool path generation. This paper presents a new strategy for determining geometric information of physical parts measured and then three-axis numerically controlled (NC) adaptive (region-based) tool paths that overcome the inherent drawback (redundant tool paths) can be directly generated from measured points. A new algorithm for computing offsets of B-spline surfaces constructed using chosen point data as control points is also proposed in the paper.
cad systems today interpolate general curves by dividing each curve into many straight-line segments which are downloaded to the CNC. Determining the number of lines to be transferred from the cad to the CNC poses a c...
详细信息
ISBN:
(纸本)0791810291
cad systems today interpolate general curves by dividing each curve into many straight-line segments which are downloaded to the CNC. Determining the number of lines to be transferred from the cad to the CNC poses a conflict between the desired precision of the part and the feedrate fidelity. The current method results in severe variations in the feedrate, leading, in turn, to variations in the surface smoothness and a substantial increase in machining time. These problems are caused by the acceleration/deceleration at the ends of each segment. Moreover, the problems are inherent in the CNC interpolator, as is thoroughly discussed in this paper. These problems can be solved by the development of curve interpolation algorithms for CNC. In this paper, a real-time interpolation algorithm for curves presented in their parametric forms is proposed and compared with the existing cad interpolators. Analysis shows that with this new interpolator, a constant feed is maintained along the cut and the machining time is as expected. In addition, the amount of geometric information transferred from the cad system to the CNC is reduced by orders of magnitude. Moreover, the contour errors caused by the new interpolator are much smaller than those caused by conventional cad interpolators.
Parameterization of 3D meshes is important for many graphics and cad applications, in particular for texture mapping, re-meshing and morphing. Current parameterization methods for closed manifold genus-n meshes usuall...
详细信息
Parameterization of 3D meshes is important for many graphics and cad applications, in particular for texture mapping, re-meshing and morphing. Current parameterization methods for closed manifold genus-n meshes usually involve cutting the mesh according to the object generators, fixing the resulting boundary and then applying the 2D position for each of the mesh vertices on a plane, such that the flattened triangles are not too distorted and do not overlap. Unfortunately, fixing the boundary distorts the resulting parameterization, especially near the boundary. A special case is that of closed manifold genus-1 meshes that have two generators. They can therefore be flattened naturally to a plane without the use of a fixed boundary while still maintaining the continuity of the parameterization. Therefore, in treating genus-1 objects, this attribute must be exploited. This paper introduces a generalized method for planar parameterization of closed manifold genus-1 meshes. As in any planar parameterization with a fixed boundary, weights are assigned over the mesh edges. The type of weights defined depends on the type of mesh characteristics to be preserved. The paper proves that the method satisfies the non-overlapping requirement for any type of positive barycentric weights, including nonsymmetrical weights. Moreover, convergence is guaranteed according to the Gauss-Seidel method. The proposed method is simple to implement, fast and robust. The feasibility of the method will be demonstrated on several complex objects.
暂无评论