Abstract: An optical device includes a first axicon lens to which collimated light is incident and which is configured to form diverging ring-shaped light; a lens to which the ring-shaped light formed by the first axicon lens is incident and which is configured to form ring-shaped collimated light; and a condensing mirror that is configured to condense the ring-shaped collimated light formed by the lens. A photoacoustic microscope includes the optical device described above and a detector that is configured to detect an acoustic wave caused by light condensed by the condensing mirror.

Abstract: An optical device includes a first axicon lens to which collimated light is incident and which is configured to form diverging ring-shaped light; a lens to which the ring-shaped light formed by the first axicon lens is incident and which is configured to form ring-shaped collimated light; and a condensing mirror that is configured to condense the ring-shaped collimated light formed by the lens. A photoacoustic microscope includes the optical device described above and a detector that is configured to detect an acoustic wave caused by light condensed by the condensing mirror.

Abstract: A method includes: an input step of inputting boundary surface information 11 on an object to a computer using the computer; a grid sampling step of determining cutting points 13 where the boundary surface cuts across edges of a predetermined rectangular parallelepiped grid 12 and normal vectors 14 of the boundary surface at the cutting points, and storing them in a storage unit as primary data 15; a D-polyhedron data generation step of connecting adjacent cutting points with a line segment to form a triangle one by one for generating D-polyhedron data 16 constituted of triangles only; and a V-polyhedron data generation step of generating V-polyhedron data 17 constituted of intersections of a plurality of infinite planes passing through the cutting points and whose normals coincide with the normal vectors. Any one of the D-polyhedron data and the V-polyhedron data is generated from the primary data 15, and the other is generated as a dual.

Abstract: A cutting point calculation step defines the cell complex that contains the boundary data, and calculating a cutting point where the boundary data cuts an edge or vertex of the rectangular parallelepiped cell of the cell complex. A cycle formation step classifies the rectangular parallelepiped cells into a boundary cell having the cutting point and a nonboundary cell having no cutting point, acquiring a cutting segment between a cell surface and boundary data for each boundary cell, and forming a cutting segment cycle closed by connecting the cutting points and the cutting segments alternately in sequence. A cycle internal division step divides the inside of the cutting segment cycle into cycle inner triangles sharing an adjacent side, for each boundary cell. A simplification step of unifying a plurality of cutting points on each edge, and registering the cycle inner triangles in the cell, for each boundary cell.

Abstract: By external data acquisition means using a computer, external data comprised of boundary data for an object is obtained; by external data input means, the external data are inputted into the computer; by cell dividing means, the external data are divided to rectangular parallelepiped cells that boundary planes intersect perpendicularly; by cell sorting means, the individual cells are sorted into boundary cells that include boundary data and non-boundary cells that do not include boundary data; by space sorting means, respective spaces are assigned to different space numbers where the cells are partitioned according to the boundary data; and by space number compression means, adjacent cells are reassigned to the same space numbers for cells that are not partitioned according to the boundary data.

Abstract: The present invention includes an external data acquisition step (S1), an external data input step (A), a cell division step (B), a cell classification step (C), a space classification step (D), a simulation step (S3), and an output step (S4). The cell classification step (C) includes a step of further classifying each of the boundary cells (13a) into a first type cell and a second type cell. The first type cell has a cutting point at which an edge line or vertex is cut by the boundary data. The second type cell has a cutting point that lies on a boundary with another cell of different hierarchy, and is larger than the another cell. The cell classification step (C) further includes a step of assigning a material number to each cell vertex.

Abstract: A method includes: an input step of inputting boundary surface information 11 on an object to a computer using the computer; a grid sampling step of determining cutting points 13 where the boundary surface cuts across edges of a predetermined rectangular parallelepiped grid 12 and normal vectors 14 of the boundary surface at the cutting points, and storing them in a storage unit as primary data 15; a D-polyhedron data generation step of connecting adjacent cutting points with a line segment to form a triangle one by one for generating D-polyhedron data 16 constituted of triangles only; and a V-polyhedron data generation step of generating V-polyhedron data 17 constituted of intersections of a plurality of infinite planes passing through the cutting points and whose normals coincide with the normal vectors. Any one of the D-polyhedron data and the V-polyhedron data is generated from the primary data 15, and the other is generated as a dual.

