This invention relates to manufacturing methods and systems that utilize computer-aided-design (CAD) and computer-aided manufacturing (CAM) techniques and, more particularly, to manufacturing methods and systems for production of custom medical devices.
Techniques for designing and manufacturing in-ear hearing-aid devices typically need to be highly customized in both internal dimensions to support personalized electrical components to remedy a individual's particular hearing loss need, and in external dimensions to fit comfortably and securely within an ear canal of the individual. Moreover, cosmetic considerations also frequently drive designers to smaller and smaller external dimensions while considerations of efficacy in hearing improvement typically constrain designers to certain minimal internal dimensions notwithstanding continued miniaturization of the electrical components.
As illustrated by Block 20, a vent structure may then be attached (e.g., glued) to an inner surface of the plastic hearing-aid shell. Manual trimming and surface smoothing operations may then be performed, Block 22, so that the shell is ready to receive a faceplate. The faceplate may then be attached to a flat surface of the shell and then additional trimming and smoothing operations may be performed to remove abrupt edges and excess material, Block 24. The electrical components may then be added to the shell, Block 26, and the shape of the resulting shell may be tested using the negative mold, Block 28. A failure of this test typically cause the manufacturing process to restart at the step of generating a detailed positive mold, Block 14. However, if the manufactured shell passes initial quality assurance, then the shell with electrical components may be shipped to the customer, Block 30. Steps to fit and functionally test the received hearing-aid shell may then be performed by the customer's audiologist. A failure at this stage typically requires the repeat performance of the process flow 10 and the additional costs and time delay associated therewith.
Unfortunately, these conventional techniques for designing and manufacturing customized in-ear hearing-aid devices typically involve a large number of manual operations and have a large number of drawbacks. First, manual hearing-aid shell creation through sculpting is error prone and considered a main contributor in a relatively high customer rejection rate of 20 to 30%. Second, the typically large number of manual operations that are required by conventional techniques frequently act as a bottleneck to higher throughput and often limit efforts to reduce per unit manufacturing costs. Accordingly, there exists a need for more cost effective manufacturing operations that have higher throughput capability and can achieve higher levels of quality assurance.
Methods, apparatus and computer program products of the present invention provide efficient techniques for designing and printing shells of hearing-aid devices with a high degree of quality assurance and reliability and with a reduced number of manual and time consuming production steps and operations. These techniques also preferably provide hearing-aid shells having internal volumes that can approach a maximum allowable ratio of internal volume relative to external volume. These high internal volumes facilitate the inclusion of hearing-aid electrical components having higher degrees of functionality and/or the use of smaller and less conspicuous hearing-aid shells.
A first preferred embodiment of the present invention includes operations to generate a watertight digital model of a hearing-aid shell by thickening a three-dimensional digital model of a shell surface in a manner that preferably eliminates self-intersections and results in a thickened model having an internal volume that is a high percentage of an external volume of the model. This thickening operation preferably includes nonuniformly thickening the digital model of a shell surface about a directed path that identifies a location of an undersurface hearing-aid vent. This directed path may be drawn on the shell surface by a technician (e.g., audiologist) or computer-aided design operator, for example. Operations are then preferably performed to generate a digital model of an undersurface hearing-aid vent in the thickened model of the shell surface, at a location proximate the directed path.
A second embodiment of the present invention includes operations to generate a first digital representation of a positive or negative image of at least a portion of an ear canal of a subject. The first digital representation is a representation selected from the group consisting of a point cloud representation, a 2-manifold triangulation, a 2-manifold with nonzero boundary triangulation and a volume triangulation. A second digital representation of a hearing-aid shell is then generated having a shape which conforms to the ear canal of the subject. This second digital representation may be derived directly or indirectly from at least a portion of the first digital representation. Operations are then performed to print a hearing-aid shell that conforms to the ear canal of the subject, based on the second digital representation. Templates may also be used to facilitate generation of the second digital representation. In particular, the operation to generate the second digital representation may comprise modifying a shape of the first digital representation to more closely conform to a shape of a digital template of a hearing-aid shell and/or modifying the shape of the digital template to more closely conform to the shape of the first digital representation. This digital template is preferably a surface triangulation that constitutes a 2-manifold with nonzero boundary. However, the digital template may be a three-dimensional model of a generic hearing-aid shell having a uniform or nonuniform thickness, and possibly even a vent.
The operation to generate a second digital representation may include operations to generate a three-dimensional model of a hearing-aid shell surface that is a 2-manifold or 2-manifold with nonzero boundary and then thicken the three-dimensional model of the hearing-aid shell surface using operations that move each of a plurality of vertices on the shell surface along a respective path that is normal to an inner shell surface. This thickening operation preferably includes an operation to nonuniformly thicken the three-dimensional model of the hearing-aid shell surface about a directed path thereon. A uniform thickening operation may then be performed along with an operation to generate an undersurface hearing-aid vent in the thickened model of the shell surface, at a location proximate the directed path. A combination of a local nonuniform thickening operation to enable vent formation followed by a global uniform thickening operation to define a desired shell thickness enables the formation of a custom hearing-aid shell having a relatively large ratio of interior volume to exterior volume and the printing of shells with built-in vents.
An additional embodiment of the present invention provides an efficient method of performing quality assurance by enabling a comparison between a digital model of a hearing-aid shell and a digital model of a printed and scanned hearing-aid shell. In particular, operations may be performed to generate a first three-dimensional digital model of a hearing-aid shell and then print a hearing-aid shell based on the first three-dimensional digital model. Point cloud data is then generated by scanning the printed hearing-aid shell. From this point cloud data, a second three-dimensional digital model of a hearing-aid shell surface is generated. To evaluate the accuracy of the printing process, the second three-dimensional digital model of a hearing-aid shell surface is digitally compared against the first three-dimensional digital model of a hearing-aid shell to detect differences therebetween. This second three-dimensional digital model may also be compared against earlier digital representations of the shell to verify various stages of the manufacturing process.
The present invention now will be described more fully hereinafter with reference to the accompanying drawings, in which preferred embodiments of the invention are shown. This invention may, however, be embodied in many different forms and applied to other articles and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. The operations of the present invention, as described more fully hereinbelow and in the accompanying figures, may be performed by an entirely hardware embodiment or, more preferably, an embodiment combining both software and hardware aspects and some degree of user input. Furthermore, aspects of the present invention may take the form of a computer program product on a computer-readable storage medium having computer-readable program code embodied in the medium. Any suitable computer-readable medium may be utilized including hard disks, CD-ROMs or other optical or magnetic storage devices. Like numbers refer to like elements throughout.
Various aspects of the present invention are illustrated in detail in the following figures, including flowchart illustrations. It will be understood that each of a plurality of blocks of the flowchart illustrations, and combinations of blocks in the flowchart illustrations, can be implemented by computer program instructions. These computer program instructions may be provided to a processor or other programmable data processing apparatus to produce a machine, such that the instructions which execute on the processor or other programmable data processing apparatus create means for implementing the functions specified in the flowchart block or blocks. These computer program instructions may also be stored in a computer-readable memory that can direct a processor or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the functions specified in the flowchart block or blocks.
Accordingly, blocks of the flowchart illustrations support combinations of means for performing the specified functions, combinations of steps for performing the specified functions and program instruction means for performing the specified functions. It will also be understood that each of a plurality of blocks of the flowchart illustrations, and combinations of blocks in the flowchart illustrations, can be implemented by special purpose hardware-based computer systems which perform the specified functions or steps, or by combinations of special purpose hardware and computer instructions.
Referring now to
As illustrated by Block 200, preferred operations are then performed to generate a three-dimensional digital model of a hearing-aid shell with vent, from the scan data. A cross-sectional view of an exemplary hearing-aid shell is illustrated by
As described more fully hereinbelow with respect to
Referring now to
Referring now to Block 216 of
As illustrated by Block 216B of
Referring again to
Referring again to Block 220, the operations to nonuniformly thicken the digital model of the hearing-aid shell surface further include thickening the digital model using a bump function b(x) about a kernel K defined by a set of points on the directed path P, as described more fully hereinbelow. This bump function may be derived form a Gaussian distribution function or a spline function, however, other functions may also be used. An operation to determine a first offset of the directed path P′ normal to the shell surface is then performed along with an operation to determine a respective normalized adjusted normal nx′ for each of a plurality of vertices on the directed path P using parametrizations P,P′: [0,1]→R3 proportional to a distance between the directed path P and the first offset of the directed path P′. Here, the operation to determine a respective normalized adjusted normal nx′ preferably includes determining a respective normalized adjusted normal nx′ for each of a plurality of first vertices on the digital model of the shell surface that are within a support of the bump function b(x). This is achieved by mixing an estimated normal at the respective first vertex nx with the normalized adjusted normal np′ at a nearest vertex on the directed path P. Preferred techniques for defining a directed path P may result in a directed path that is defined by at least one vertex that is not also a vertex of the digital model of the shell surface. Once a plurality of normalized adjusted normals have been determined, operations may be performed to locally thicken the digital model of the shell surface by moving a first vertex on the shell surface inward along a respective normalized adjusted normal extending from the first vertex nx′. The distance the first vertex is moved is preferably defined by the bump function b(x). Global thickening operations may also be performed, preferably after the nonuniformly thickening operations and after the normals have been readjusted. As described more fully hereinbelow, these operations may include offsetting the inner surface of the shell model by the shell thickness s, by moving vertices on the inner surface along respective normalized re-adjusted normals.
Referring now to Blocks 240 and 250 of
As illustrated by Block 250 and described more fully hereinbelow with respect to
Referring now to Block 260, operations to modify the three-dimensional model of a hearing-aid shell may be performed so that what is typically a flat rim of the shell model is more suitable for receiving a supporting frame when printed. As will be understood by those familiar with conventional hearing-aid manufacturing methods, a supporting frame with a hatch cover hinged thereto is typically attached to a printed hearing-aid shell only after a faceplate has been glued to the shell and the faceplate (and shell) have been trimmed and smoothed. The faceplate also has an opening therein in which the supporting frame can be received and permanently or releasably connected.
The preferred operations illustrated by Block 260 include partially or completely automated CAD operations to either digitally modify the shape of the hearing-aid shell to be matingly compatible with a supporting frame when printed, or to digitally merge a generic faceplate model to the rim of the shell and then digitally trim away excess portions and smooth abrupt edges. In particular, these operations may enable a CAD tool operator to visually align a supporting frame to a rim of a displayed digital model of the hearing-aid shell and then mark or identify vertices and/or edges on the frame and shell model to be modified. Operations can then be performed automatically by the CAD tool to fill in the shape of the shell model so that the final shape of the rim is matingly compatible with the supporting frame. Alternatively, the operations of Block 260 may include attaching a digital faceplate model to the rim of the shell model either automatically or after alignment by the CAD tool operator. Automated digital trimming and smoothing operations are then typically performed to generate a final hearing-aid shell model that can be printed, Block 300. The printing operation may be performed using a three-dimensional printer that is communicatively coupled and responsive to commands issued by the CAD tool. In this manner, the manual and time consuming operations illustrated by Blocks 22 and 24 of
Referring now to
This workstation 40, which may be used as part of an automated hearing-aid shell manufacturing system, preferably comprises a computer-readable storage medium having computer-readable program code embodied in the medium. This computer-readable program code is readable by one or more processors within the workstation 40 and tangibly embodies a program of instructions executable by the processor to perform the operations described herein and illustrated by the accompanying figures, including
Among other things, the computer-readable program includes code that generates a first digital model of a hearing-aid shell (e.g., completely-in-canal (CIC) model) from point cloud data and also performs calculations of the interior volume of the first digital model to determine whether preselected hearing-aid components can fit properly within the interior volume of the first digital model. In the event a proper fit is not detected, the code can also generate a second digital model of a hearing-aid shell that is larger than the first digital model and calculates an interior volume thereof. This second digital model may also be generated from the point cloud data and may constitute a somewhat larger in-the-ear (ITE) model. The code then determines whether the preselected hearing-aid components can fit properly within an interior volume of the second digital model of the hearing-aid shell. If necessary, these operations may be repeated for gradually larger models until a fit is detected. Accordingly, the workstation 40 can perform operations to determine in advance of printing whether a particular model of a hearing-aid shell (e.g., nonuniformly thickened model with vent) will be large enough to support the selected components. The size specifications associated with these internal hearing-aid components may be loaded into the workstation 40 from an internet site or electronic file, for example.
In the foregoing sections, a thorough and complete description of preferred embodiments of the present invention have been provided which would enable one of ordinary skill in the art to make and use the same. Although unnecessary, a detailed mathematical treatment of the above-described operations will now be provided.
Construct Bump Functions
In this section, a generic bump function is constructed from the Gaussian normal distribution function used in probability theory. The bump function can be used to control local thickening as well as local averaging of normal vectors.
Ur bump function. The Gaussian normal distribution with expectation μ=0 and standard deviation σ is given by the function
About 68% of all values drawn from the distribution lie between −σ and σ and more than 99% lie between −3σ and 3σ. We define the ur bump function
g(t)=max{C1e−C
by choosing C1, C2, C3 such that
The resulting function is illustrated in
C
3
=e
−4.5
·C
1=0.0112
Two-dimensional bumps. In a preferred application, a bump function is constructed around a kernel K, which can be a single point or a set of points. The bump function reaches its maximum at all points in the kernel and decreases with the distance from the kernel,
b(x)=a·g(3dK(x)/c),
where dK(x) is the minimum distance from x to a point of K. We call a the amplitude and c the width of b. The support is the set of points x with non-zero b(x).
n′x=(1−b(x))·nx+b(x)·np,
where nx and np are the old unit normals at x and p.
Overlay of bumps. Suppose we have a number of bump functions bi, each with its own kernel Ki, amplitude ai, and width ci, as shown in
where the two sums and the product range over all indices i. The first term in the expression is the weighted average of the amplitudes, and the second blends between the various bumps involved. If all amplitudes are the same, then the weighted average is again the same and b(x) majorizes all bi(x), that is, b(x)≧bi(x) for all x and all i.
Perform Non-Uniform Thickening
The 2-manifold with boundary, M, is preferably thickened in two steps. First, a neighborhood of a path sketching the location of the vent is thickened towards the inside. Second, the entire model is thickened uniformly towards the inside. Both steps can be performed to leave the outer boundary of the shell unchanged. We begin by sketching the underground location of the vent as a directed path on the 2-manifold with boundary.
Sketching the vent. The vent will be constructed as a tube of radius r>0 around its axis. We sketch the location of the axis by drawing a path P directed from its initial point αεBd M to its terminal point ωεM−Bd M. Both points are typically specified by the software user, and the path is automatically constructed as part of a silhouette. Let Tα and Tω be the tangent planes at α and ω, and let L=Tα∩Tω be their common line. The view of M in the direction of L has both α and ω on the silhouette. We compute P as the part of the silhouette that leads from α to ω, as shown in
There are a few caveats to the construction of P that deserve to be mentioned. First, the silhouette itself is not necessarily a connected curve. Even small errors in the approximation of a smooth surface will cause the silhouette to consist of possibly many mutually disjoint curves, and such errors are inevitable in any piecewise linear approximation. Second, even if the silhouette were connected, it might wind back and forth if viewed from a normal direction. We solve both difficulties by sampling the silhouette and then constructing a spline curve that approximates but does not necessarily interpolate the sampled point sequence. For the sampling we use some constant number of parallel planes between α and ω, as shown in
Thickening process. The path P is used in the first thickening step that creates the volume necessary to rout the vent through the hearing-aid shell. A second thickening step is then performed that uniformly affects the entire model. The biggest challenge in thickening is to avoid or repair surface self-intersections. We decompose the thickening process into five steps, three of which are concerned with avoiding or removing self-intersections.
Step 1.1: Adjust normals. To prepare for Step 1.2, we offset P normal to M towards the inside of the model. This is done by moving each vertex of P a distance 2r+2w−s along its estimated normal, where 0<w≦s are the user-specified wall and shell thicknesses. As illustrated in
We use parametrizations P, P′: [0,1]→R3 proportional to path-length in adjusting normal vectors. For a vertex p=P(λ) we call
the normalized adjusted normal at p. We use this name even though n′p has only approximately unit length and is only approximately normal to M.
For a vertex xεM we compute n′x by mixing the estimated normal at x with the normalized adjusted normal at the nearest point pεP. The estimated normal at x is nx=l·(Σψi·ni), where the sum ranges over all triangles in the star of x, ψi is the i-th angle around x, and ni is the inward normal of the i-th triangle. The length of nx is chosen such that moving x to x+nx produces an offset of roughly unit thickness along the neighboring triangles. This is achieved by setting
where φi is the angle between nx and the plane of the i-th triangle. To mix nx with n′p we use the bump function b with kernel P, amplitude a=1, and width c=3r. In other words, we let t=∥x−p∥/r and define the normalized adjusted normal at x as
n′x=(1−g(t))·nx+g(t)·n′p.
Recall that g(t)=0 if |t|≧3. This implies that n′x=nx if ∥x−p∥≧3r.
Step 1.2: Thicken M around P. The first thickening step used the bump function b with kernel P, amplitude a=2r+2w−s, and width c=3r. It has the same support as the bump function for adjusting normals but possibly different amplitude. We thus thicken by moving x along b(x) n′x, where b(x)=a·g(t) with t=∥x−p∥/r, as before. The result is a bump in the neighborhood of distance up to 3r from P. At distance 3r or more, we do thickening only topologically. This means we create a copy of M there also, but with zero offset from M. Similarly, we construct a partially zero width rim, as shown in
Step 1.3: Re-adjust normals. We change the normal vectors again, this time to prepare for the global thickening operation in Step 1.4. The goal is to eliminate normal fluctuations due to local features of roughly size s, which is the amount of thickening done in Step 1.4. First we detect such features by taking cross-sections of N1 in three pairwise orthogonal directions. For each directions we take a sequence of parallel planes at distance s apart, and we intersect each plane with N1. The result is a polygon in that plane, and we sample points pj at arc-length distance s along the polygon. For each pj we let nj be the normal vector of the polygon at pj. We mark pj if
The two criteria detect small features of the type shown in
Finally, we use a bump function bj for each marked point pj to locally re-adjust normal vectors. The amplitude of bj is aj=1 and the width is cj=3s. Let b be the total bump function majorizing the bj. The normalized re-adjusted normal of x is then
Step 1.4: Thicken globally. The second thickening step offsets N1 by the shell thickness s uniformly everywhere. The result is a new inner surface N and a new rim R with positive width all around, as illustrated in
Step 1.5: Repair surface self-intersections. In the last step we use relaxation to smooth the new inner surface, and at the same time to repair self-intersections, if any. We first relax the boundary of the inner surface, Bd N, which is a closed curve. Troubles arise either when the curve has self-intersections, as in
We second relax the rest of the inner surface N, while keeping Bd N fixed. The relaxation moves each vertex x along its relaxation vector rx computed from the neighbor vertices of x in N. A conventional relaxation operator is described in an article by G. Taubin, A signal processing approach to fair surface design, Comput. Graphics, Proc. SIGGRAPH 1995, 351–358. The motion defined by rx usually keeps x close to the surface, but in rare cases, rx can have a significant normal component, as shown in
Formally, the relaxation vector is adjusted as follows.
The relaxation is then performed using the adjusted vectors.
Creation of Vent in Thickened Model
The thickening operation creates the volume through which we can rout the vent. The basic idea for routing includes: first, offset P to construct the axis and, second, sweep a circle of radius r normally along the axis to construct the vent. The execution of these steps can be complex and frequently requires design iterations.
Vent axis. For the most part, the axis U lies at a fixed distance ratio between P and P′. We therefore start the construction by defining
for all 0≦λ≦1. This approximation of the axis is acceptable except near the end where P″(1) does not reach the required terminal point, ω. We thus construct the axis by sampling P″ for 0≦λ≦¾, append ω to the sequence, and construct U as a spline curve that approximates the point sequence and goes from α″=P″(0) to ω. The result of this operation is illustrated in
Tube construction. The vent is constructed by subtracting the tube of radius r around U from the volume created by thickening. The algorithm iteratively improves the initial design by moving and adjusting the vertices that define the axis and the boundary of the tube. The algorithm proceeds in six steps.
Step 2.1: Normal circles. Assume a parametrization U: [0,1]→R3 proportional to path-length, similar to those of P and P′. We sample k+1 points from U by selecting
for all 0≦i≦k, where k is described below.
Write zi for the unit tangent vector at point
For each point ui, we let Gi be the plane passing through ui normal to zi, and we construct the circle Ci of radius r around ui in Gi.
Constructing Ci means selecting some constant number l of points equally spaced along the circle, and connecting these points by edges to form a closed polygon. We use an orthonormal coordinate frame xi, yi in Gi and choose the first point on Ci in the direction xi from ui. Step 2.5 will connect the polygonal approximations of the cross-sections into a triangulated surface. To facilitate this operation, we choose the coordinate frames in a consistent manner as follows. Choose x0 as the normalized projection onto G0 of the estimated normal nα of αεM. The other vectors xi are obtained by propagation:
Experiments indicate that l=20 is an appropriate choice for the number of points around a cross-section. The resulting edge-length is then just slightly less than
We choose k such that the distance between two adjacent cross-sections is about twice this length: k=┌|U|l/4πr┐, where |U| is the length of U. The distance between two adjacent planes is then roughly
Step 2.2: Limiting curves. The initial and terminal curves are the intersections between the tube boundary and the shell boundary around the initial point α′ and the terminal point ω. We construct the initial curve from C0 and the terminal curve from Ck. The latter construction is described first.
Let Hk=Tω, be the plane tangent to M at point ω. We project Ck parallel to zk onto Hk, as shown in
The algorithm for the initial curve is similar, leading to the construction of a plane H0, an ellipse E0 in H0, and the initial curve by normal projection of E0 onto S. By construction, the neighborhood of α″ in S is contained in the tangent plane, and thus the normal projection just transfers the points of E0 to the representation within S, without changing their positions in space.
Step 2.3: Planes. The circles Ci may interfere with the initial or terminal curves and they may interfere with each other. Such interferences cause trouble in the construction of the vent surface and are avoided by tilting the planes defining the cross-sections. In other words, we construct a new sequence of planes Hi passing through the ui in an effort to get
Objective (i) overwrites (ii). The boundary conditions are defined by the fixed tangent planes H0 and Hk, which cannot be changed. The sequence of planes is constructed in two scans over the initial sequence defined by H0, Hi=Gi for 1≦i≦k−1, and Hk.
Here, E′i is defined similar to Ei, except that it is obtained by projecting the somewhat larger circle Ci′⊂Gi with center ui and radius r+w. This larger ellipse includes the necessary buffer around the tube and is therefore more appropriate than Ei in interference and intersection tests. The boolean function
If there is an interference, function T
Step 2.4: Intersections. It is quite possible that the ellipses constructed in Step 2.3 intersect the shell boundary, S. If this happens, we move their centers ui and thus modify the axis of the vent. If moving the ui is not sufficient to eliminate all intersections, we thicken the shell by moving the inner surface further inwards. We write the algorithm as three nested loops.
We experimentally determined #1=3 and #2=10 as appropriate number of times to repeat the two loops. In most of the cases we thicken S once, and reach an acceptable design after the second iteration.
When we test whether or not E′i∩S=∅, we compute the cross-section of S along Hi, which is a polygon Si. It is convenient to transform the ellipse back to the circle C′i. The same transformation maps Si to a new polygon S′i. We have an intersection iff S′i contains a point whose distance from ui is less than the radius of C′i, which is r+w. This point can either be a vertex of S′i or lie on an edge of S′i. We compute the point xiεS′i closest to ui, and we report an intersection if ∥xi−ui∥<r+w. In case of an intersection, we move ui away from xi:
The new point ui is then projected back to the plane Gi, in order to prevent that the movement of sampled points is unduly influenced by the direction of the planes Hi. After moving the points ui we relax the axis they define in order to prevent the introduction of high curvature pieces along U. Then the loop is repeated. We experimentally determined that #2=10 iterations of the loop suffice, and if they do not suffice then the situation is so tight that even further iterations are unlikely to find a solution. We then thicken the shell towards the inside and repeat the outermost loop.
Next we describe how the thickening of the shell is accomplished. We represent each non-empty intersection E′i∩N by a bump function bi whose kernel is a point piεN. The amplitude measures the amount of thickening necessary to eliminate the intersection. We use roughly elliptic supports with vertical width 4s and horizontal width a little larger than necessary to cover the intersection. The general situation, where there are several and possibly overlapping supports, is illustrated in
Step 2.5: Vent surface. Recall that the points defining the ellipses are given in angular orders, and the respective first points are roughly aligned. The points and edges of the ellipses can therefore be connected in straightforward cyclic scans around the cross-sections. The result is a triangulation V representing the boundary of the tube or vent, as illustrated in
Step 2.6: Connection. To connect the boundary V of the vent with the boundary surface S of the shell, we subdivide S along the initial and terminal curves of V. The two curves bound two disks, which we remove from S. Then S and V are joined at shared curves. The subdivision is likely to create some small or badly shaped triangles, which can be removed by edge contractions triggered by a local application of a surface simplification algorithm.
Construction of Receiver Hole
The receiver hole is a short tunnel that passes through the volume of the shell right next to the end of the vent, as shown in
The construction of the receiver hole may borrow a few steps of the vent creation algorithm described above. First, the initial and terminal curves of the receiver hole are constructed from a circle normal to the axis, as explained in Steps 2.1 and 2.2. Second, the hole boundary is obtained by connecting the two curves, as explained in Step 2.5. Third, the hole boundary is connected to the shell boundary by subdividing S along the two curves, removing the two disks, and joining the two surfaces along their shared curves, as explained in Step 2.6.
In the drawings and specification, there have been disclosed typical preferred embodiments of the invention and, although specific terms are employed, they are used in a generic and descriptive sense only and not for purposes of limitation, the scope of the invention being set forth in the following claims.
Number | Name | Date | Kind |
---|---|---|---|
4569812 | Werwath et al. | Feb 1986 | A |
4652414 | Schlaegel | Mar 1987 | A |
4719585 | Cline et al. | Jan 1988 | A |
4870688 | Voroba et al. | Sep 1989 | A |
5056204 | Bartschi | Oct 1991 | A |
5084224 | Watters | Jan 1992 | A |
5121333 | Riley et al. | Jun 1992 | A |
5357576 | Arndt | Oct 1994 | A |
5398193 | deAngelis | Mar 1995 | A |
5487012 | Topholm et al. | Jan 1996 | A |
5587913 | Abrams et al. | Dec 1996 | A |
5600060 | Grant | Feb 1997 | A |
5617322 | Yokota | Apr 1997 | A |
5621648 | Crump | Apr 1997 | A |
5760783 | Migdal et al. | Jun 1998 | A |
5850229 | Edelsbrunner et al. | Dec 1998 | A |
5866058 | Batchelder et al. | Feb 1999 | A |
5875254 | Hanright | Feb 1999 | A |
5886702 | Migdal et al. | Mar 1999 | A |
5889874 | Schmitt et al. | Mar 1999 | A |
5915031 | Hanright | Jun 1999 | A |
5939008 | Comb et al. | Aug 1999 | A |
5948342 | Nakazawa et al. | Sep 1999 | A |
5968561 | Batchelder et al. | Oct 1999 | A |
5995650 | Migdal et al. | Nov 1999 | A |
6022311 | Juneau et al. | Feb 2000 | A |
6044170 | Migdal et al. | Mar 2000 | A |
6069963 | Martin et al. | May 2000 | A |
6100893 | Ensz et al. | Aug 2000 | A |
6103156 | Holtzberg | Aug 2000 | A |
6108006 | Hoppe | Aug 2000 | A |
6110409 | Allanic et al. | Aug 2000 | A |
6133921 | Turkiyyah et al. | Oct 2000 | A |
6167138 | Shennib | Dec 2000 | A |
6176427 | Antognini et al. | Jan 2001 | B1 |
6205243 | Migdal et al. | Mar 2001 | B1 |
6208347 | Migdal et al. | Mar 2001 | B1 |
6256038 | Krishnamurthy | Jul 2001 | B1 |
6256039 | Krishnamurthy | Jul 2001 | B1 |
6271856 | Krishnamurthy | Aug 2001 | B1 |
6285372 | Cowsar et al. | Sep 2001 | B1 |
6374198 | Schifa | Apr 2002 | B1 |
6377865 | Edelsbrunner et al. | Apr 2002 | B1 |
6401859 | Widmer et al. | Jun 2002 | B1 |
6420698 | Dimsdale | Jul 2002 | B1 |
6484842 | Widmer et al. | Nov 2002 | B1 |
6496587 | Mueller | Dec 2002 | B1 |
6512993 | Kacyra | Jan 2003 | B1 |
6532299 | Sachdeva | Mar 2003 | B1 |
6545676 | Ryan | Apr 2003 | B1 |
20020006217 | Rubbert | Jan 2002 | A1 |
20020059042 | Kacyra | May 2002 | A1 |
20020114537 | Sutula, Jr. | Aug 2002 | A1 |
20020136420 | Topholm | Sep 2002 | A1 |
20020138237 | Topholm | Sep 2002 | A1 |
20020145607 | Dimsdale | Oct 2002 | A1 |
20020158880 | Williams | Oct 2002 | A1 |
20020176584 | Kates | Nov 2002 | A1 |
20020196954 | Marxen et al. | Dec 2002 | A1 |
20020198437 | Juneau et al. | Dec 2002 | A1 |
20030001835 | Dimsdale | Jan 2003 | A1 |
20030021434 | Hessel et al. | Jan 2003 | A1 |
20030034976 | Raskar | Feb 2003 | A1 |
20030058242 | Redlich | Mar 2003 | A1 |
20030067461 | Fletcher et al. | Apr 2003 | A1 |
20030071194 | Mueller | Apr 2003 | A1 |
20030072011 | Shirley | Apr 2003 | A1 |
20030074174 | Fu et al. | Apr 2003 | A1 |
Number | Date | Country |
---|---|---|
62-032800 | Feb 1987 | JP |
09-10300 | Apr 1997 | JP |
091030000 | Apr 1997 | JP |
11055796 | Feb 1999 | JP |
WO 8504779 | Oct 1985 | WO |
WO 9203894 | Mar 1992 | WO |
WO 9211737 | Jul 1992 | WO |
WO9211737 | Jul 1992 | WO |
WO 0008895 | Feb 2000 | WO |
WO 0019769 | Apr 2000 | WO |
WO 0019935 | Apr 2000 | WO |
WO 0034739 | Jun 2000 | WO |
WO 0036564 | Jun 2000 | WO |
WO 0070911 | Nov 2000 | WO |
WO 0076268 | Dec 2000 | WO |
WO 0105207 | Jan 2001 | WO |
WO0152737 | Jan 2001 | WO |
WO01087001 | Jul 2001 | WO |
WO01087001 | Jul 2001 | WO |
WO02071794 | Sep 2002 | WO |
WO03027961 | Apr 2003 | WO |