WO2003073335A1 - Procede et programme de conversion de donnees frontieres en forme a l'interieur d'une cellule - Google Patents
Procede et programme de conversion de donnees frontieres en forme a l'interieur d'une cellule Download PDFInfo
- Publication number
- WO2003073335A1 WO2003073335A1 PCT/JP2003/002197 JP0302197W WO03073335A1 WO 2003073335 A1 WO2003073335 A1 WO 2003073335A1 JP 0302197 W JP0302197 W JP 0302197W WO 03073335 A1 WO03073335 A1 WO 03073335A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- cell
- data
- boundary
- cutting
- patterns
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
- G06F30/23—Design optimisation, verification or simulation using finite element methods [FEM] or finite difference methods [FDM]
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B33—ADDITIVE MANUFACTURING TECHNOLOGY
- B33Y—ADDITIVE MANUFACTURING, i.e. MANUFACTURING OF THREE-DIMENSIONAL [3-D] OBJECTS BY ADDITIVE DEPOSITION, ADDITIVE AGGLOMERATION OR ADDITIVE LAYERING, e.g. BY 3-D PRINTING, STEREOLITHOGRAPHY OR SELECTIVE LASER SINTERING
- B33Y50/00—Data acquisition or data processing for additive manufacturing
Definitions
- the present invention relates to a method of storing entity data that integrates shape and physical properties with a small storage capacity, and a method of storing entity data that can unify CAD and simulation. More specifically, a method for converting boundary data into in-cell shape data And a conversion program. Description of related technology
- CAD Computer Aided Engineering
- CAM Computer Aided Manufacturing
- CAE Computer Aided Engineering
- CAT Computer Aided Engineering
- the data of the target object is stored as CSG (CoiisstrructtieveSolidGeometry) or B-rep (BoundaRyR ePre se s e n t io n).
- external data consisting of boundary data of an object is divided into cubic cells whose boundary planes are orthogonal by octree division, and each of the divided cells is defined as a boundary. It is divided into a non-boundary cell 13a that does not include a surface and a boundary cell 13b that includes a boundary surface. In this figure, 15 is a cutting point.
- various physical property values can be stored for each cell, and physical data obtained by integrating the shape and physical properties can be stored with a small storage capacity, whereby the object shape-structure-physical property information history
- the data related to a series of processes, from design to processing, assembly, testing, and evaluation, can be managed with the same data, and CAD and simulation can be unified.
- V-CAD is a cell of voeldataset. With a border inside.
- the conventional CAD is a solid, but it is actually a solid lining like B-rep.
- V-CAD is packed to the inside and can hold physical quantities.
- V-CAD aims to be a data base that can be used directly for simulation and processing, beyond the scope of a mere tool for expressing shapes.
- simulation technology and processing technology that effectively utilize V-CAD must also be developed.
- only surface shape data has been used exclusively for machining, so machining technologies that can truly utilize volume data are almost all except stereolithography and rapid prototyping (3D ink jet). It can be said that it does not exist.
- MC MarchingCubes
- Fig. 2a to Fig. 2d show all cutting point patterns and boundary lines of the two-dimensional MC
- Figs. 3a to 3n show all cutting point patterns of the three-dimensional MC. (Omitted)
- FIGS. 4A to 4C are examples of diagrams showing the difference between the cut points in the rectangular cells of MC and KittaCubes (KTC).
- KT C this is approximated as shown in Fig. 4f.
- MC it is approximated as shown in Fig. 4g.
- Figures 4c and 4f are two-dimensional examples. In three dimensions, many more cases can be represented only by KT C. KT C at the same resolution is much more expressive than MC.
- FIGS. 5a and 5b are views showing the difference between the cutting points of the ridges of the conventional MC and the KTC of the present invention. Also in MC construction, the number of cutting points is limited to 0 or 1 on one ridge. As shown in Fig. 5a, in MC, the sign at both ends of each cell edge is opposite. Only one cut point is generated on the ridge for each case. Therefore, as shown in Fig. 5b, when a cutting point is given on one edge, the sign at both ends is not only the case of opposite sign but also the case of the same sign. Only in the case of a part, the cutting point can be expressed.
- an object of the present invention is to include all cell edge cutting points by Marching Cubes (MC), and to completely cover all cell edge cutting points that cannot be obtained by MC, Accordingly, it is an object of the present invention to provide a method and program for converting boundary data into in-cell shape data, which can cover in-cell shape data consisting of boundaries connecting cell edge cutting points without omission.
- MC Marching Cubes
- a dividing step (A) of dividing external data (1 2) consisting of boundary data of an object into orthogonal cells (13), and a cell edge cutting at an intersection between the boundary data and a cell edge A step (B) for determining a cutting point as a point, a step (C) for determining a boundary connecting the obtained cell edge cutting points as in-cell shape data, and a non-boundary cell (including no boundary) for each divided cell.
- a method and program for converting boundary data into in-cell shape data are provided.
- the intersection between the boundary data and the cell edge is defined as the cell edge cutting point. Therefore, if the sign of the numerical value at both ends of the cell edge is different, one cutting point is placed on the edge. No cutting point is set if the sign is the same. '' All cutting point arrangements by MC are included, and all other cutting point arrangements between the boundary surface and the cell ridge line are 1 edge 1 cutting point It is possible to cover all under conditions.
- the boundary connecting the obtained cell edge cut points is used as the cell internal shape data, so that all the cell internal shape patterns by MC are included and other cell internal shape patterns are included.
- the shape pattern can be covered without omission under the condition of one edge and one cutting point.
- the cell data constituting the boundary cell is divided into inner cell data inside and outside cell data outside the cell internal shape data. While maintaining the continuity of data, it can be divided into non-boundary cell data and boundary cell data.
- the cell is a square cell including a square cell and a rectangular cell in two dimensions, and in the cutting point determination step (B), the boundary data and the edge of the cell are used.
- 4 16
- Six types of intersections are defined as cell edge cutting points, and the equivalent class obtained by rotating the square cell is regarded as a square cell, and the equivalent class is divided into a total of six patterns.
- the pattern of cell edge cut points is divided into a total of 6 patterns including 4 patterns by MC, and cell edge cut points that can occur under 1 edge 1 cut point conditions Patterns can be covered without omission.
- the in-cell shape data is divided into two or two types of in-cell shape patterns using the same class as the equivalent pattern obtained by the three-dimensional rotation operation.
- all the in-cell shape data by MC can be included, and the in-cell shape data that can occur under the 1-edge, 1-cut, lf-point condition can be completely covered.
- the pattern of cell edge cutting points is divided into all 144 patterns including 14 patterns by MC, and cell edges that can occur under the condition of 1 edge 1 cutting point It is possible to cover the pattern of the cutting point without omission.
- the equivalent class obtained by the inversion operation regarding the existence / non-existence of the cutting point is further classified into 87 patterns of 0 to 6 cell edge cutting points as the same pattern. .
- a boundary surface connecting cell edge cutting points is defined as in-cell shape data.
- all the in-cell shape data by the MC can be included, and the in-cell shape data that can occur under the condition of one edge and one cutting point can be covered without omission.
- FIG. 1 is a principle diagram of VCAD.
- 2a to 2d are diagrams showing four equivalent classes of 2D-MC.
- FIGS. 3a to 3n are diagrams showing all the equivalent classes of the arrangement of the cutting points of 3D-MC.
- Figure 4 a, b, c, d, e, and f are typical examples of KTC.
- Figure 4g is a representation of Figure 4f in MC.
- FIGS. 5A and 5B are diagrams showing the difference between the cutting points on the cell edges of MC and KTC.
- FIG. 6 is a flowchart of the data conversion method and the conversion program of the present invention.
- FIGS. 7A to 7F are diagrams showing all the equivalent classes of the arrangement of the cutting points in 2D-KTC.
- 8A to 8V are diagrams showing all equivalent classes of the arrangement of cutting line segments in 2D-KTC on FIG.
- Figure 9 shows a cubo-octahedron (a quasi-regular polyhedron).
- FIGS. 10a to 10ad are diagrams showing 30 equivalent classes in the case where the number of cut points is 0 to 4 in the cut point arrangement in 3D-KTC.
- FIGS. 11a to 11aa are diagrams showing 27 equivalent classes when the number of cut points is 4 or 5 in the cut point arrangement in 3D-KTC.
- FIGS. 12a to 12ad are diagrams showing 30 equivalent classes in the case where the number of cuts in the arrangement of cut points in 3D-KTC is six.
- FIG. 13 is a diagram showing an example in which a line segment connecting all given cutting points forms a closed loop on the surface of a cube.
- Fig. 14 shows the relationship between the 12 vertices and 36 ridge paths of the cubo-octahedron of Fig. 9 as a graph on a plane.
- FIG. 15 is a diagram illustrating an example in which a cell is not divided even when a closed loop is determined.
- Figures 16a, b, and c show examples in which a cell can be divided into two or three depending on the way in which a closed loop is created, but depending on the manner of triangle division with the edge as the edge.
- FIG. 17 is a diagram showing an example in which a cell is divided into two even if all cut points cannot be connected by one closed loop.
- Figures 18a, b, and c show the fourteen triangulations obtained from the Catalan number when the closed loop connecting the cutting points is a hexagon, assuming that it is a regular hexagon, with three equivalent classes. .
- FIGS. 19a to 19d are images on the display comparing the B-rep shape representations of the cyclide and the mold with the surface of the KTC. DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.
- FIG. 6 is a flowchart of the data conversion method and the conversion program of the present invention.
- the method and the conversion program of the present invention include a dividing step (A), a cutting point determining step (B), a boundary determining step (C), a cell dividing step (D), and a boundary cell data dividing. Step (E).
- External data 12 input from the outside may be polygon data representing a polyhedron, cuboid or hexahedral elements used for the finite element method, curved surface data used for 3D CAD or CG tools, or partial surfaces of other solids. This is data represented by information composed of simple planes and curved surfaces.
- External data 1 and 2 include, in addition to such data (referred to as S-CAD data), (1) data directly created by human input using V-CAD's unique interface (V-interface), and ( 2) Digitized data on the surface of measuring instruments, sensors, and digitizers, and (3) internal information such as CT scans, MRI, and poxel data generally used for Volum e rendering. It may be ume data.
- the external data 12 composed of the boundary data of the object acquired in the external data acquiring step (not shown) is divided into cells 13 of an orthogonal lattice.
- this division is divided into rectangular cells by quadtree division.
- quadtree division In the case of a three-dimensional cell, it is divided into rectangular parallelepiped cells 13 by octree division.
- the ottree representation that is, the spatial division by octree, means that the reference rectangular solid 13 including the target solid (object) is divided into eight parts, and until the boundary surface is not included in each area. Recursively repeats the 8-segment processing up to the specified cell size.
- the data amount can be significantly reduced compared to the poxel representation.
- One spatial region divided by the spatial division by the quadtree or the octree is called a cell 13.
- the cells are rectangular or rectangular parallelepiped.
- a rectangle or cuboid is a special case of a square or a cube, but more generally may be a square or a hexahedron whose edges are not orthogonal to each other.
- the area occupied in the space is represented by the hierarchical structure, the number of divisions, or the resolution by these cells.
- the object is represented as a stack of cells of different sizes in the entire space.
- the intersection between the boundary data and the cell edge is defined as a cell edge cutting point 15.
- 2 4 16 types of intersection patterns between the boundary data and the cell edges are set as cell edge cutting point locations, and the equivalence class is obtained by a three-dimensional rotation operation. Are classified as the same pattern into all six patterns described later.
- the equivalent class by the reversal operation regarding the presence / absence of the cut point is the same pattern, and the cell edge cut point is 0- Up to 12 patterns of all 144 patterns can be reproduced. .
- the boundary connecting the obtained cell edge cut points is used as the in-cell shape data.
- the boundary determination step (C) the arrangement of the cutting line segments connecting the cell edge cutting points for all six patterns of the cell edge cutting points is used as the in-cell shape data. More specifically, it is preferable to divide the in-cell shape data into 22 types of in-cell shape patterns, which will be described later, using the same class as the same pattern by a three-dimensional rotation operation. In the case of a three-dimensional cell, in the boundary determination step (C), for all the patterns at the cell edge cutting points, an approximate boundary plane cutting triangle arrangement connecting the cell edge cutting points is used as the in-cell shape data. . Note that in a specific example described later, obtaining an approximate boundary surface connecting the cell edge cutting points may be expressed as “spreading a surface”.
- each divided cell is placed in a non-boundary cell that does not include a boundary surface.
- the boundary cell 13b including the boundary surface.
- a quadtree or an octree is used to represent the boundary cell 13b, and the one completely contained inside is the internal cell 13a having the maximum size, and the external data 12
- the cell containing the boundary information from is assumed to be the boundary cell 13b.
- step (E) the cell data constituting the boundary cell is partitioned into internal cell data inside and outside cell data outside the cell internal shape data.
- step (A) and step (E) are repeated as necessary.
- simulation such as design 'analysis' processing-assembly and test is sequentially performed, and this is output to an output step (for example, as CAM or polygon data).
- the conversion program of the present invention is a computer program for executing the above-mentioned steps (A) and (E), and is used by being mounted on a computer.
- the present invention proposes a new method for generating cell inner surfaces. This completely encompasses the cell inner surface pattern of the MarchhingCube method, and can be obtained by a more general method.
- volume data when volume data is generated by reading a shape such as a polygon into a set of poxels, the intersection between the cell edge and the surface of the shape is recorded as a sampling point as a cutting point, and based on the cutting point information, Restore shape surface.
- a pattern for generating a cell inner surface from a cutting point is first completely defined in two dimensions. In other words, it covers the enumeration of the equivalent classes of the cutting point arrangements (6 patterns) and all the possibilities (22 cases) that the cell inner surface is set up for all the cutting point arrangements.
- the present invention performed counting (144 patterns) of equivalence classes with respect to the cutting point arrangement.
- the cutting points can be connected by line segments on the six faces of the cube without self-intersection. If such a closed loop is formed, it is possible to relatively easily stretch the inner surface of the cell such that it is the outer edge.
- counting not every cutting point once
- the arrangement of cutting points having one closed loop that passes through is 87 out of 144 patterns. An example of a cell inner surface stretched using a closed loop will be described later.
- the present invention reads the surface shape of a conventional CAD into the cell space, records the intersection (cutting point) between the surface and the cell edge, and approximates the original surface shape as a triangular surface from this. It is the subject of.
- MarchingCubes In the above-mentioned MarchingCubes (abbreviated as MC), positive and negative numerical values are written to the eight vertices of the cell, and an isosurface is generated based on the numerical values (hereinafter, a surface with zero value is considered). If the sign of the numerical value at both ends of the edge of the cube is different, one cutting point is set on the edge. If the sign is the same, no cutting point is set. This is done for the 12 edges of the cube, and then a surface is created based on the cut points.
- MC is widely used in the world because simple algorithms can be used robustly.
- the contents of MC can be summarized into the following two. That is, (1) the pattern classification of the arrangement of the cutting points, and (2) the definition of how the inner surface of the cell is stretched for each arrangement of the cutting points (that is, how to connect the cutting points).
- the problem of the ambiguity of MC is that the cell inner surface in (2) is not necessarily unique, but it is not difficult to specify that the surface is uniquely unique in implementation. .
- the inner surface of the cell may be decided so that vertices having large values are connected to each other. Alternatively, it may be determined that vertices having smaller values are connected to each other.
- the robustness of the MC means that it is possible to stretch without holes by making such a decision, that is, the triangular ridges that form the inner surface of the cell are shared by two triangles.
- KT C can represent shapes more accurately than MC (Fig. 4a, b, c).
- MC in the situation shown in Fig. 4a, the four vertices of a square cell all have the same sign because they are located outside the shape, and therefore a cutting point occurs at the four ridges of the cell.
- the inner surface of the cell is not stretched at all in the case of Fig. 4a. This means, from the point of view of -MC, that the current resolution was too coarse to represent this shape.
- the MC pattern is a subset of the KT C pattern. In that sense, it is natural that the shape representation of KT C is richer than MC.
- the case of MC is referred to as “narrow sense 1 ridge 1 cutting point condition”
- the case of KTC is referred to as “broad sense 1 ridge 1 cutting point condition”
- the broadly defined 1 edge 1 cutting point condition completely includes the narrowly defined 1 edge 1 cutting point condition. Therefore, regarding the two-dimensional and three-dimensional cutting point arrangement patterns provided by both, all the patterns of MC are a subset of all the patterns of KTC.
- 2D-KTC consists of two stages.
- the first stage is the classification of the arrangement of the cutting points for the four edges of the square
- the second stage is the classification of the arrangement of the cutting line segments (the line segments having cutting points at both ends) for each arrangement of the cutting points.
- the degree of degeneracy of each arrangement in Fig. 7a to Fig. 7 7 is 1, 4, 4, 2, 2, 4, 1 in order.
- FIGS. 8A to 8V are diagrams showing all the arrangements of the cutting line segments in 2D-KTC.
- the circled items in this figure indicate those existing in 2D-MC, but it can be seen that they are only a subset of 2D-KTC.
- a three-dimensional rotation operation was used. Assuming that the connection of the cutting line is manifold, that is, has no intersection or branch, the four vertices in FIGS. 8A to 8V can be painted in white and black. Unlike MC, this is done after placing the cutting line. Looking at the cut line segment arrangement pattern in Fig.
- cut edge arrangements allow only rotation and mirroring operations-find out how many equivalence classes can be combined and how they are arranged. .
- Equations (1) and (2) in [Equation 1] hold, the number of cutting points can be reduced to 7—1 2 by performing an inversion operation regarding the presence or absence of a cutting point in the arrangement corresponding to 0—5. It can be seen that the arrangement for each individual can be obtained, and the equivalence classes are also handled by the inversion operation.
- any of the four types of layouts can appear as cut point layouts when the surface shape is actually read into the cell space.
- Table 7 of A ppendix B all the cut configurations of 3D-MC corresponded to those of 3D-KTC.
- MC is only one of KT C You can see that it is only a part.
- Figure 13 shows an example in which the line connecting all the given cutting points forms a closed loop on the cell surface.
- Figure 9 shows a cubo-octahedron (a quasi-regular polyhedron; a tetrahedron consisting of eight regular triangles and six squares) together with the cells. Even if the position of the cutting point is the center point of each ridge, the number of cutting point arrangements is counted up. Generality is maintained in considering closed loops.
- This cubo-octahedron is a convex hull for the 12 center points on those 12 edges.
- the way to enter the closed loop is to add two diagonals of each square face of the tetrahedron, that is, a total of 12 diagonals, and 24 edges originally included in the tetrahedron. It is a book.
- Figure 14 shows the relationship between the 12 vertices and 36 ridge paths of this quasi-regular polyhedron as a graph on a plane.
- the counting of Hamiltonian cycles will be explained based on this figure.
- all 12 vertices have the same valence of 6, and the enumeration here only needs to be performed from one specific vertex.
- a path permitted as a Hamiltonian cycle is one that passes through all the given cutting points on the surface of the cube and returns to the starting point without passing through the same path or the same cutting point more than once on the way.
- 8 7 types which are the majority of the 1 4 4 types of cutting point arrangements for 0-1 2 cutting points, have such non-self-intersecting Hamilton paths.
- V-CAD has physical information as information in a cell, but it can also be applied to multi-media. At that time, at the interface of different materials, multiple substances occupy the cell, but when the number of these substances becomes three or more, the number of substances in one cell is reduced by performing some processing. It is preferable to limit to two types. Note that most of the inner surfaces of cells made from a closed loop are convenient because they divide the cell into two.
- the problem of triangulating the inner surface of a cell is related to the problem of triangulating a polygon on a plane, and it is known that the number of triangulation patterns is expressed using Catalan numbers. I have. The Catalan number and triangulation will be described later in Ap pendiC.
- KTC can represent a more precise shape than MC. This is a natural consequence of the fact that the equivalence class of KT C's truncated triangle configuration completely includes that of MC.
- the diversity indicated by KTC is strictly presented when only one cutting edge at one edge is assumed in a broad sense.
- Figures 2a to 2d show four equivalent classes of 2D-MC. Black and white anti on four vertices of cell These four patterns are obtained using only the rotation operation and the three-dimensional rotation operation.
- MC is a force that follows the cutting condition of 1 edge and 1 in a narrow sense, and 4 vertex black-and-white coloring patterns and cutting point arrangement patterns correspond one to one. Indexes of mc-0, mc-1, mc-2, and mc-3 were assigned to each pattern in Figs. 2a to 2d.
- Table 4 is a table in which the number of equivalent classes related to the arrangement of cutting points is associated with the total number of arrangements.
- Table 5 shows the correspondence between the MC break point arrangement and the KT C break point arrangement. Not participating here The cut point arrangement of KT C, that is, Fig. 7b and Fig. 7e, do not exist in the cut point arrangement of MC.
- Ap endix B 3D M arching Cubes (3D-MC)
- Figures 3a to 3n show all equivalence classes of MC cutting point arrangement.
- the operations used for the classification are the black-and-white inversion operation on the vertices, the rotation operation, and the reflection operation.
- Table 6 summarizes these in terms of the number of cutting points.
- the MC figure is usually represented in 15 ways, 0- 14 according to the original paper of MC.-Please note that there are only 14 ways (Fig. 3a to 3 ⁇ ). Omitted
- MC-14 was the mirror symmetry of MC-11. If the method of stretching the surface of the MC-11 is determined, the mirroring operation uniquely determines that of the MC-15, so consistency in the description within the present invention (use of the mirroring operation to count the equivalence classes) Omitted to keep).
- Figures 3a to 3n are the same as the arrangement of the figures in the original paper, but the cell inner surface has been omitted and MC-14 has been deleted for the reasons described above.
- Table 7 shows the correspondence between all MC cases and KTC.
- a e n d i x C Triangulation of polygon and force Taran number
- the Catalan number C m is given by Equation (3) of Equation (2).
- the number T n to be obtained is given by equation (4) of equation (2).
- FIG. 19a, b, and c show the fourteen patterns in a regular hexagon, which are summarized by rotating the triangle. The three patterns are completed.
- FIG. 19a, FIG. 19b, and FIG. 19c are diagrams of equivalent classes representing six, two, and six triangulation methods, respectively. When these are added together, it is confirmed that there are 14 ways.
- the external data (1 2) of the object is divided into orthogonal cells (1 3) by the dividing step (A) and the cell dividing step (D).
- External data (1 2) can be stored with a small storage capacity as a cell hierarchy.
- the intersection of the boundary data and the cell edge is set as the cell edge cutting point. Therefore, if the signs of the numerical values at both ends are different, one cutting point arrangement is provided on that edge. If the signs are the same, no cutting point arrangement is provided. '' All cutting points by the MC are included, and all cutting points between the boundary surface and the cell ridge line under one cutting condition and one cutting condition are not leaked. Can be exhaustive.
- the boundary connecting the obtained cell edge cutting points is used as cell internal shape data, so that all cell internal shape data by MC are included, and one edge and one cut are performed. It is possible to cover the arrangement of the cut triangles in the cell under the conditions without omission.
- the cell data constituting the boundary cell is divided into inner cell data inside and outside cell data outside the inside shape data of the cell, so that all the cell data are regarded as adjacent cells. While maintaining the continuity of data, it can be divided into internal cell data and external cell data.
- the method and program for converting boundary data into in-cell shape data according to the present invention include all cell edge cut points by MC and all other cell edge cut points by one edge and one cut. It has excellent effects such as that the data can be completely covered under the conditions, and thereby the in-cell shape data consisting of the boundaries connecting the cell edge cutting points can be completely covered.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computer Graphics (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Processing Or Creating Images (AREA)
- Image Generation (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2003571956A JP4320425B2 (ja) | 2002-02-28 | 2003-02-27 | 境界データのセル内形状への変換方法及び変換プログラム |
US10/505,224 US7321366B2 (en) | 2002-02-28 | 2003-02-27 | Method and program for converting boundary data into cell inner shape data |
EP03707132.1A EP1484698A4 (en) | 2002-02-28 | 2003-02-27 | METHOD AND PROGRAM FOR IMPLEMENTING BORDER DATA IN AN IN CELL FORM |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2002-53575 | 2002-02-28 | ||
JP2002053575 | 2002-02-28 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2003073335A1 true WO2003073335A1 (fr) | 2003-09-04 |
Family
ID=27764365
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2003/002197 WO2003073335A1 (fr) | 2002-02-28 | 2003-02-27 | Procede et programme de conversion de donnees frontieres en forme a l'interieur d'une cellule |
Country Status (5)
Country | Link |
---|---|
US (1) | US7321366B2 (ja) |
EP (1) | EP1484698A4 (ja) |
JP (1) | JP4320425B2 (ja) |
CN (1) | CN100423009C (ja) |
WO (1) | WO2003073335A1 (ja) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2005109255A1 (ja) | 2004-05-06 | 2005-11-17 | Riken | ボリュームデータのセルラベリング方法とそのプログラム |
JP2007079655A (ja) * | 2005-09-12 | 2007-03-29 | Institute Of Physical & Chemical Research | 境界データのセル内形状データへの変換方法とその変換プログラム |
US7372460B2 (en) | 2003-07-16 | 2008-05-13 | Riken | Method and program for generating volume data from boundary representation data |
US8013855B2 (en) | 2005-03-09 | 2011-09-06 | Riken | Method and program for generating boundary surface information |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080259079A1 (en) * | 2007-04-18 | 2008-10-23 | Boxman Benjamin D | Method and system for volume rendering |
US8462161B1 (en) | 2009-01-20 | 2013-06-11 | Kount Inc. | System and method for fast component enumeration in graphs with implicit edges |
KR101213494B1 (ko) * | 2010-05-12 | 2012-12-20 | 삼성디스플레이 주식회사 | 입체형 표시장치, 플렉서블 표시장치 및 상기 표시장치들의 제조방법 |
FR3013126B1 (fr) * | 2013-11-14 | 2015-12-04 | IFP Energies Nouvelles | Procede de construction d'une grille representative de la distribution d'une propriete par simulation statistique multipoint conditionnelle |
US10353352B2 (en) * | 2017-02-22 | 2019-07-16 | Mitsubishi Electric Research Laboratories, Inc. | System and method for distributed machining simulation |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH06348862A (ja) * | 1993-06-11 | 1994-12-22 | Toshiba Corp | 三次元等値面生成方法 |
Family Cites Families (55)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE2547477C3 (de) | 1975-10-23 | 1981-01-22 | Maschinenfabrik Rissen Gmbh, 2000 Hamburg | Verfahren und Vorrichtung zum Tiefziehen einer Folie aus thermoplastischem Werkstoff |
US4694404A (en) * | 1984-01-12 | 1987-09-15 | Key Bank N.A. | High-speed image generation of complex solid objects using octree encoding |
US4665492A (en) | 1984-07-02 | 1987-05-12 | Masters William E | Computer automated manufacturing process and system |
US4710876A (en) * | 1985-06-05 | 1987-12-01 | General Electric Company | System and method for the display of surface structures contained within the interior region of a solid body |
US4729098A (en) * | 1985-06-05 | 1988-03-01 | General Electric Company | System and method employing nonlinear interpolation for the display of surface structures contained within the interior region of a solid body |
US4719585A (en) * | 1985-08-28 | 1988-01-12 | General Electric Company | Dividing cubes system and method for the display of surface structures contained within the interior region of a solid body |
US5197013A (en) | 1987-07-28 | 1993-03-23 | David M. Dundorf | Method of forming a carved sign using an axially rotating carving tool |
JPH0767576B2 (ja) | 1987-11-18 | 1995-07-26 | ファナック株式会社 | パンチ取り付け用部品の穴位置定義方法 |
JP2920195B2 (ja) | 1989-03-10 | 1999-07-19 | 株式会社日立製作所 | 形状変換方法及び装置 |
US5014207A (en) | 1989-04-21 | 1991-05-07 | E. I. Du Pont De Nemours And Company | Solid imaging system |
JPH0741514B2 (ja) | 1990-07-17 | 1995-05-10 | 日立精機株式会社 | 対話型数値制御装置における工具選定方法 |
JPH0540224A (ja) * | 1990-07-26 | 1993-02-19 | Fuji Photo Film Co Ltd | 走査型顕微鏡 |
JP2597778B2 (ja) | 1991-01-03 | 1997-04-09 | ストラタシイス,インコーポレイテッド | 三次元対象物組み立てシステム及び組み立て方法 |
US5166876A (en) * | 1991-01-16 | 1992-11-24 | General Electric Company | System and method for detecting internal structures contained within the interior region of a solid object |
US5594652A (en) | 1991-01-31 | 1997-01-14 | Texas Instruments Incorporated | Method and apparatus for the computer-controlled manufacture of three-dimensional objects from computer data |
US5345490A (en) | 1991-06-28 | 1994-09-06 | General Electric Company | Method and apparatus for converting computed tomography (CT) data into finite element models |
US5510066A (en) | 1992-08-14 | 1996-04-23 | Guild Associates, Inc. | Method for free-formation of a free-standing, three-dimensional body |
US5517602A (en) | 1992-12-03 | 1996-05-14 | Hewlett-Packard Company | Method and apparatus for generating a topologically consistent visual representation of a three dimensional surface |
JPH06315849A (ja) | 1993-03-04 | 1994-11-15 | Nikon Corp | 研磨加工用プログラムの作成方法及び それを用いた作成装置 |
JP3340198B2 (ja) | 1993-08-12 | 2002-11-05 | 株式会社東芝 | 形状復元装置 |
JPH07334541A (ja) | 1994-06-08 | 1995-12-22 | Hitachi Ltd | 数値解析用要素作成システム |
US5594651A (en) | 1995-02-14 | 1997-01-14 | St. Ville; James A. | Method and apparatus for manufacturing objects having optimized response characteristics |
US6136252A (en) | 1995-09-27 | 2000-10-24 | 3D Systems, Inc. | Apparatus for electro-chemical deposition with thermal anneal chamber |
JP3150066B2 (ja) | 1996-07-16 | 2001-03-26 | 有限会社アロアロ・インターナショナル | 造形装置および方法 |
US6075538A (en) | 1996-07-25 | 2000-06-13 | Institute Of High Performance Computing | Time and space efficient data structure and method and apparatus for using the same for surface rendering |
JPH1063873A (ja) | 1996-08-23 | 1998-03-06 | Atr Tsushin Syst Kenkyusho:Kk | 八分木生成方法 |
US6445390B1 (en) | 1997-12-29 | 2002-09-03 | The United States Of America As Represented By The Adminstrator Of The National Aeronautics And Space Administration | Triangle geometry processing for surface modeling and cartesian grid generation |
JP3344558B2 (ja) | 1998-02-26 | 2002-11-11 | 理化学研究所 | 通電ドレッシング研削方法及び装置 |
JP2000182081A (ja) | 1998-12-14 | 2000-06-30 | Suzuki Motor Corp | 解析モデル作成方法および装置並びに解析モデル作成用プログラム若しくは解析モデルデータを記憶した記憶媒体 |
JP2000194881A (ja) | 1998-12-24 | 2000-07-14 | Suzuki Motor Corp | 解析モデルを作成する方法および装置並びに解析モデルデータ作成用プログラム若しくは解析モデルデータを記憶した記憶媒体 |
US6405095B1 (en) | 1999-05-25 | 2002-06-11 | Nanotek Instruments, Inc. | Rapid prototyping and tooling system |
JP3388203B2 (ja) | 1999-05-28 | 2003-03-17 | 株式会社半導体先端テクノロジーズ | 形状シミュレーション方法、装置および記録媒体 |
JP2001025023A (ja) | 1999-07-09 | 2001-01-26 | Nippon Telegr & Teleph Corp <Ntt> | 映像ストリーム配信方法、配信システムならびに該方法のプログラムを記録した記録媒体 |
JP2001022961A (ja) | 1999-07-13 | 2001-01-26 | Ricoh Co Ltd | 非一様ボリュームモデルからの同位相面生成方法 |
US6214279B1 (en) | 1999-10-02 | 2001-04-10 | Nanotek Instruments, Inc. | Apparatus and process for freeform fabrication of composite reinforcement preforms |
US6627835B1 (en) | 2000-02-02 | 2003-09-30 | Purdue Research Foundation | Three dimensional object fabrication techniques |
US6639597B1 (en) | 2000-02-28 | 2003-10-28 | Mitsubishi Electric Research Laboratories Inc | Visibility splatting and image reconstruction for surface elements |
AU2001244592A1 (en) | 2000-03-31 | 2001-10-15 | Incs Inc. | Data generating device, data generating method and data generating program |
US6968075B1 (en) | 2000-05-09 | 2005-11-22 | Chang Kurt C | System and method for three-dimensional shape and size measurement |
US6606528B1 (en) | 2000-06-21 | 2003-08-12 | The Boeing Company | Method for creating computer-aided design (CAD) solid models from numerically controlled (NC) machine instructions |
JP2002024306A (ja) | 2000-07-05 | 2002-01-25 | Suzuki Motor Corp | 解析モデルデータ作成方法及び装置並びに解析モデルデータ作成用プログラムを記録した記録媒体。 |
WO2002023406A1 (en) | 2000-09-18 | 2002-03-21 | Doodlebug Online, Inc. | System and method for accessing data on content servers via a central authorization host |
DE60116804T2 (de) | 2000-09-18 | 2006-08-10 | Fuji Photo Film Co., Ltd., Minami-Ashigara | System zum Anzeigen von Kunstknochenschablonen |
AU2002213266A1 (en) | 2000-10-20 | 2002-05-06 | Duke University | Single-shot epi with signal recovery from susceptibility-induced losses |
US6471800B2 (en) | 2000-11-29 | 2002-10-29 | Nanotek Instruments, Inc. | Layer-additive method and apparatus for freeform fabrication of 3-D objects |
US20020113331A1 (en) | 2000-12-20 | 2002-08-22 | Tan Zhang | Freeform fabrication method using extrusion of non-cross-linking reactive prepolymers |
GB0117157D0 (en) * | 2001-07-16 | 2001-09-05 | Imec Inter Uni Micro Electr | Extraction, hierarchical representation and flexible compression of surface meshes derived from 3D data |
JP3468464B2 (ja) | 2001-02-01 | 2003-11-17 | 理化学研究所 | 形状と物性を統合したボリュームデータ生成方法 |
JP2004521423A (ja) | 2001-03-12 | 2004-07-15 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | 8分木を用いた多数の画像からの3次元表現の生成 |
JP4703907B2 (ja) | 2001-07-31 | 2011-06-15 | 富士重工業株式会社 | 物体の表面格子生成方法 |
EP1442869A4 (en) | 2001-08-16 | 2008-12-24 | Riken | METHOD AND DEVICE FOR THE FAST MANUFACTURE OF PROTOTYPES USING V-CAD DATA |
WO2003017016A1 (en) | 2001-08-16 | 2003-02-27 | Riken | Die machining method and device by v-cad data |
US6504742B1 (en) | 2001-10-31 | 2003-01-07 | Hewlett-Packard Company | 3-D memory device for large storage capacity |
TW515010B (en) * | 2001-12-11 | 2002-12-21 | United Microelectronics Corp | Method for electroplated metal annealing process |
SE524439C2 (sv) | 2002-12-19 | 2004-08-10 | Arcam Ab | Anordning samt metod för framställande av en tredimensionell produkt |
-
2003
- 2003-02-27 WO PCT/JP2003/002197 patent/WO2003073335A1/ja active Application Filing
- 2003-02-27 EP EP03707132.1A patent/EP1484698A4/en not_active Withdrawn
- 2003-02-27 JP JP2003571956A patent/JP4320425B2/ja not_active Expired - Fee Related
- 2003-02-27 US US10/505,224 patent/US7321366B2/en not_active Expired - Fee Related
- 2003-02-27 CN CNB038048620A patent/CN100423009C/zh not_active Expired - Fee Related
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH06348862A (ja) * | 1993-06-11 | 1994-12-22 | Toshiba Corp | 三次元等値面生成方法 |
Non-Patent Citations (2)
Title |
---|
KAZUTOSHI YONEKAWA ET AL.: "Kukan bunkatsu model o mochiita keijo modeler", TRANSACTIONS OF INFORMATION PROCESSING SOCIETY OF JAPAN, vol. 37, no. 1, 15 January 1996 (1996-01-15), pages 60 - 69, XP002962912 * |
See also references of EP1484698A4 * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7372460B2 (en) | 2003-07-16 | 2008-05-13 | Riken | Method and program for generating volume data from boundary representation data |
WO2005109255A1 (ja) | 2004-05-06 | 2005-11-17 | Riken | ボリュームデータのセルラベリング方法とそのプログラム |
US7734059B2 (en) | 2004-05-06 | 2010-06-08 | Riken | Method and its program for cell labeling of volume data |
US8013855B2 (en) | 2005-03-09 | 2011-09-06 | Riken | Method and program for generating boundary surface information |
JP2007079655A (ja) * | 2005-09-12 | 2007-03-29 | Institute Of Physical & Chemical Research | 境界データのセル内形状データへの変換方法とその変換プログラム |
US7898540B2 (en) | 2005-09-12 | 2011-03-01 | Riken | Method and program for converting boundary data into cell inner shape data |
Also Published As
Publication number | Publication date |
---|---|
US20050216238A1 (en) | 2005-09-29 |
CN1639715A (zh) | 2005-07-13 |
JPWO2003073335A1 (ja) | 2005-06-23 |
CN100423009C (zh) | 2008-10-01 |
JP4320425B2 (ja) | 2009-08-26 |
EP1484698A1 (en) | 2004-12-08 |
EP1484698A4 (en) | 2013-06-12 |
US7321366B2 (en) | 2008-01-22 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4381743B2 (ja) | 境界表現データからボリュームデータを生成する方法及びそのプログラム | |
Thakur et al. | A survey of CAD model simplification techniques for physics-based simulation applications | |
JP3468464B2 (ja) | 形状と物性を統合したボリュームデータ生成方法 | |
JP4783100B2 (ja) | 境界データのセル内形状データへの変換方法とその変換プログラム | |
JP4605772B2 (ja) | 境界面情報の生成方法、その生成プログラム及びその生成システム | |
JP4349562B2 (ja) | 空間の識別方法とそのプログラム | |
WO2003073335A1 (fr) | Procede et programme de conversion de donnees frontieres en forme a l'interieur d'une cellule | |
JP4255016B2 (ja) | 3次元形状データのセル内部データへの変換方法および変換プログラム | |
JP4208191B2 (ja) | 形状と物理量を統合したボリュームデータの生成方法及び生成装置と生成プログラム | |
JP4175536B2 (ja) | 境界データの内外判定方法とそのプログラム | |
CN109983509B (zh) | 一种使用几何面的即时布尔运算方法 | |
Kase et al. | Volume cad | |
Hamri et al. | Computer aided design and finite element simulation consistency | |
CN100437599C (zh) | 体数据的胞腔标号方法及其装置 | |
Patel et al. | Automatic CAD model topology generation | |
JP2022072158A (ja) | 情報処理方法及び情報処理装置 | |
Rossignac | Solid and physical modeling | |
Jiang | Synergistic Geometry Processing: From Robust Geometric Modeling to Scalable Physical Simulation | |
Patel | Automatic CAD model processing for downstream applications | |
Shah | Development of a XGL based boundary representation (B-Rep) data conversion module for CAD interoperability | |
Basic | EXACT GEOMETRY SIMULATION FOR OPTIMIZED DESIGN OF VEHICLES AND VESSELS |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): CN JP US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): DE FR GB |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2003571956 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2003707132 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10505224 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 20038048620 Country of ref document: CN |
|
WWP | Wipo information: published in national office |
Ref document number: 2003707132 Country of ref document: EP |