Abstract: A method including: a dividing step (A) of dividing external data into a plurality of cells (13) having boundaries orthogonal to each other, the external data including boundary data of an object which contacts incompressible viscous fluid; a cell classifying step (B) of classifying the divided cells into an internal cell (13a) positioned inside or outside the object and a boundary cell (13b) including the boundary data; a cut point determining step (C) of determining cut points in ridges of the boundary cell on the basis of the boundary data; a boundary face determining step (D) of determining a polygon connecting the cut points to be cell internal data for the boundary face; and a analyzing step (E) of applying a cut cell finite volume method combined with a VOF method to a boundary of a flow field to analyze the flow field.

Abstract: V-CAD data is prepared by dividing external data 12 consisting of boundary data of an object into rectangular parallelepiped cells 13 having boundary planes orthogonal to each other in accordance with octree division and separating the respective divided cells into internal cells 13a positioned on the inner side of the object and boundary cells 13b including a boundary face, and a modeling unit quantity of a prototyping material 7 is changed in accordance with sizes of the internal cell 13a and the boundary cell 13b of a modeling portion. The prototyping material 7 is a resin, lumber powder, a low-fusing-point metal, metal powder, ceramics powder or a mixture of a binder and one of these materials, and its modeling unit quantity is set in such a manner that the modeling unit quantity is smaller than a capacity of a corresponding cell and does not protrude from the boundary plane of the cell.

Abstract: A method for determining insides and outsides of boundaries includes an external data input step of inputting external data constituted by boundary data of objects, a cell division step of dividing the external data into rectangular parallelepiped cells having boundary planes orthogonal to each other, a cell classification step of classifying the cells into a boundary cell that includes the boundary data and a non-boundary cell that does not include the boundary data, and a space classification step of classifying the non-boundary cells into a plurality of spaces that are partitioned by the boundary cells.

Abstract: A data input means inputs boundary data of an object to a computer, a data converting means converts the boundary data into a triangle patch having a phase, an associating means divides a space into rectangular parallelepiped cells having boundary planes intersecting perpendicularly and associates the cell with a triangle to be included in the cell, a dividing/arranging means divides a triangle patch having a phase and floating in the space at cell faces and keeps all triangles arranged within and on the boundaries of cells, a ridge line integrating means integrates ridges that do not alter the phase, a cell assigning means assigns each triangle and its vertex to a cell with reference to index data of the vertex, and a labeling means sets an attribute value of each cell.

Abstract: A method of converting three-dimensional shape data into cell internal data. The method includes an oct-tree division step of dividing external data including boundary data of a target object into rectangular parallelepiped cells having boundary planes orthogonal to each other by oct-tree division. The method further includes a cell classification step of classifying each of the cells into an internal cell positioned inside or outside the target object or a boundary cell including the boundary data, and a cut point determination step of determining cut points of edges of the boundary cell based on the boundary data. The method further includes a boundary surface determination step of connecting cut points to form a polygon, and determining the polygon as the cell internal data when the number of the determined cut points is no fewer than 3 and no more than 12.

Abstract: A method and a program for converting boundary data into cell inner shape data, includes a division step (A) of dividing external data (12) constituted of the boundary data of an object into cells (13) in an orthogonal grid, a cutting point deciding step (B) of deciding an intersection point of the boundary data and a cell edge as a cell edge cutting point, a boundary deciding step (C) of deciding a boundary formed by connecting the cell edge cutting points as the cell inner shape data, a cell classification step (D) of classifying the divided cells into a nonboundary cell (13a) including no boundary surface and a boundary cell (13b) including a boundary surface, and a boundary cell data classification step (E) of classifying cell data constituting the boundary cell into internal cell data inside the cell inner shape data and external cell data outside the cell inner shape data.

