Earticle

초록

영어

To ensure all boundary edges of each region are retained in the final mesh during mesh generation, a procedure suitable for non-manifold with intersecting boundaries is proposed to recover the non-manifold and intersecting boundaries. In the procedure, Steiner points are inserted directly on the interFigure of missing boundaries and mesh edges from a triangulation. Based on the boundary recovery procedure, Delaunay triangulation algorithms for the domain with interior constraints and for the non-manifold are proposed, and the latter can be used as a new effective polygon Boolean operations algorithm.

목차

Abstract
 1. Introduction
 2. Boundary Recovery Algorithm
 3. Delaunay Triangulation Algorithms for Domain with Constraints
 4. Boolean Operation
 5. Experiments and Analysis
 6. Conclusions
 Acknowledgements
 References

키워드

저자

• Chaoyan Zhu [ Center for Engineering and Scientific Computation, Zhejiang University, China；Center for Engineering and Scientific Computation, Zhejiang University, China Ningbo Institute of Technology, Zhejiang University, China ]
• Zhoufang Xiao [ Center for Engineering and Scientific Computation, Zhejiang University, China；Center for Engineering and Scientific Computation, Zhejiang University, China Ningbo Institute of Technology, Zhejiang University, China ]
• Lijuang Zeng [ Center for Engineering and Scientific Computation, Zhejiang University, China；Center for Engineering and Scientific Computation, Zhejiang University, China Ningbo Institute of Technology, Zhejiang University, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605