Analysis of the Computational Cost of PolyFront: an Algorithm for Planar Triangulation-Reference-Cited by-同舟云学术

Analysis of the Computational Cost of PolyFront: an Algorithm for Planar Triangulation

Published:2023-09-22 Issue: Volume:10 Page:50-64
ISSN:2409-5761
Container-title:Journal of Advances in Applied & Computational Mathematics
language:
Short-container-title:J. Adv. App. Comput. Math.

Author:

Egidi Nadaniela^ORCID,Giacomini Josephin^ORCID,Misici Luciano,Perticarini Alessia^ORCID,Piergallini Riccardo

Abstract

The triangulation of planar domains is a relevant and largely studied problem in many applied sciences. This paper analyzes the computational time of a triangulation algorithm for plane domains with holes, introduced in a previous paper. This algorithm is based on the normal offsetting technique starting from a polygonal approximation of the domain boundary. It is shown that the computational time is linear with respect to the number of vertices of the triangulation. Experimental results confirm the theoretical upper bound obtained for the computational time.

Publisher

Avanti Publishers

Subject

General Medicine

Reference17 articles.

1. Wang Q, Ye J, Wu H, Gao B, Shepherd P. A triangular grid generation and optimization framework for the design of free-form gridshells. Comput Aid Des. 2019; 113: 96–113. https://doi.org/10.1016/j.cad.2019.04.005

2. Liu F, Feng R. Automatic triangular grid generation on a free-form surface using a particle self-organizing system. Eng Comput. 2020; 36: 377–89. https://doi.org/10.1007/s00366-019-00705-4

3. Liu F, Feng R, Tsavdaridis KD. A novel progressive grid generation method for free-form grid structure design and case studies. J Build Eng. 2021; 34: 101866. https://doi.org/10.1016/j.jobe.2020.101866

4. Liseikin V. Grid generation methods. vol. 1, Springer; 1999, p. 1–29. https://doi.org/10.1007/978-3-662-03949-6_1

5. Thompson JF. Handbook of grid generation. 1st Edition. Boca Raton: CRC Press; 1999. https://doi.org/10.1201/9781420050349