원문정보
보안공학연구지원센터(IJMUE)
International Journal of Multimedia and Ubiquitous Engineering
Vol.10 No.8
2015.08
pp.107-114
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보