Abstract: By external data acquisition means using a computer, external data comprised of boundary data for an object is obtained; by external data input means, the external data are inputed into the computer; by cell dividing means, the external data are divided to rectangular parallelepiped cells that boundary planes intersect perpendicularly; by cell sorting means, the individual cells are sorted into boundary cells that include boundary data and non-boundary cells that do not include boundary data; by space sorting means, respective spaces are assigned to different space numbers where the cells are partitioned according to the boundary data; and by space number compression means, adjacent cells are reassigned to the same space numbers for cells that are not partitioned according to the boundary data.

Abstract: A data input means inputs boundary data of an object to a computer, a data converting means converts the boundary data into a triangle patch having a phase, an associating means divides a space into rectangular parallelepiped cells having boundary planes intersecting perpendicularly and associates the cell with a triangle to be included in the cell, a dividing/arranging means divides a triangle patch having a phase and floating in the space at cell faces and keeps all triangles arranged within and on the boundaries of cells, a ridge line integrating means integrates ridges that do not alter the phase, a cell assigning means assigns each triangle and its vertex to a cell with reference to index data of the vertex, and a labeling means sets an attribute value of each cell.

Abstract: A cutting point calculation step defines the cell complex that contains the boundary data, and calculating a cutting point where the boundary data cuts an edge or vertex of the rectangular parallelepiped cell of the cell complex. A cycle formation step classifies the rectangular parallelepiped cells into a boundary cell having the cutting point and a nonboundary cell having no cutting point, acquiring a cutting segment between a cell surface and boundary data for each boundary cell, and forming a cutting segment cycle closed by connecting the cutting points and the cutting segments alternately in sequence. A cycle internal division step divides the inside of the cutting segment cycle into cycle inner triangles sharing an adjacent side, for each boundary cell. A simplification step of unifying a plurality of cutting points on each edge, and registering the cycle inner triangles in the cell, for each boundary cell.

Abstract: A coordinate system R is set in which P0 is a coordinate origin, P0P1 conforms to a first U axis to have a unit length, P0P2 conforms to a second V axis to have a unit length, and P0P1×P0P2 is a unit vector conforming to a third N axis. A transforming matrix M that transforms an ordinary coordinate system into the coordinate system R and the u-, v- and n-coordinate values of the both ends of the line segment are calculated. It is determined whether or not the line segment intersects with the triangle, on the basis of the u-, v- and n-coordinate values. The u-, and v-coordinate values of the intersection point are calculated. It is determined whether or not the intersection point is positioned inside the triangle, on the basis of the u-, and v-coordinate values of the intersection point.

Abstract: (A) V-CAD data of an object (1) is prepared. (B) A processed surface shape after NC processing is predicted by simulation using the V-CAD data. (C) The object is subjected to NC processing by a predetermined NC program, and a processed surface shape after NC processing is measured, and (D) processing correction data is obtained from a difference between the processed surface shapes acquired by simulation and measurement, and the NC program is corrected based on the processing correction data. As a result, the ultra-precise processing is enabled even if a workpiece or a tool has low rigidity and an inconstant quantity of deformation.

Abstract: An implicit function field of a nonmanifold is held in a form of volume data; a value of an implicit function at a point between lattice points is decided by interpolation; and if a difference in code distances between two adjacent voxels to be interpolated is larger than a fixed width, no surface is formed between the voxels. Furthermore, an entered curved surface is broken down into curved surface patches which enable determination of a front and a back; numbers are given to the front and the back, respectively, to be distinguished from each other; and a space is classified into a plurality of regions by using the number of a surface of a nearest point.

Abstract: The present invention includes an external data acquisition step (S1), an external data input step (A), a cell division step (B), a cell classification step (C), a space classification step (D), a simulation step (S3), and an output step (S4). The cell classification step (C) includes a step of further classifying each of the boundary cells (13a) into a first type cell and a second type cell. The first type cell has a cutting point at which an edge line or vertex is cut by the boundary data. The second type cell has a cutting point that lies on a boundary with another cell of different hierarchy, and is larger than the another cell. The cell classification step (C) further includes a step of assigning a material number to each cell vertex.