-
公开(公告)号：JPH0896166A
公开(公告)日：1996-04-12
申请号：JP23191194
申请日：1994-09-27
Applicant: IBM JAPAN
Inventor： MASUDA HIROSHI , MATSUZAWA YASUSHI
Abstract: PURPOSE: To extract only proper candidate segments by comparing extracted two-dimensional coordinates on a top view and a front view with each other and regarding one combination of coordinate values as the two-dimensional coordinates of a candidate vertex on a side view when the other combination of coordinate values determined by the relation between both the views are equal. CONSTITUTION: When the X-coordinate values on the top view and front view are equal, the two-dimensional coordinates (Y-coordinate value on the top view and Y-coordinate value on the front view) are regarded as the two-dimensional coordinates of the candidate vertex on the side view. The coordinates on the respective drawings, however, are determined by mutually crossing axes of projection planes M1 , M2 , and M3 . Namely, the top view contains the intersection line of the projection planes M1 and M2 as its X axis (X1 ) and the intersection line of the projection planes M1 and M3 as its Y axis (Y1 ), the front view contains the intersection line of the projection planes M1 and M2 as its X axis (X2 ) and the intersection line of the projection planes M2 and M3 as its Y axis (Y2 ), and the side view has the intersection line of the projection planes M1 and M3 as its X axis (X3 ) and the intersection line of the projection planes M2 and M3 as its Y axis (Y3 ). Then the segment constituted by connecting two candidate vertexes is extracted as a candidate segment.
-
公开(公告)号：JPH10340276A
公开(公告)日：1998-12-22
申请号：JP33918597
申请日：1997-12-09
Applicant: IBM JAPAN
Inventor： MATSUZAWA YASUSHI , FUKUDA TSUYOSHI
Abstract: PROBLEM TO BE SOLVED: To provide a method for executing plural intensive operations in parallel at a high speed. SOLUTION: In the computer system where plural processors connected by a network can use self-memory areas and the self-parts of a data base containing data which can be divided into one or plural groups, (a) a space for storing M(integer of not more than N)-pieces of operation results in N-pieces of intensive operations is secured in the self-memory area (210). (b) M-pieces of intensive operations are collected and they are executed for the self-part of the data base (220). (c) The operation results in the respective processors of M-pieces of intensive operations are transmitted to the processor which is to integrate them and the processor which is to integrate them calculates a final result (230). (d) Steps (a)-(c) are repeated until N-pieces of intensive operations terminate (240).
-
公开(公告)号：JPH0896164A
公开(公告)日：1996-04-12
申请号：JP23369594
申请日：1994-09-28
Applicant: IBM JAPAN
Inventor： NUMAO MASAYUKI , MASUDA HIROSHI , MATSUZAWA YASUSHI
Abstract: PURPOSE: To efficiently composite a precise solid model by using drawing data. CONSTITUTION: Closed areas are detected on the basis of shape drawing data to generate a closed area list 100, a tree structure is detected 200, and the list is converted into a symbol group as a set of symbols of elements of the outlines of the closed areas and symbols of connection relations of the elements 300. When the symbol group has a specific symbol, the symbol group is divided into plural symbol groups on the basis of the symbol 400. The symbol group, matching is performed 500 and the attributes, e.g. area of the closed areas are detected 600. The symbol groups are classified into symbol groups of closed areas of the same shape, and the symbol groups are further classified into symbol groups of closed areas of the same area 700. Symbol groups of closed areas having children of the closed areas of the same area of the same shape are selected out of the symbol groups of the closed areas of the same area of the same shape 800 and the solid model is composited 900.
-
-
Search Results
3
records
(took 0.021 seconds)
