Integration of Reverse Engineering and Rapid Prototyping With Data Reduction
Integration of Reverse Engineering and Rapid Prototyping With Data Reduction
Abstract
Reverse engineering is a methodology for constructing CAD models of physical
parts by digitizing an existing part, creating a computer model and then using it to
manufacture the component. When a digitized part is to be manufactured by means
of rapid prototyping machines such as stereolithography apparatus (SLA) and
selective laser sintering equipment (SLS), etc., it is not necessary to construct the
CAD model of a digitized part. This will be described by the proposed novel
method which can construct a STL file (the de facto file format for rapid
prototyping machines) directly from digitized part data. Further more, the STL file
can even be constructed in a way that significant data reduction can be achieved at
the users' discretion.
Keywords
Reverse engineering, rapid prototyping, triangulation, STL
1 INTRODUCTION
Facet orientation
The facets define the surfaces of a 3-dimensional object. As such, each facet is
part of the boundary between the interior and the exterior of the object. The
orientation of the facet is specified redundantly in two ways which must be
consistent. First, the direction of the normal is outward. Second, the vertices are
listed in counter-clockwise order when looking at the object from the outside. This
rule is illustrated in Figure 1.
Nonnal
Vertex-to-vertex
Each triangular facet must share two vertices with each of its adjacent triangles.
In other words, a vertex of one triangle cannot lie on the side of another. This rule
is illustrated in Figure 2.
There are various methods for part digitization. The presented research utilizes a
Mitutoyo BLN 122 coordinate measuring machine (CMM) to digitize a part. In
order not to miss any detail of part geometry, a large number of measurement
points are normally defined. If all points are used in STL file generation, the file
can easily becomes huge that the whole rapid prototyping process will be slowed
down significantly. In fact, keeping lots of data points in nearly planar regions is
rather unsophisticated. Removal of data points in these regions would not affect
the accuracy for rapid prototyping machines. A criterion based on normals of
neighboring triangles has been defined as to which points can be removed in
accordance with users' requirement.
Point data from CMM measurement is usually very regular and can be arranged
in matrix form. If all measurement points are to be used for STL file construction,
292
the problem becomes quite simple. In fact, the proposed method initially uses all
points to form triangles in the following simple way:
• • • • • •
• • • • • •
• • • • • •
• • • • • •
• • • • • •
(a) Data points (b) Triangulation
(2)
A n
n=- (3)
lnl
With the above information, STL file can be readily generated.
3 DATAREDUCTION
If the digitized object has large planar or near planar regions, it is desirable to
remove some of the points in these regions. In order to identify which points can
be removed, a point weighting scheme based on a point surrounding triangles'
normals is developed and described in the following:
UV1 =V1 - U
UV2=V2- U
•
•
•
uv.=v.- u (4)
(c) Transform all resulting vectors to first quadrant by taking the absolute values
of all vector components, e.g. uv2 = ai + bj + ck is transformed to uv2 = lali
+ lb~ +!elk.
(d) Sum up all the resulting vectors.
(5)
(6)
If d is small for a given point, the point stands a higher chance of being
removed. Which points are to be removed depends on users' specifications. If a
user want 100/o of the point data be removed, then points with the lowest 100/o of d
will be removed.
(7)
(8)
" n
n=- (9)
lnl
i
Patc:h nonnal diredlon
i
Patc:h nonnal diredlon
This error can be specified by the user so that the accuracy after data reduction is
still within control.
296
4 RE-TRIANGULATION
When a point is to be removed, triangles sharing this point must be removed too.
This leaves a lank region' which must be covered through re-triangulation. The
implemented re-triangulation method is described in the following:
Point to be
dlleted
The shortest
one is found
and use it to
construct one
trian&le
(c) Form a new triangle (d) The rest of triangles are formed in the same way
Figure 5 Re-triangulation.
(l) Form a point list L that are affected by the removal of a point. In figure 5(a),
if point Pis to be removed, the affected point list will beL= {Pt. P2, P3, P4,
P5, P6}.
(2) Take three consecutive points from the point list L and check whether the
triangle formed by the three points is inside or outside the region formed by
L. If not. take another three consecutive points and check again.
(3) Calculate the length of the line formed by the first and the last point of the
three points as shown in Figure 5(b) in dashed lines.
(4) Repeat (2) and (3) until all combinations of consecutive three points have
been exhausted.
(5) Find the shortest length and use the corresponding three points to form a real
triangle as shown in Figure 5(c). Calculate the normal of the newly formed
triangle and delete the middle point of the three points from L have Lt.
(6) Repeat from (2) with point list L until no more than four points left in Lt.
Integration of reverse engineering 297
Figure 5(d) shows are-triangulated region after a point is removed. Point removal
and re-triangulation will go on iteratively until certain criteria are met. Two
criteria are given for users' specification. One is the percentage of points to be
removed and the other is the bounded error caused by points removal.
5 EXPERIMENTAL RESULTS
With the implemented method, a number of examples have been tested. One of
the example is a human face. It was digitized using a Mitutoyo BLN 122
coordinate measuring machine as shown in Figure 6. As some parts of the human
face has very low curvature change, some data points can be removed. In the
experiment, data reduction for 20%, 50% and 80% have been specified for
prototype fabrication. Figure 7 shows the STL file after 50% of data reduction. It
can be seen that regions with small curvature changes have large data reduction.
This is exactly what is desired.
6 CONCLUSION
This paper has presented a novel method for STL file construction directly from
CMM measurement data. When desired. the user can specify either the percentage
of points to be removed or the bounded error caused by points removal in order to
speed up computation and to reduce storage space. Several prototypes with
different amounts of data reduction have been built using an SLS equipment
which shows satisfactory results.
Integration of reverse engineering 299
7 ACKNOWLEDGEMENT
This research is carried out with a CRCG grant (code:337/064/0023) from the
University of Hong Kong.
8 REFERENCES
9 BIOGRAPH