Proceedings of JSPE Semestrial Meeting
Search
Advanced search
OR
Browse
Search
2006 JSPE Spring Meeting
Displaying 1-50 of 647 articles from this issue
Show all abstracts
  • Segmentation using Geometric Feature
    Yuki Asada, Koichi Matsuzaki, Hiromasa Suzuki, Tomoyuki Fujimori
    Session ID: A64
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.49.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Aiming at mesh segmentation applicable to reverse engineering, we propose a method to refine segmentation result of a simple and robust segmentation algorithm called variational shape approximation. In a process of reverse engineering, polygon data obtained from point group is first segmented and then parametric surface is pasted onto each region. Since variational shape approximation method only allows plane as geometric proxy of a surface region, a region representable with one or two parametric surface is often divided into several regions. Some works extend proxies to other primitive shape for refining segmentation. However, calculation cost increases to compute error metric for each shape and also smooth border can′t be obtained. In this paper, we solve these problems by using geometric features of each regions resulted from variational shape approximation and demonstrate its effectiveness with some example.
    View full abstract
    Download PDF (509K)
  • Surface Fitting based Mesh Segmentation and Feature Edges Extraction from Scanned Mesh Model
    Tomohiro Mizoguchi, Hiroaki Date, Satoshi kanai, Takeshi Kishinami
    Session ID: A65
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.51.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    We proposed segmentation method for a scanned mesh using Watershed and Region Growing method based on analytical surface fitting. In this paper, we propose an improved mesh segmentation method based on analytical surface fitting and region combinating. Our method can extract analytical surfaces including tori and their boundary edges, and recognize fillet, linear sweep, and surfaces of revolution.
    View full abstract
    Download PDF (633K)
  • Engineering evaluation of MLS–surface
    Tadashi Hiraoka, Hiromasa Suzuki, Tomoyuki Fujimori, Koichi Matsuzaki
    Session ID: A66
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.53.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    We need automatic high–quality freeform surfaces generation algorithm, in order to convert quickly the dense point sets produced by laser scanners into useful geometric models. We use the method of moving least squares(MLS) to make the density of the points constant, and to generate smooth points. Thus we can generate a high–quality freeform surface. In this paper, we present a procedure for generating constant spacing points from a set of scanned 3D points, and evaluate a MLS–surface under various conditions.
    View full abstract
    Download PDF (181K)
  • Smoothing Method for Mesh Data Using Discrete Laplacian
    Tetsuo Oya, Yukinori Tada, Masatake Higashi
    Session ID: A67
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.55.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    In order to remove noise on a mesh, smoothing techniques have been developed. We have proposed the smoothing method with the discrete Laplacian implemented in the diffusion process. For the feature preservation, the target model is segmented by the detected feature lines in our method. However, such treatment will lead to the problem that user must deal with many feature lines for a huge complex model. In this paper, we adopt the anisotropic diffusion flow for more efficient feature preservation. Simulation results show that the presented method worked well on a closed and an open model with preserving its features.
    View full abstract
    Download PDF (581K)
  • Separated Medial Surface Extraction from CT Data of Welded Parts
    Tomoyuki Fujimori, Yohei Kobayashi, Hiromasa Suzuki
    Session ID: A68
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.57.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    We propose a new technique to analyze welded machine parts. Our problem is that we cannot distinguish a welded place in CT (Computed Tomography) data. This is a principle problem of CT technology. However, analyses of those parts are heavily desired in industrial applications. Therefore, we propose a technique consist of three processes. At first, we extract medial cells from a whole voxel model. Next, we separate the model by using distance analysis and apply the medial cells extraction method once again. Finally, we implement the technique on a standard PC and demonstrate its effectiveness.
    View full abstract
    Download PDF (812K)
  • Generation of Plant Geometry Model from Laser–scan Data
    Toshiki Miyagawa, Shoichi Kakuda, Daiki Iriya, Yoshiaki Iikawa, Hirosh ...
    Session ID: A69
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.59.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    [in Japanese]
    View full abstract
    Download PDF (147K)
  • A Study of Multiresolution Mesh Modeling for Finite Element Analysis
    Hiroaki Date, Satoshi Kanai, Takeshi Kishinami, Ichiro Nishigaki
    Session ID: A73
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.61.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    In this paper, a new mesh combining method for supporting efficient CAE is proposed. Our method consists of three steps: 1) searching the elements on the surfaces shared with different meshes, 2) inserting elements for connecting two surfaces of the input meshes, and 3) mesh simplification for the inserted elements in order to obtain conforming mesh at the shared surface. This mesh combining method is applicable to the meshes that have no–coincident elements and geometries on the surfaces to be shared, and it is reversible. This allows us to support some operations for executing CAE, such as mesh generation of the assembly models and analysis condition setting for the meshes.
    View full abstract
    Download PDF (332K)
  • Approximate Rigid Interpolation for Negating Tetrahdral Meshes
    Takashi Michikawa, Takashi Kanai, Hiromasa Suzuki
    Session ID: A74
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.63.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Approximate Rigid Interpolation for tetrahedral meshes requires meshes without negating tetrahedrons. However, it is difficult to construct such meshes and this is a problem for rigid interpolation. We present a method for rigid interpolation for tetrahedral meshes with negating tetrahedrons. Our method computes pseudo rotation function for negating tetrahedrons from neighbor tetrahedrons. This enables us to compute rigid interpolation for tetrahedral meshes with negating tetrahedrons.
    View full abstract
    Download PDF (101K)
  • Method of Expressing Cloth Texture in CG
    Akinori Kondo, Yoshikazu Kobayasi, Kenji Shirai
    Session ID: A75
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.65.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    The cloth expression of Computer Graphics used texture mapping. As for this method, the feeling of quality of the cloth is not expressible. It proposes the method of making the cloth from the string that composes the cloth in the method of expressing the feeling of quality of the cloth. The made cloth texture of three dimensions is done and the mapping is done by the solid texture method. Moreover, the method of the mapping of the parametric surface is designed.
    View full abstract
    Download PDF (786K)
  • Study of the rendering by the surface texture CAD system
    Yu Sato, Yoshikazu Kobayashi, Kenji Shirai
    Session ID: A76
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.67.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    When the surface texture is designed by CAD, a genuine expression is not done by the texture where it is drawn. Then, the purpose of study is a thing to examine the method of doing the rendering that becomes shape when designing to the texture made by CAD. The geometric data which was drawn up as the expedient, by the surface texture CAD system was read, by the fact that light ray calculation is done accurately making use of Ray tracing, real rendering of texture was done.
    View full abstract
    Download PDF (896K)
  • Development of a Generation System which Makes the Extensive Surface Texture using Stitching
    Shin'ichi Kawashima, Yoshikazu Kobayashi, Kenji Shirai
    Session ID: A77
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.69.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    This paper proposes development of a generation system which makes the extensive surface texture using stitching.Multiple narrow domain surface textures that measured with microscope–type surface profiling instruments change a large field of surface textures using stitching.Using measured data,it resolves the issue in which texture cant depict refined shapes finely. PC–cluster constructs a parallel processing system.The system operate in parallel. As a result, textures created with the system are more refined than conventional textures. Moreover, the execution of the generation with the parallel processing is more efficient than doing with a serial processing.
    View full abstract
    Download PDF (629K)
  • Job–shop Scheduling Based on General Resource Model
    Rei Hino
    Session ID: B06
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.71.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Production resources such as machine tools, robots, AGVs, and buffers are analyzed and modeled in order to make detail schedules in practical production manufacturing systems. This study copes with a semi–finished product stored on the production resource after finishing its operation.
    View full abstract
    Download PDF (121K)
  • Dynamic Scheduling Using the Mixture of a Genetic Algorithm and a Priority Rule
    Toru Eguchi, Masashi Dougakiuchi, Fuminori Oba, Takeshi Murayama
    Session ID: B07
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.73.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    We have already proposed a dynamic job shop scheduling method using the mixture of a genetic algorithm and a priority rule. So far, we found the due date allowance plays an important role in the method. However, in the previous method, the due date allowance was not included explicitly in the performance function optimized periodically. In this report, we examine the effect of the due date allowance by including it into the performance function explicitly, and show its effect using numerical experiments.
    View full abstract
    Download PDF (340K)
  • Advanced Crossover Method for Multi–objective Reactive Scheduling based on Genetic Algorithm
    Yoshitaka Tanimizu, Tsuyoshi Miyamae, Yasuhiro Maeda, Tatsuhiko Sakagu ...
    Session ID: B08
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.75.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Unscheduled disruptions often occur in the actual manufacturing systems, and an initial production schedule may not satisfy the constraints due to the disruptions. A reactive scheduling method based on Genetic Algorithm (GA) was, therefore, proposed to improve the disturbed production schedule in the previous research. This research deals with a new crossover method to improve the performance of the GA based reactive scheduling process for the tardiness minimization problems and the total flow time minimization problems. The multi–objective reactive scheduling method is also proposed based on the improved reactive scheduling method in this research. The combination of the dominance of genes is discussed for the multi–objective reactive scheduling problems of the tardiness minimization and the total flow time minimization. A prototype of reactive scheduling system is developed to evaluate the effectiveness of the proposed method.
    View full abstract
    Download PDF (55K)
  • Evolutionary Artificial Neural Network Based Adaptive Planning Method for Integrating Process Planning and Scheduling
    Riku Inoue, Nobutada Fujii, Kanji Ueda
    Session ID: B09
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.77.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Process plan and production schedule are significant plans that have much effect on the productivity of factories. However, the optimality of each plan is sometimes conflictive. In order to solve the conflict, we propose a new method based on evolutionary artificial neural networks proposed in the area of evolutionary robotics, so that it can realizes simultaneous process planning and scheduling and can adapt to environment changes. The feasibilities of our proposal is confirmed in the computer simulations in which the method achieved high productivity resulting from acquiring appropriate utilization of machines and role sharing among machines.
    View full abstract
    Download PDF (116K)
  • Analysis of NC data based on CNC data model for retaining machining information
    Hiroshi Yamada, Fumiki Tanaka, Masahiko Onosato
    Session ID: B19
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.89.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Retaining machining information is an important element for generating high quality machining information. However, existing NC data (ISO 6983) cannot be used for generating high quality machining information because they do not contain machining features, cutting tool information, workpiece information, and so on. In order to solve this problem, a method of retaining machining information (Workingstep) is proposed in this research. The Workingsteps are obtained by analyzing and transforming existing NC data to CNC data model (ISO 14649) which represents explicitly technical information, such as machining features, cutting tool information, workpiece information, and so on. In this report, the extraction of Workingteps and representation of relationship between them are described.
    View full abstract
    Download PDF (474K)
  • Systematization of Machining Process for Pocket Shape Using CAM System
    Manabu Shimokobe, Tomohisa Tanaka, Yoshio Saito
    Session ID: B20
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.91.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    In the process of using CAM system, the problem that a lot of input still depends on operator′s know–how is pointed out. Therefore, in this research, the selection procedure of the processing method for form feature was made a program and it was build in existing CAM system Selecting a pocket machining as an object, the machining time and result were examined considering the differences such as ″Tool″, ″Tool path″ and ″Presence of the rough processing″. As a result, optimized condition of the pocket was systematized.
    View full abstract
    Download PDF (1015K)
  • A Research of Realistic Collaborative Simulation for Mechatronics System Design (1st Report)
    Satoshi Kanai, Tatsumi Tada
    Session ID: B21
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.93.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Recently, there is an increasing need for digital prototyping for efficient design and verification of the system which is composed of the mechanical, electrical and embedded software systems. In this report, a method of combining multiple simulators used in each discipline by using middleware is proposed, and its application to the electric wheel chair design is shown where the design error is hard to be found only by a simulation of one discipline.
    View full abstract
    Download PDF (707K)
  • A Research of Realistic Collaborative Simulation for Mechatronics System Design (2nd Report)
    Taku Miyashita, Satoshi Kanai, Takeshi Kishinami, Tatsumi Tada
    Session ID: B22
    Published: March 05, 2006
    Released on J-STAGE: January 31, 2007
    DOIhttps://doi.org/10.11522/pscjspe.2006S.0.95.0
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Recently, collaborative simulation environment is needed in the mechatoronics product design. In this research, a systematic collaborative simulation environment is proposed using HLA(High Level Architecture) which is the IEEE standard of a distributed simulation. In this report, an omni–directional electric wheelchair is joined to a federation as a 1federate, and the verification of acceleration control system is done. HIL(hardware–in–the–loop) collaborative simulation using HLA can shorten the time until preparing the simulation and obtain more accurate simulation results.
    View full abstract
    Download PDF (128K)
feedback
 Top