Angel Plaza

Orcid: 0000-0002-5077-6531

According to our database1, Angel Plaza authored at least 41 papers between 1992 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Similarity Classes of the Longest-Edge Trisection of Triangles.
Axioms, October, 2023

2022
Sum of an Alternating Geometric Series Via Self-Similarity.
Am. Math. Mon., 2022

Similarity classes generated by the 8T-LE partition applied to trirectangular tetrahedra.
J. Comput. Appl. Math., 2022

Iterated Partial Sums of the k-Fibonacci Sequences.
Axioms, 2022

2021
Exponential Inequalities and Corollaries.
Am. Math. Mon., 2021

2020
Harmonic, Logarithmic, and Arithmetic Means and Corollaries.
Am. Math. Mon., 2020

The 8T-LE partition applied to the obtuse triangulations of the 3D-cube.
Math. Comput. Simul., 2020

2019
kth Power of a Partial Sum.
Am. Math. Mon., 2019

Hamiltonian triangular refinements and space-filling curves.
J. Comput. Appl. Math., 2019

The 8T-LE Partition Applied to the Barycentric Division of a 3-D Cube.
Proceedings of the Numerical Mathematics and Advanced Applications ENUMATH 2019 - European Conference, Egmond aan Zee, The Netherlands, September 30, 2019

2018
The Harmonic Series Diverges.
Am. Math. Mon., 2018

2016
Longest-edge n-section algorithms: Properties and open problems.
J. Comput. Appl. Math., 2016

2015
On the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n.
Comput. Aided Geom. Des., 2015

Corrigendum to "A new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes" [Applied Mathematics and Computation 219 (4) (2012) 2342-2344].
Appl. Math. Comput., 2015

2014
A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection.
Math. Comput. Simul., 2014

There are simple and robust refinements (almost) as good as Delaunay.
Math. Comput. Simul., 2014

2013
Two-sided estimation of diameters reduction rate for the longest edge n-section of triangles with 4 n.
Appl. Math. Comput., 2013

Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric.
Appl. Math. Comput., 2013

2012
A local refinement algorithm for the longest-edge trisection of triangle meshes.
Math. Comput. Simul., 2012

Properties of the longest-edge n-section refinement scheme for triangular meshes.
Appl. Math. Lett., 2012

A new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes.
Appl. Math. Comput., 2012

2011
Short Proofs Of Combinatorial Identities For n!
Ars Comb., 2011

A note on "Some inequalities in inner product spaces related to the generalized triangle inequality" by S.S. Dragomir et al.
Appl. Math. Comput., 2011

2010
On the non-degeneracy property of the longest-edge trisection of triangles.
Appl. Math. Comput., 2010

2009
Problem 11421.
Am. Math. Mon., 2009

Local refinement based on the 7-triangle longest-edge partition.
Math. Comput. Simul., 2009

Four-triangles adaptive algorithms for RTIN terrain meshes.
Math. Comput. Model., 2009

On k-Fibonacci numbers of arithmetic indexes.
Appl. Math. Comput., 2009

2007
Refinement based on longest-edge and self-similar four-triangle partitions.
Math. Comput. Simul., 2007

The eight-tetrahedra longest-edge partition and Kuhn triangulations.
Comput. Math. Appl., 2007

A geometric diagram and hybrid scheme for triangle subdivision.
Comput. Aided Geom. Des., 2007

2006
Block-balanced meshes in iterative uniform refinement.
Comput. Aided Geom. Des., 2006

2005
Computational aspects of the refinement of 3D tetrahedral meshes.
J. Comput. Methods Sci. Eng., 2005

Fractality of refined triangular grids and space-filling curves.
Eng. Comput., 2005

2004
Mesh quality improvement and other properties in the four-triangles longest-edge partition.
Comput. Aided Geom. Des., 2004

2003
Refinement and Hierarchical Coarsening Schemes for Triangulated Surfaces.
Proceedings of the 11-th International Conference in Central Europe on Computer Graphics, 2003

Propagation Path Properties in Iterative Longest-Edge Refinement.
Proceedings of the 12th International Meshing Roundtable, 2003

Mesh Refinement Based on the 8-Tetrahedra Longest- Edge Partition.
Proceedings of the 12th International Meshing Roundtable, 2003

1999
Asymptotic Behavior of the Average of the Adjacencies of the Topological Entities in Some Simplex Partitions.
Proceedings of the 8th International Meshing Roundtable, 1999

1998
Mesh Graph Structure for Longest-Edge Refinement Algorithms.
Proceedings of the 7th International Meshing Roundtable, 1998

1992
Derefinement Algorithms of Nested Meshes.
Proceedings of the Algorithms, Software, Architecture, 1992


  Loading...