WO2005109255A1 - ボリュームデータのセルラベリング方法とそのプログラム - Google Patents
ボリュームデータのセルラベリング方法とそのプログラム Download PDFInfo
- Publication number
- WO2005109255A1 WO2005109255A1 PCT/JP2005/007777 JP2005007777W WO2005109255A1 WO 2005109255 A1 WO2005109255 A1 WO 2005109255A1 JP 2005007777 W JP2005007777 W JP 2005007777W WO 2005109255 A1 WO2005109255 A1 WO 2005109255A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- boundary
- cell
- data
- space
- external data
- 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
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/10—Segmentation; Edge detection
- G06T7/11—Region-based segmentation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/10—Segmentation; Edge detection
- G06T7/162—Segmentation; Edge detection involving graph-based methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/10—Image acquisition modality
- G06T2207/10072—Tomographic images
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/20—Special algorithmic details
- G06T2207/20004—Adaptive image processing
- G06T2207/20012—Locally adaptive
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/20—Special algorithmic details
- G06T2207/20021—Dividing image into blocks, subimages or windows
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/30—Subject of image; Context of image processing
- G06T2207/30004—Biomedical image processing
Definitions
- the present invention relates to a cell labeling method of volume data that divides a space partitioned by not necessarily closed boundary data including one medium or two or more media, surface branches, holes, open shells, and the like, and its method. About the program.
- CAD Computer Aided Design
- CAM Computer Aided Manufacturing
- CAE Computer Aided Engineering
- CAT Computer Aided Testing
- the boundary surface of an object has an important meaning. For example, it is widely performed that the target object is represented by a boundary and the inside of the boundary surface is treated uniformly. . In such a case, an inside / outside determination means for determining whether the inside or outside of the two-dimensional or three-dimensional boundary surface is required.
- Non-patent document 1 Conventional methods for determining inside / outside are: (1) ray intersection method (Non-patent document 1), (2) region growing (extended) method using boundary tracking (Non-patent document 2), (3) raster tracking in image processing (Non-patent document 2), (4) Multi-directional tracking (Non-patent document 2), (5) Curie SS method (Non-patent document 3), (
- Non-patent documents 6, 7 and Patent documents 1-3 are known.
- Related patent documents 4 to 7 by the same applicant of the present invention have been published.
- Non-Patent Document 1 J. O'Rourke, "Computational geometry in C second edition", p. 246, Cambridge University Press, 1998.
- Non-Patent Document 2 Rosenfeld & Kak Nagao Translation, ⁇ Digital Image Processing '', Modern Science Co., pp. 332-357)
- Non-patent Literature 3 B. Curie ss ana M. Levoy, A volumetric method for DUI lding complex models from range images. ", In Proceedings of SI GGRAPH '96, pages 303-312, August 1996)
- Non-Patent Document 4 R. SzelisKi. "Rapid octree construction from image sequences.”
- Non-Patent Document 5 K. Pulli, T. Duchamp, H. Hoppe, J. McDonald, L. hapiro, W. Stuetzle., "Robust meshes from multiple range maps.” Proceeding of International Conference on Recent Advances in 3- D Digital
- Non-Patent Document 6 Yonekawa, Kobori, Kutsuwa, "Shape Modeler Using Spatial Partition Model” Journal of Japan Society for Information Processing, Vol. 37, No. 1, pp. 60-69, 1996
- Non-Patent Document 7 Morimoto and Yamaguchi, "Recursive space partitioning method and subspace classification, self-intersection, and extension to overlapping curves", Transactions of Information Processing Society of Japan, Vol. 37, No. 12, Dec. 1 996
- Non-Patent Document 9 Cavalcanti, PR, Carvalho, PCP, and Martha, LF, Non-manifold modeling: an approach based on spatial subdivision, Computer-Aided Design, 29 (3), (1997), pp. 209-220 .
- Patent Document 1 JP-A-8-96025, " Figure processing method and apparatus"
- Patent Document 2 Japanese Patent Application Laid-Open No. 8-153214, "Method of Generating Three-Dimensional Orthogonal Grid Data”
- Patent Document 3 Japanese Patent Application Publication No. 2003-44528, "Method of Generating Surface Grid of Object”
- Patent Document 4 Patent No. 3468464, "Volume data generation method integrating shape and physical properties”
- Patent Document 5 Japanese Patent Application Laid-Open No. 2003-330976, "Inside / Outside Judgment Method of Boundary Data and its Program"
- Patent Document 6 International Publication No. 03Z048980 pamphlet, "Conversion method and conversion program for 3D shape data into cell internal data"
- Patent Document 7 International Publication No. 03Z073335 pamphlet, "Method and program for converting boundary data into cell shape"
- Non-Patent Document 1 uses a point force when there is an input boundary surface and determines whether the intersection between the light beam (semi-straight line) and the boundary is even or odd. If the number is even, the viewpoint of the light ray is determined to be outside the object, and if the number is odd, it is determined to be inside the object.
- a region growing (extending) method using boundary tracking in image processing to which only boundary information is given is, for example, slow because force processing disclosed in Non-Patent Documents 2, 8, and 9 covers the whole. There was a problem that the identification could not be done correctly if the surface information was inadequate.
- Non-Patent Document 2 is a method of tracking a boundary or an area sandwiched between boundaries while scanning cells along coordinate axes such as the X axis. If the boundary information with incompleteness (closed surface,,,) is used as a quantized image, it cannot be correctly identified.
- Non-Patent Document 2 As a method for avoiding this, there is a multi-directional tracking (Non-Patent Document 2), but the efficiency is low.
- the Curless method uses external information such as regularly arranged measurement points and directions of multiple cameras with respect to the measurement target. Is a robust method for reconstructing surface information by defining an implicit function based on the distance over the entire field, and is disclosed in Non-Patent Document 3.
- Curless's method must calculate the distance field in all cells. /,point
- accuracy problems have been pointed out, such as the inability to correctly calculate the distance function for structures that are thinner than the cell size and for sharp surfaces. This leads to misjudgment in identification.
- Szeliski's method using octree (Non-Patent Document 4) and Pulli's method (Non-Patent Document 5) also divide the obtained range data (distance data) and space by octree. This is a method of reconstructing the boundary by classifying the relationship with the cell into three types: internal, external, and boundary. In these methods, since a projection operation is used in each cell, processing is complicated and time-consuming, and there is a problem of instability of calculation in the projection operation.
- Non-Patent Document 6 can express only two media as a result by three types of cells: outer, boundary, and inner! /. In addition, there is a problem because there is only a shape expression and no physical property value!
- Non-Patent Document 7 is an inside / outside determination method for inputs, branches, and the like, and is limited to two-dimensional continuous and bounded. Although the directed graph is used, there is a problem that it cannot be applied to multi-media, three-dimensional, and discontinuous.
- Patent Documents 1 to 3 support only two media, cannot support one medium or three or more media, and cannot support complicated surface data.
- Patent Documents 4 to 7 by the applicant of the present invention have the following problems, though they are adapted to multi-media as a whole.
- the manifold is boundary data
- the force that can be handled even in a multi-medium.1 One side force.Boundary data where multiple surfaces are branched, holes are opened, or It was difficult to handle non-manifold boundary data such as discontinuous boundary data, that is, surface branching, holes, open shells, and only one medium and three or more mediums.
- manifolds and non-manifolds are two-dimensional boundaries, and solids, volumes, media, and belonging spaces are three-dimensional regions.
- the present invention has been made to solve the above-mentioned problems. That is, The purpose of Ming is to define the two media inside and outside according to the boundary data of the two manifolds, which are completely closed solids, as well as the one media with open shell boundaries, the multi media of three or more media, the surface branching, the holes, etc. It is an object of the present invention to provide a volume data cell labeling method and a program capable of handling boundary data of a non-manifold including the data as an input object, and rapidly and robustly dividing a space partitioned by the data. .
- the object of the present invention is to add different material (medium) information for each divided space to VCAD data (volume data), and to combine various simulations, It is an object of the present invention to provide a volume data cell labeling method and a program thereof that can be used for processing such as processing, comparison with an actual product, and evaluation using volume data to which data is added.
- external data obtaining means obtains external data corresponding to the boundary data of an object
- the external data is divided into rectangular parallelepiped cells whose boundary planes are orthogonal by cell dividing means, and each cell divided by the cell dividing means is divided into a boundary cell including boundary data and a non-boundary cell not including boundary data,
- a different space number is set for each space separated by boundary data by the space dividing means
- a cell labeling method for volume data characterized by resetting the space numbers of adjacent cells to the same space number without being partitioned by boundary data by the space number compression means.
- all external data is divided into rectangular parallelepiped cells whose boundary planes are orthogonal by the cell dividing means (cell dividing step), and the cell dividing means (cell dividing step) is used. ),
- the cells are divided into boundary cells and non-boundary cells. Therefore, even if the external data is a non-manifold including multi-mediums with three or more media, surface branches, holes, open shells, etc. It is always divided into boundary cells or non-boundary cells.
- the boundary data is always included in the boundary cell by defining a boundary cell that includes only a part (for example, one point) of the boundary data.
- space dividing step a different space number is set for each space divided by the boundary data by the space dividing means (space dividing step), and adjacent cells are not separated by the boundary data by the space number compressing means (space number compressing step). Since the space number of the cell is reset to the same space number, even if the external data is a non-manifold including one medium open shell, three or more mediums, surface branching, holes, etc., it will be different as it is Can be set to space number.
- the method and its program of the present invention can be applied to a single medium, a multi-medium of three or more media, a branch of a surface, a hole, an open shell, as well as two media outside and inside bounded by a completely closed solid.
- the space dividing means is a space dividing means
- cycle search means for following the cut triangle sharing the side and forming the smallest angle between the faces is sequentially executed for all the cut triangles.
- the calculation procedure is simple, and programming and implementation on a computer are easy. Furthermore, since a plurality of spaces separated by boundary cells are assigned different space numbers, the present invention can be applied to a space that can represent a multi-medium with little risk that different spaces are classified into one space. is there.
- the cycle search means sets a space number where a medium exists by a half space pointed by a normal vector determined by a cycle of a side and a direction V with respect to two sides of a back side and a front side constituting a cut triangle. I do.
- the cycle diving means two or more cutting triangles sharing sides and having opposite sides are sequentially drawn in order, and finally reach the cutting triangle that has been started and are surrounded by a closed boundary. Set the space number specified.
- the cycle search means performs sequential processing or parallel distributed processing for each cell.
- the cell dividing means may be used until a sufficient cutting point at which a boundary shape element constituting a boundary surface included in the external data can be reconstructed from the rectangular parallelepiped cell is obtained, or a user may leave the cutting point. It is preferable to re-divide by octree division up to a predetermined number of times.
- This method can be applied to VCAD data by octree division.
- the space dividing means sequentially scans all of the rectangular parallelepiped cells by repeating the processing sequentially in three directions of X, Z, and Z or performing recursive processing.
- VC is repeated by sequentially repeating the X, ⁇ , and Z directions.
- the external data includes a physical property value of an object and an object surrounding the object, and associates the physical property value with a space number set by the space classification unit.
- one medium, three media or more, as well as two media outside and inside bounded by two manifolds that are completely closed solids can be handled as input objects (boundary data), and the space partitioned by them can be classified at high speed and robustness.
- VCAD data volume data
- various simulations are linked and the information (including time-series changes) is obtained.
- the added volume data can be used for inspection, such as processing, comparison with the actual product, and evaluation.
- FIG. 1 is an apparatus configuration diagram for executing a method of the present invention.
- FIG. 2 is a flowchart of a cell labeling method of the present invention.
- FIG. 3 is an example of a boundary surface disclosed in Patent Document 6.
- FIG. 4 is a flowchart of a space dividing means D in FIG. 2.
- FIG. 5 is an explanatory view of a cycle extracting means for selecting a cut triangle sharing the sides and forming the smallest angle between the surfaces.
- FIG. 6 is a diagram showing a relationship between angles formed by a target triangle and triangles in the same order.
- FIG. 7 is a relationship diagram between angle 0 and sin ⁇ , cos ⁇ , tan ⁇ .
- FIG. 8 is a flowchart showing a method of determining each section.
- Patent Document 4 The inventors of the present invention have previously created and applied for a “volume data generation method integrating shape and physical properties” (Patent Document 4).
- This method can store entity data that integrates shape and physical properties with a small storage capacity, thereby centrally managing the history of object shape 'structure' and 'property information' and designing, processing, assembling, It relates to a method of storing entity data that can manage data related to a series of processes such as testing and evaluation with the same data, and can unify CAD and simulation.
- the data obtained by this method is called “V-CAD data” or "volume data”
- the design or simulation using this data is called "volume CAD” or "V-CAD”.
- the cell labeling method of the present invention is particularly suitable for application to volume data.
- boundary (surface) data When there is boundary (surface) data as input, the surface of the rectangular parallelepiped that divides a three-dimensional space such as a botant cell or an octant octant and the area inside it are called ⁇ cells ''.
- a cell for retaining surface information is referred to as a "boundary cell", and a cell having no surface information is referred to as a "non-boundary cell”. inner cell) ”).
- a boundary cell is one in which the intersection with the input boundary data exists at the inside of the cell constituting the cell and at any of the faces, edges, and vertices which are the boundaries of the cell. It is a non-boundary cell. Adjacent cells share only the cell boundary regardless of their type. An object that has a two-manifold boundary and is filled with a three-dimensional interior is called "space.” The respective spaces are not connected to each other, in which case different spaces are given different space numbers. recognize. Therefore, it refers to the part (point set) surrounded by the boundary (surface) expressed by a closed surface, and in the real world, it is used as a unit to limit objects of the same material. Conversely, a boundary that distinguishes different spaces is called a “boundary (same definition as a boundary used in mathematics)” or “surface”.
- FIG. 1 is a configuration diagram of an apparatus for executing the method of the present invention.
- the CAD device 10 includes an external data input means 2, an external storage device 3, an internal storage device 4, a central processing unit 5, and an output device 6.
- the external data input means 2 is, for example, a keyboard, and inputs external data composed of boundary expression data of an object.
- the external storage device 3 is a hard disk, a floppy disk, a magnetic tape, a compact disk, or the like, and stores volume data in which shapes and physical quantities are integrated and a program for generating the volume data.
- the internal storage device 4 is, for example, a RAM, a ROM, or the like, and stores calculation information.
- the central processing unit 5 (CPU) intensively processes calculations, input / output, and the like, and executes programs together with the internal storage device 4.
- the output device 6 is a display device and a printer, for example, and outputs the stored volume data and the execution result of the program.
- the central processing unit 5, the internal storage device 4, and the external storage device 3 work together as an external data acquisition unit, an external data input unit, a cell division unit, a cell division unit, a space division unit, and a space number compression unit, which will be described later. Function.
- External data input from the outside includes polygon data representing a polyhedron, tetrahedral or hexahedral elements used for the finite element method, curved surface data used for a three-dimensional CAD or CG tool, or other solid surfaces. This is data represented by information composed of typical planes and curved surfaces.
- external data includes (1) data directly created by human input using a V-CAD unique interface (V-interface). (2) Digitized data of surfaces such as measuring instruments, sensors, and digitizers; and (3) Volume data that also has internal information such as CT scans, MRIs, and Vota cell data that are generally used for Volume rendering. You may.
- FIG. 2 is a flowchart of the cell labeling method of the present invention implemented on a computer.
- the method of the present invention is a process from the external data acquisition S1 to the formation of the V—CAD data 14 (or volume data).
- the external data acquisition means Sl, the external data input means A, the cell It consists of dividing means B, cell dividing means C, space dividing means D, and space number compressing means E.
- the means from the external data input means A to the space number compressing means E is called volume data forming means S2.
- a simulation means S3 and an output means S4 are usually performed following the volume data forming means S2.
- structural analysis using a computer, large deformation analysis, and the like are performed. Simulation processing of thermal fluid analysis, flow analysis, removal processing, addition processing, or deformation processing is performed.
- the external data acquisition means Sl volume data formation means S2 (external data input means A, cell division means B, cell division means C, space division means D, space number compression means E), simulation means
- the respective processes performed in S3 and the output means S4 are referred to as external data acquisition step Sl, volume data formation step S2 (external data input step A, cell division step B, cell division step C, space division step D, space number compression step, respectively).
- Step E called simulation step S3 and output step S4.
- the cell labeling program of the present invention is a computer program for performing an external data input step A, a cell division step B, a cell division step C, a space division step D, and a space number compression step E.
- the external data obtaining means S1 obtains the boundary data of the target 1 and the external data 12, which is the physical property value, using a computer.
- the external data input means A inputs the boundary data of the object 1 acquired by the external data acquisition means S1 and the external data 12 which also has physical properties to a computer or the like storing the method of the present invention.
- the external data 12 is divided into the rectangular parallelepiped cells 13 whose boundary planes are orthogonal by the cell dividing means B.
- the cuboid cell 13 may be a cubic cell in addition to the cuboid cell.
- Each cell divided by the cell dividing means C is divided into a boundary cell 13a including boundary data and a non-boundary cell 13b not including boundary data.
- the space dividing means D divides each cell 13 into a different space for each space partitioned by boundary data. Set the number.
- the space numbers of adjacent cells that are not separated by boundary data by the space number compression means E are reset to the same space numbers.
- simulation such as design “analysis” processing and CAM (Computer Aided Manufacturing) / assembly / test are performed by the simulation means S3.
- the output means S4 outputs the result of the simulation to, for example, a printer or an external NC device.
- the cell dividing means B is sufficient to reconstruct the rectangular parallelepiped cell 13 into boundary shape elements constituting the boundary surface included in the external data. Until a cutting point is obtained, it is better to re-divide by octree division.
- the cell division means B divides the data into rectangular parallelepiped cells 13 having the same size.
- FIG. 3 is an example in which the boundary surface disclosed in Patent Document 6 is used as a boundary.
- the boundary surface included in the boundary data is a plane
- the number of cutting points between the boundary surface and the ridge line is 3 to 6.
- the number of cutting points is not limited to this example, and may be 7 to 12.
- the two media inside and outside according to the boundary data of the two manifolds, which are completely closed solids include one medium, three or more media, non-media including surface branches, holes, open shells, etc. Manifolds are also targeted.
- the boundary surface in the boundary cell illustrated in FIG. 3 can be divided into one or a plurality of cutting triangles formed by connecting the cutting points.
- objects connected to a plurality of cutting triangles only at the sides of the cutting triangle are targeted.
- each cut triangle has two types of belonging space, each determined by two types of one cycle (front and back) determined by three sets of cut points, and front and back. (Half space in 3D Euclid space on the side pointed by the normal vector of the direction of the right screw determined by one cycle) (can be specified).
- FIG. 4 is a more detailed flowchart of the space dividing means D of FIG. As shown in this figure, when the cell is a non-boundary cell in step S11, a single space number is set by the space dividing means D.
- the boundary data sets a cutting point at which the edge of the boundary cell is cut, and a single or a plurality of cutting triangles which connect the cutting point only at the connecting edge. .
- step S13 if there is a cutting point and no cutting triangle, a single space number is set.
- step S14 if there are a plurality of cut triangles connected by the side, all of the “cycle search means” that set a different space number for each space with the cut triangle that shares the side and forms the smallest angle with the surface For the cut triangles in order.
- the space number k is, for example, an integer of 1, 2, 3,..., And is preferably used in ascending order.
- the space dividing means sequentially scans all the rectangular parallelepiped cells 13 in the three directions of X, ⁇ , and Z repeatedly or in a recursive manner.
- space numbers are set for adjacent cells that are not separated by boundary data during scanning! If this is the case, it is better to reset to the smaller space number.
- the following cycle is performed on the cut triangle (start cycle) with the side (orientation) selected above, and the process ends when the start cycle is reached. Also examine the back of the side cut triangle selected above. If the back is outside the cell, skip to the next step. If checked, set the checked flag. If both sides are checked for all cut triangles, the process ends.
- FIG. 5 is an explanatory diagram of a cycle dividing means for selecting a cut triangle sharing the sides and forming the smallest angle between the surfaces. In this figure, four cutting triangles share side 12. Hereinafter, the method of “cycle diving” will be described.
- the cut triangle with side selected above is denoted by ⁇ ( ⁇ , 1, 2).
- () represents an ordered pair.
- the numbers are the cutting points, and it is assumed that the adjacent cutting triangles that share the sides are filled.
- the shared sides 1 and 2 are oriented sides (1, 2) determined by the cycle.
- FIG. 6 is a diagram illustrating a relationship between angles formed by a target triangle and triangles in the same order.
- the faces of the triangles are indicated by line segments
- the target triangle is 2-0
- the triangle in the same order is three line segments 2-i.
- I 1, 2 I tan ⁇ ((0, 1) X (0, 2)) X ((i, 2) X (i, 1)) ) / (0, 1) X (0, 2)-(i, 2) X (i, 1) (2)
- - ⁇ to - ⁇ 2 is referred to as section 1
- - ⁇ 2 to + ⁇ 2 is referred to as section 2
- ⁇ / 2 to ⁇ is referred to as section 3.
- FIG. 7 is a relationship diagram between angle ⁇ and sin ⁇ , cos ⁇ , tan ⁇ . From this figure, it can be seen that tan 0 is always an increasing function in sections 1, 2, and 3, and that in each section, a smaller triangle can be selected by selecting the smaller value of tan 0.
- inout and inner are scalar quantities proportional to sin ⁇ and cos ⁇ ⁇ ⁇ ⁇ , respectively.
- FIG. 8 is a flowchart showing a method of determining each section.
- the external data 12 input from the outside is polygon data representing a polyhedron, tetrahedral or hexahedral elements used in the finite element method, curved surface data used in a three-dimensional CAD or CG tool, or Or data that expresses the surface of other solids with information composed of partial planes or curved surfaces.
- External data 12 includes, in addition to such data, data directly created by human input using a V-CAD proprietary interface, (2) digitizing data on surfaces such as measuring instruments, sensors, and digitizers, and CT data. It may be volume data that also has internal information such as scan and MRI, and vota cell data generally used for volume rendering.
- the output data is VCAD data that has a boundary with a different label (space number) for each space and a cell force having a size greater than the minimum spatial resolution.
- This VCAD data does not have cells that directly have boundaries (boundary cells)! , Cells (non-boundary cells).
- volume data cell labeling method and its program of the present invention have the following effects.
- VCAD The input objects that can be handled by VCAD are expanded. That is, it is a completely closed solid.It has two medium forces inside and outside bounded by two manifolds.It can be applied to non-manifolds (surface branches and holes) and one medium bounded by an open shell from one medium to three or more media. .
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Computer Graphics (AREA)
- Geometry (AREA)
- Software Systems (AREA)
- Processing Or Creating Images (AREA)
- Image Generation (AREA)
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP05734615A EP1770566A4 (en) | 2004-05-06 | 2005-04-25 | VOLUME DATA CELL IDENTIFICATION METHOD AND PROGRAM THEREFOR |
US11/568,669 US7734059B2 (en) | 2004-05-06 | 2005-04-25 | Method and its program for cell labeling of volume data |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2004-137674 | 2004-05-06 | ||
JP2004137674A JP4526063B2 (ja) | 2004-05-06 | 2004-05-06 | ボリュームデータのセルラベリング方法とそのプログラムとボリュームデータのセルラベリング装置 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005109255A1 true WO2005109255A1 (ja) | 2005-11-17 |
Family
ID=35320395
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2005/007777 WO2005109255A1 (ja) | 2004-05-06 | 2005-04-25 | ボリュームデータのセルラベリング方法とそのプログラム |
Country Status (5)
Country | Link |
---|---|
US (1) | US7734059B2 (ja) |
EP (1) | EP1770566A4 (ja) |
JP (1) | JP4526063B2 (ja) |
CN (1) | CN100437599C (ja) |
WO (1) | WO2005109255A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2011138210A (ja) * | 2009-12-25 | 2011-07-14 | Institute Of Physical & Chemical Research | 数値流体計算方法、数値流体計算装置、プログラム、及び、記録媒体 |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8687917B2 (en) * | 2005-05-02 | 2014-04-01 | Agency For Science, Technology And Research | Method and apparatus for registration of an atlas to an image |
JP4783100B2 (ja) * | 2005-09-12 | 2011-09-28 | 独立行政法人理化学研究所 | 境界データのセル内形状データへの変換方法とその変換プログラム |
US8954295B1 (en) | 2011-08-10 | 2015-02-10 | Trimble Navigation Limited | Determining an outer shell of a composite three-dimensional model |
Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH0896025A (ja) | 1994-07-28 | 1996-04-12 | Hitachi Ltd | 図形処理方法および装置 |
JPH08153214A (ja) | 1994-11-25 | 1996-06-11 | Nissan Motor Co Ltd | 3次元直交格子データの生成方法 |
JP2000076485A (ja) * | 1998-08-14 | 2000-03-14 | Xerox Corp | ボロノイフィルタリングによる面再構築方法、装置、およびコンピュ―タ媒体 |
JP2001014492A (ja) * | 1999-06-29 | 2001-01-19 | Sony Corp | 三角網生成方法および三角網生成装置 |
JP2003044528A (ja) | 2001-07-31 | 2003-02-14 | Fuji Heavy Ind Ltd | 物体の表面格子生成方法 |
WO2003048980A1 (fr) | 2001-12-04 | 2003-06-12 | Riken | Procede de conversion de donnees d'image tridimensionnelle en donnees de cellules interieures et programme de conversion |
WO2003073335A1 (fr) | 2002-02-28 | 2003-09-04 | Riken | Procede et programme de conversion de donnees frontieres en forme a l'interieur d'une cellule |
JP3468464B2 (ja) | 2001-02-01 | 2003-11-17 | 理化学研究所 | 形状と物性を統合したボリュームデータ生成方法 |
JP2003330976A (ja) | 2002-05-17 | 2003-11-21 | Inst Of Physical & Chemical Res | 境界データの内外判定方法とそのプログラム |
JP2004334640A (ja) * | 2003-05-09 | 2004-11-25 | Institute Of Physical & Chemical Research | 多媒質データの識別方法とそのプログラム |
-
2004
- 2004-05-06 JP JP2004137674A patent/JP4526063B2/ja not_active Expired - Fee Related
-
2005
- 2005-04-25 CN CNB2005800144030A patent/CN100437599C/zh not_active Expired - Fee Related
- 2005-04-25 WO PCT/JP2005/007777 patent/WO2005109255A1/ja not_active Application Discontinuation
- 2005-04-25 US US11/568,669 patent/US7734059B2/en not_active Expired - Fee Related
- 2005-04-25 EP EP05734615A patent/EP1770566A4/en not_active Withdrawn
Patent Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH0896025A (ja) | 1994-07-28 | 1996-04-12 | Hitachi Ltd | 図形処理方法および装置 |
JPH08153214A (ja) | 1994-11-25 | 1996-06-11 | Nissan Motor Co Ltd | 3次元直交格子データの生成方法 |
JP2000076485A (ja) * | 1998-08-14 | 2000-03-14 | Xerox Corp | ボロノイフィルタリングによる面再構築方法、装置、およびコンピュ―タ媒体 |
JP2001014492A (ja) * | 1999-06-29 | 2001-01-19 | Sony Corp | 三角網生成方法および三角網生成装置 |
JP3468464B2 (ja) | 2001-02-01 | 2003-11-17 | 理化学研究所 | 形状と物性を統合したボリュームデータ生成方法 |
JP2003044528A (ja) | 2001-07-31 | 2003-02-14 | Fuji Heavy Ind Ltd | 物体の表面格子生成方法 |
WO2003048980A1 (fr) | 2001-12-04 | 2003-06-12 | Riken | Procede de conversion de donnees d'image tridimensionnelle en donnees de cellules interieures et programme de conversion |
WO2003073335A1 (fr) | 2002-02-28 | 2003-09-04 | Riken | Procede et programme de conversion de donnees frontieres en forme a l'interieur d'une cellule |
JP2003330976A (ja) | 2002-05-17 | 2003-11-21 | Inst Of Physical & Chemical Res | 境界データの内外判定方法とそのプログラム |
WO2003098489A1 (fr) | 2002-05-17 | 2003-11-27 | Riken | Programme et procede de determination interieures/exterieure de donnees de frontiere |
JP2004334640A (ja) * | 2003-05-09 | 2004-11-25 | Institute Of Physical & Chemical Research | 多媒質データの識別方法とそのプログラム |
Non-Patent Citations (8)
Title |
---|
B. CURLESS; M. LEVOY: "A Volumetric Method for Building Complex Models from range images", PROCEEDINGS OF SIGGRAPH, vol. 96, August 1996 (1996-08-01), pages 303 - 312, XP000682746 |
CAVALCANTI, P. R.; CARVALHO, P. C. P.; MARTHA, L. F.: "Non-manifold modeling: an approach based on spatial subdivision", COMPUTER-AIDED DESIGN, vol. 29, no. 3, 1997, pages 209 - 220, XP004016968, DOI: doi:10.1016/S0010-4485(96)00066-8 |
K. KASE ET AL.: "Volume CAD", VOLUME GRAPHICS, 2003, pages 145173 - 150 |
K. PULLI; T. DUCHAMP; H. HOPPE; J. MCDONALD; L. HAPIRO; W. STUETZLE: "Robust meshes from multiple range maps", PROCEEDINGS OF INTERNATIONAL CONFERENCE ON RECENT ADVANCES IN 3-D DIGITAL IMAGING AND MODELING, May 1997 (1997-05-01), pages 205 - 211, XP010234177, DOI: doi:10.1109/IM.1997.603867 |
MORIMOTO; YAMAGUCHI: "Recursive spatial division method and partial spatial classification, self crossings, and extension to overlapping curve", JOURNAL OF INFORMATION PROCESSING SOCIETY OF JAPAN, vol. 37, no. 12, December 1996 (1996-12-01) |
See also references of EP1770566A4 |
WEILER, K.: "The radial-edge structure: A topological representation for non-manifold geometric boundary representations", GEOMETRIC MODELING FOR CAD APPLICATIONS, 1988, pages 3 - 36 |
YONEKAWA; KOBORI; HISATSUWA: "Shape modeler using spatial division model", BULLETIN OF INFORMATION PROCESSING SOCIETY OF JAPAN, vol. 37, no. 1, 1996, pages 60 - 69 |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2011138210A (ja) * | 2009-12-25 | 2011-07-14 | Institute Of Physical & Chemical Research | 数値流体計算方法、数値流体計算装置、プログラム、及び、記録媒体 |
Also Published As
Publication number | Publication date |
---|---|
JP2005321885A (ja) | 2005-11-17 |
EP1770566A1 (en) | 2007-04-04 |
US7734059B2 (en) | 2010-06-08 |
US20070233432A1 (en) | 2007-10-04 |
EP1770566A4 (en) | 2009-12-02 |
CN100437599C (zh) | 2008-11-26 |
JP4526063B2 (ja) | 2010-08-18 |
CN1950824A (zh) | 2007-04-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Zigelman et al. | Texture mapping using surface flattening via multidimensional scaling | |
Liu et al. | Construction of iso-contours, bisectors, and Voronoi diagrams on triangulated surfaces | |
Song et al. | Function representation based slicer for 3D printing | |
Sheen et al. | Transformation of a thin-walled solid model into a surface model via solid deflation | |
Wang et al. | Thickening freeform surfaces for solid fabrication | |
Proussevitch et al. | Recognition and separation of discrete objects within complex 3D voxelized structures | |
JP2002230054A (ja) | 形状と物性を統合した実体データの記憶方法 | |
Hoffmann et al. | Solid modeling | |
US7620528B2 (en) | Method and program for labeling multi material data | |
JP4605772B2 (ja) | 境界面情報の生成方法、その生成プログラム及びその生成システム | |
Maquart et al. | 3D volumetric isotopological meshing for finite element and isogeometric based reduced order modeling | |
WO2005109255A1 (ja) | ボリュームデータのセルラベリング方法とそのプログラム | |
JP4175536B2 (ja) | 境界データの内外判定方法とそのプログラム | |
Subburaj et al. | Voxel-based thickness analysis of intricate objects | |
JP4320425B2 (ja) | 境界データのセル内形状への変換方法及び変換プログラム | |
Inoue et al. | Solid model reconstruction of wireframe CAD models based on topological embeddings of planar graphs | |
Kuo et al. | Reconstruction of virtual parts from unorganized scanned data for automated dimensional inspection | |
Azernikov et al. | A new volume warping method for surface reconstruction | |
Kwok et al. | Geometric analysis and computation using layered depth-normal images for three-dimensional microfabrication | |
Dang | From micro-CT TO A NURBS-based interface-enriched generalized finite element method | |
Rossignac | Solid and physical modeling | |
Schinko et al. | Vertex Climax: Converting Geometry into a Non-nanifold Midsurface. | |
Storti et al. | Interval extensions of signed distance functions: iSDF-reps and reliable membership classification | |
JP4805732B2 (ja) | ボリュームデータから中立面を生成する中立面生成方法とそのプログラム | |
Sharma et al. | Computation of discrete medial axis using local search in domain Delaunay Triangulation of a solid |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS KE KG KM KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
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: 11568669 Country of ref document: US Ref document number: 2005734615 Country of ref document: EP Ref document number: 2007233432 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 200580014403.0 Country of ref document: CN |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWW | Wipo information: withdrawn in national office |
Country of ref document: DE |
|
WWP | Wipo information: published in national office |
Ref document number: 2005734615 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 11568669 Country of ref document: US |