A heuristic convexity measure for 3D meshes

Li, R, Liu, L, Sheng, Y and Zhang, G (2017) A heuristic convexity measure for 3D meshes. The Visual Computer, 33 (6-8). pp. 903-912. ISSN 0178-2789

Preview

Text A Heuristic Convexity Measure for 3D Meshes.pdf - Other Download (7MB) | Preview

Abstract

In this paper we propose a heuristic convex- ity measure for 3D meshes. Built upon a state-of-the- art convexity measure that employs a time-consuming genetic algorithm for optimization, our new measure projects only once a given 3D mesh onto the orthogonal 2D planes along its principal directions for an initial estimation of mesh convexity, followed by a correction calculation based on mesh slicing. Our measure experimentally shows several advantages over the state-of-the-art one: First, it accelerates the overall computation by approximately an order of magnitude; second, it properly handles those bony meshes usually overestimated by the state-of-the-art measure; third, it improves the accuracy of the state-of-the-art measure in 3D mesh retrieval.

Item Type:	Article
Additional Information:	This is a post-peer-review, pre-copyedit version of an article published in The Visual Computer. The final authenticated version is available online at: http://dx.doi.org/10.1007/s00371-017-1385-6
Uncontrolled Keywords:	0801 Artificial Intelligence and Image Processing, 1702 Cognitive Sciences
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Divisions:	Computer Science and Mathematics
Publisher:	Springer Nature
Date of acceptance:	22 March 2017
Date Deposited:	02 Oct 2019 10:42
Last Modified:	04 Sep 2021 08:48
DOI or ID number:	10.1007/s00371-017-1385-6
URI:	https://researchonline.ljmu.ac.uk/id/eprint/11432

View Item