The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

    STUDIA INFORMATICA - Issue no. Sp. Issue 1 / 2014  

Authors:  .
  Abstract:   In this paper we show a fast and efficient algorithm for cut and split a triangular mesh by a plane, and fully reconstruct the cutting surface. After the cut some of new triangular meshes will be created at the same format as the input mesh. Our approach is not to use complex data structures, just a vertex stream and an index stream keeping the algorithm simple, and ensuring the wide range of usability. We suggest a model for describe the boundary of a solid mesh to obtain advantages as a consequence of geometric topology. If we suppose the streams satisfy some reasonable restrictions, we fi nd our algorithm has linear time complexity including the precomputation, splitting section, reconstruction and the decomposition.

2010 Mathematics Subject Classi fication. 68U05.1998 CR Categories and Descriptors. I.3.5. [Computing Methodologies]: ComputerGraphics - Computational Geometry and Object Modeling.

Key words and phrases. mesh splitting, mesh slicing, topological reconstruction.90
      Back to previous page