2014Applied Mechanics and MaterialsRequires access

DRCH: A Method for 3D Convex Hull

Xiu Xun Huang, Ji Ting Zhou, Ling Chen, Wen Jun Zhang

Open publisher page 0 citations

Abstract

A novel three-dimensional (3D) convex hull method is proposed, which is called dimensionality reduction convex hull method (DRCH).Through having 3d point set map to 2d plane, most initial 3D points in the convex hull are removed. Then, the remaining points are to generate 3D convex hull using any convex hull algorithm. The experiment demonstrates 3D DRCH is faster than general 3D convex hull algorithms. Its time complexity is O(r log r), where r is the number of points not in the hull. And DRCH can be generalized to higher-dimensional problems.

About this research paper

What this paper is about

A novel three-dimensional (3D) convex hull method is proposed, which is called dimensionality reduction convex hull method (DRCH).Through having 3d point set map to 2d plane, most initial 3D points in the convex hull are removed. Then, the remaining points are to generate 3D convex hull using any convex hull algorithm. The experiment demonstrates 3D DRCH is faster than general 3D convex hull algorithms. Its time complexity is O(r log r), where r is the number of points not in the hull. And DRCH can be generalized to higher-dimensional problems.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A novel three-dimensional (3D) convex hull method is proposed, which is called dimensionality reduction convex hull method (DRCH).Through having 3d point set map to 2d plane, most initial 3D points in the convex hull are removed. Then, the remaining points are to generate 3D convex hull using any convex hull algorithm. The experiment demonstrates 3D DRCH is faster than general 3D convex hull algorithms. Its time complexity is O(r log r), where r is the number of points not in the hull. And DRCH can be generalized to higher-dimensional problems.

Key concepts: Convex hull, Orthogonal convex hull, Convex polytope, Convex set, Hull, Convex combination, Output-sensitive algorithm, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
DRCH: A Method for 3D Convex Hull — Research Paper | ScholarLens