Showing 21 - 40 results of 43 for search '"geometry processing"', query time: 0.07s Refine Results
  1. 21

    A global algorithm to compute defect-tolerant geodesic distance by Xin, Shi-Qing, Quynh, Dao Thi Phuong, Ying, Xiang, He, Ying

    Published 2013
    “…Computing geodesic distance on surfaces plays a critical role in digital geometry processing. However, due to its locally shortest nature, geodesic distance is highly sensitive to local geometrical and topological changes, diminishing its applications to real-world models which may contain various types of defects. …”
    Get full text
    Get full text
    Conference Paper
  2. 22

    The crashworthiness performance of the energy-absorbing composite structure—A review by Ahamad Khilji, Irshad, Siti Nadiah, Mohd Saffe, Reddy Chilakamarry, Chaitanya, Siti Aishah, Rusdan

    Published 2022
    “…Several parameters affect energy absorption such as fibre type, matrix type, fibre architecture, specimen geometry, processing conditions, fibre volume fraction, and test speed. …”
    Get full text
    Book Chapter
  3. 23

    Hexahedral Mesh Repair via Sum‐of‐Squares Relaxation by Marschner, Z, Palmer, D, Zhang, P, Solomon, J

    Published 2021
    “…Our novel methodology also introduces the general machinery of sum-of-squares relaxation to geometry processing, where it has the potential to solve related problems.…”
    Get full text
    Article
  4. 24

    Lifting Directional Fields to Minimal Sections by Palmer, David, Chern, Albert, Solomon, Justin

    Published 2024
    “…Directional fields, including unit vector, line, and cross fields, are essential tools in the geometry processing toolkit. The topology of directional fields is characterized by their singularities. …”
    Get full text
    Article
  5. 25

    Scaling Metal Additive Manufacturing from R&D to Production by Weißbach, Reimar

    Published 2024
    “…Connecting commercial data, information about geometry, processing, materials, post-processing, and testing to a build allows to gain a system-level understanding while also being able to dive into details where needed. …”
    Get full text
    Get full text
    Thesis
  6. 26

    Generating cost-effective models for 3D printing by Xu, Wei

    Published 2015
    “…Particularly, we will look into 3D geometry processing and STL file generation. At the end, a web-based system will be developed to implement the processes of taking OBJ file as input and outputting a cost-effective 3D model in STL format.…”
    Get full text
    Final Year Project (FYP)
  7. 27

    Delaunay mesh simplification with differential evolution by Yi, Ran, Liu, Yong-Jin, He, Ying

    Published 2020
    “…Delaunay meshes (DM) are a special type of manifold triangle meshes --- where the local Delaunay condition holds everywhere --- and find important applications in digital geometry processing. This paper addresses the general DM simplification problem: given an arbitrary manifold triangle mesh M with n vertices and the user-specified resolution m (< n), compute a Delaunay mesh M* with m vertices that has the least Hausdorffdistance to M. …”
    Get full text
    Journal Article
  8. 28

    Field-aligned quadrangulation for image vectorization by Wei, Guangshun, Zhou, Yuanfeng, Gao, Xifeng, Ma, Qian, Xin, Shiqing, He, Ying

    Published 2021
    “…Inspired by the quadrangulation methods in 3D geometry processing, we propose a new directional field optimization technique by encoding the color gradients, sidestepping the explicit computing of salient image features. …”
    Get full text
    Journal Article
  9. 29

    Lattice-Based High-Dimensional Gaussian Filtering and the Permutohedral Lattice by Baek, Jongmin, Adams, Andrew, Dolson, Jennifer

    Published 2016
    “…High-dimensional Gaussian filtering is a popular technique in image processing, geometry processing and computer graphics for smoothing data while preserving important features. …”
    Get full text
    Article
  10. 30

    Geometric Computing beyond the Laplacian by Wang, Yu

    Published 2023
    “…The Laplace–Beltrami operator, or, Laplacian, is the central object of study in shape analysis, geometry processing, and scientific computing. Motivated by the ubiquity of Laplacian in geometric computing algorithms, this thesis initiates a program for systematically designing novel algorithms by replacing the Laplacian with better or even optimal alternative operators. …”
    Get full text
    Thesis
  11. 31

    Computing smooth quasi-geodesic distance field (QGDF) with quadratic programming by Cao, Luming, Zhao, Junhao, Xu, Jian, Chen, Shuangmin, Liu, Guozhu, Xin, Shiqing, Zhou, Yuanfeng, He, Ying

    Published 2021
    “…Computing geodesic distances on polyhedral surfaces is an important task in digital geometry processing. Speed and accuracy are two commonly-used measurements of evaluating a discrete geodesic algorithm. …”
    Get full text
    Journal Article
  12. 32

    Dirichlet energy of Delaunay meshes and intrinsic Delaunay triangulations by Ye, Zipeng, Yi, Ran, Gong, Wenyong, He, Ying, Liu, Yong-Jin

    Published 2021
    “…Due to its deep connection to the Laplace–Beltrami operator, Dirichlet energy plays an important role in digital geometry processing. Given a 2-manifold triangle mesh M with vertex set V, the generalized Rippa's theorem shows that the Dirichlet energy among all possible triangulations of V arrives at its minimum on the intrinsic Delaunay triangulation (IDT) of V. …”
    Get full text
    Journal Article
  13. 33

    Comparison of Monte Carlo and bootstrap analyses for residual life and confidence interval by Husnain, M.M.N., Akramin, M. R.M., Shaari, M. S., Takahashi, Akiyuki, Bashiri, Abdullateef H., Alshoaibi, Abdulnaser M.

    Published 2023
    “…Furthermore, material selection, geometry, processing and residual stresses are critical factors that may contribute to uncertainty and prospective failure mechanisms in engineering. …”
    Get full text
    Article
  14. 34

    Efficient construction and simplification of Delaunay meshes by Liu, Yong-Jin, Xu, Chun-Xu, Fan, Dian, He, Ying

    Published 2018
    “…Therefore, the existing digital geometry processing algorithms can benefit the numerical stability of DM without changing any codes. …”
    Get full text
    Get full text
    Journal Article
  15. 35

    On the vertex-oriented triangle propagation (VTP) algorithm : parallelization and approximation by Du, Jie, He, Ying, Fang, Zheng, Meng, Wenlong, Xin, Shi-Qing

    Published 2021
    “…Computing geodesic distances on polyhedral surfaces is a fundamental problem in digital geometry processing and computer-aided design. Most of the existing exact algorithms partition mesh edges into intervals, called windows, and propagate one window at a time. …”
    Get full text
    Journal Article
  16. 36

    Variational surface reconstruction by Wan, Min

    Published 2012
    “…As a fundamental geometry processing task and a typical reverse engineering, surface reconstruction plays a significant role in various areas such as CAD, animation, and medical imaging. …”
    Get full text
    Thesis
  17. 37

    Analysis of fatigue surface crack using the probabilistic s-version finite element model by Mohd Akramin, Mohd Romlay

    Published 2016
    “…In addition, the material selection, geometry, processing and residual stresses produce uncertainties and possible failure modes in the field of engineering. …”
    Get full text
    Thesis
  18. 38

    Development of the overlay formulation in finite element model by Akramin, M. R.M., Sidek, Mohd Zaidi, Oumer, Ahmed Nurye, Amirruddin, A. K., Hassan, Wan Anuar Wan, Mahdhir, Mohd Yusof

    Published 2017
    “…In addition, the material selection, geometry, processing and residual stresses produce uncertainties and possible failure modes in the field of engineering. …”
    Get full text
    Research Report
  19. 39

    Fatigue crack growth analysis using the bootstrap s-version finite element model by Muhamad Husnain, Mohd Noh

    Published 2020
    “…In addition, materials selection, geometry, processing and residual stresses produce uncertainties and possible failure modes in the field of engineering. …”
    Get full text
    Thesis
  20. 40

    Discrete geodesic graphs by Fang, Zheng

    Published 2019
    “…With the growth of computation capabilities, geometry processing applications incorporate with larger scale data and demand higher runtime performance, space efficiency, scalability and robustness. …”
    Get full text
    Get full text
    Thesis