skip to main content

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Ni, Saifeng"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; ; ( , 2022 Asian Conference on Computer Vision (ACCV))
    Full Text Available 
  2. ; ; ; ; ; ; ( , IEEE Transactions on Visualization and Computer Graphics)
    Full Text Available 
  3. ; ; ; ; ; ; ( , 2021 IEEE/CVF International Conference on Computer Vision (ICCV))
    Full Text Available 
  4. ; ; ; ; ( , Computer graphics forum)
    We present a particle-based approach to generate field-aligned tetrahedral meshes, guided by cubic lattices, including BCC and FCC lattices. Given a volumetric domain with an input frame field and a user-specified edge length for the cubic lattice, we optimize a set of particles to form the desired lattice pattern. A Gaussian Hole Kernel associated with each particle is constructed. Minimizing the sum of kernels of all particles encourages the particles to form a desired layout, e.g., field-aligned BCC and FCC. The resulting set of particles can be connected to yield a high quality field-aligned tetrahedral mesh. As demonstrated by experiments and comparisons, the field-aligned and lattice-guided approach can produce higher quality isotropic and anisotropic tetrahedral meshes than state-of-the-art meshing methods. 
    more » « less
    Accepted Manuscript Full Text Available
  5. ; ; ; ; ; ( , Computer aided geometric design)
    In this paper, a novel shape matching energy is proposed to suppress slivers for tetrahedral mesh generation. Given a volumetric domain with a user-specified template (regular) simplex, the tetrahedral meshing problem is transformed into a shape matching formulation with a gradient-based energy, i.e., the gradient of linear shape function. It effectively inhibits small heights and suppresses all the badly-shaped tetrahedrons in tetrahedral meshes. The proposed approach iteratively optimizes vertex positions and mesh connectivity, and makes the simplices in the computed mesh as close as possible to the template simplex. We compare our results qualitatively and quantitatively with the state-of-the-art algorithm in tetrahedral meshing on extensive models using the standard measurement criteria. 
    more » « less
    Accepted Manuscript Full Text Available