2008
DOI: 10.3722/cadaps.2008.508-518
|View full text |Cite
|
Sign up to set email alerts
|

Constructing Triangular Meshes of Minimal Area

Abstract: This paper is concerned with the problem of constructing an aesthetically pleasing triangular mesh with a given closed polygonal contour in three dimensional space as boundary. Triangular meshes of minimal area from all triangular meshes with the prescribed boundary are suggested as the candidates for this problem. An iterative algorithm of constructing such a triangular mesh from a given polygonal boundary is presented. Experimental examples show that the proposed algorithm is reliable and effective. Some rel… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…In our work we implemented an algorithm discussed in ref. 47. The initial data in this algorithm consists of coordinates of amino acids in the covalent loop.…”
Section: Methodsmentioning
confidence: 99%
“…In our work we implemented an algorithm discussed in ref. 47. The initial data in this algorithm consists of coordinates of amino acids in the covalent loop.…”
Section: Methodsmentioning
confidence: 99%
“…The algorithm relies on coordinates of Cα atoms (from the PDB file) or any atoms/monomers (in XYZ file). The triangulated surface of minimal area (called a minimal surface) is spanned on the closed loop following techniques in computer graphics ( 13 ); our algorithm, optimized for proteins and taking into account surface orientation (to detect supercoiling), gives the same results as established software (e.g. Surface Evolver ( 14 )).…”
Section: Methodsmentioning
confidence: 99%
“…A minimal area mesh can be constructed using the vertexbased algorithm, which minimizes the total area of the surface by minimizing the area around each vertex [10]. However, with such an algorithm, the triangles comprising the resection surface cannot guarantee the safety margin.…”
Section: E Resection Construction and Optimizationmentioning
confidence: 99%