A method of three-dimensional subdivision of arbitrary polyhedron by using pyramids

DOI

10.2991/icmia-16.2016.73How to use a DOI?

Keywords

arbitrary polyhedron, surface boundary, pyramid, three-dimensional subdivision

Abstract

The key research of this paper is the algorithm that using pyramids to divide the arbitrary polyhedron. The core idea of this algorithm is as follows. Store the vertices of the outer boundary surfaces of the polyhedron anticlockwise, and store the vertices of the inner boundary surfaces clockwise. When the selected vertex is visible to the given polygon and the distance between them is the minimum, the pyramid composed of the point and the polygon is an effective subdivision. If there are more than one vertex have the same distance to the polygon, the projection of the vertex in the polygon should have the minimum distance to the center of gravity of the polygon.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ji-Bo Liu
AU  - Zhi-Hong Wang
AU  - Yue-Guan Yan
PY  - 2016/11
DA  - 2016/11
TI  - A method of three-dimensional subdivision of arbitrary polyhedron by using pyramids
BT  - Proceedings of the 2016 5th International Conference on Measurement, Instrumentation and Automation (ICMIA 2016)
PB  - Atlantis Press
SN  - 1951-6851
UR  - https://doi.org/10.2991/icmia-16.2016.73
DO  - 10.2991/icmia-16.2016.73
ID  - Liu2016/11
ER  -