default search action
Angel Plaza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j34]Francisco Perdomo
, Ángel Plaza
Similarity Classes of the Longest-Edge Trisection of Triangles. Axioms 12(10): 913 (2023) - 2022
- [j33]Sergio Falcón
Iterated Partial Sums of the k-Fibonacci Sequences. Axioms 11(10): 542 (2022) - [j32]Miguel A. Padrón
Similarity classes generated by the 8T-LE partition applied to trirectangular tetrahedra. J. Comput. Appl. Math. 409: 114150 (2022) - [j31]Ángel Plaza
Sum of an Alternating Geometric Series Via Self-Similarity. Am. Math. Mon. 129(4): 380 (2022) - 2021
- [j30]Ángel Plaza
Exponential Inequalities and Corollaries. Am. Math. Mon. 128(2): 162 (2021) - 2020
- [j29]Miguel A. Padron
The 8T-LE partition applied to the obtuse triangulations of the 3D-cube. Math. Comput. Simul. 176: 254-265 (2020) - [j28]Angel Plaza
Harmonic, Logarithmic, and Arithmetic Means and Corollaries. Am. Math. Mon. 127(5): 427 (2020)
2010 – 2019
- 2019
- [j27]Alberto Márquez
Hamiltonian triangular refinements and space-filling curves. J. Comput. Appl. Math. 346: 18-25 (2019) - [j26]Angel Plaza
kth Power of a Partial Sum. Am. Math. Mon. 126(5): 467 (2019) - [c7]Miguel A. Padrón, Ángel Plaza
The 8T-LE Partition Applied to the Barycentric Division of a 3-D Cube. ENUMATH 2019: 753-762 - 2018
- [j25]Ángel Plaza
The Harmonic Series Diverges. Am. Math. Mon. 125(3): 222 (2018) - 2016
- [j24]Sergey Korotov, Ángel Plaza
Longest-edge n-section algorithms: Properties and open problems. J. Comput. Appl. Math. 293: 139-146 (2016) - 2015
- [j23]Francisco Perdomo, Ángel Plaza
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. 260: 412-413 (2015) - [j22]Sergey Korotov, Ángel Plaza
On the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n. Comput. Aided Geom. Des. 32: 69-73 (2015) - 2014
- [j21]Alberto Márquez
There are simple and robust refinements (almost) as good as Delaunay. Math. Comput. Simul. 106: 84-94 (2014) - [j20]Francisco Perdomo, Ángel Plaza
A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection. Math. Comput. Simul. 106: 95-108 (2014) - 2013
- [j19]Francisco Perdomo, Ángel Plaza
Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric. Appl. Math. Comput. 221: 424-432 (2013) - [j18]José P. Suárez
Two-sided estimation of diameters reduction rate for the longest edge n-section of triangles with 4 n. Appl. Math. Comput. 224: 492-500 (2013) - 2012
- [j17]Francisco Perdomo, Ángel Plaza
A new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes. Appl. Math. Comput. 219(4): 2342-2344 (2012) - [j16]José P. Suárez
Properties of the longest-edge n-section refinement scheme for triangular meshes. Appl. Math. Lett. 25(12): 2037-2039 (2012) - [j15]Angel Plaza
A local refinement algorithm for the longest-edge trisection of triangle meshes. Math. Comput. Simul. 82(12): 2971-2981 (2012) - 2011
- [j14]Ángel Plaza
A note on "Some inequalities in inner product spaces related to the generalized triangle inequality" by S.S. Dragomir et al. Appl. Math. Comput. 217(22): 9497-9498 (2011) - [j13]Angel Plaza, Sergio Falcón:
Short Proofs Of Combinatorial Identities For n! Ars Comb. 100: 337-339 (2011) - 2010
- [j12]Angel Plaza
On the non-degeneracy property of the longest-edge trisection of triangles. Appl. Math. Comput. 216(3): 862-869 (2010)
2000 – 2009
- 2009
- [j11]Sergio Falcón, Angel Plaza
On k-Fibonacci numbers of arithmetic indexes. Appl. Math. Comput. 208(1): 180-185 (2009) - [j10]José P. Suárez
Four-triangles adaptive algorithms for RTIN terrain meshes. Math. Comput. Model. 49(5-6): 1012-1020 (2009) - [j9]Angel Plaza
Local refinement based on the 7-triangle longest-edge partition. Math. Comput. Simul. 79(8): 2444-2457 (2009) - [j8]Sergio Falcón, Ángel Plaza:
Problem 11421. Am. Math. Mon. 116(3): 277 (2009) - 2007
- [j7]Angel Plaza
A geometric diagram and hybrid scheme for triangle subdivision. Comput. Aided Geom. Des. 24(1): 19-27 (2007) - [j6]Angel Plaza
The eight-tetrahedra longest-edge partition and Kuhn triangulations. Comput. Math. Appl. 54(3): 427-433 (2007) - [j5]Miguel A. Padron, José P. Suárez
Refinement based on longest-edge and self-similar four-triangle partitions. Math. Comput. Simul. 75(5-6): 251-262 (2007) - 2006
- [j4]José P. Suárez
Block-balanced meshes in iterative uniform refinement. Comput. Aided Geom. Des. 23(9): 684-697 (2006) - 2005
- [j3]Angel Plaza
Fractality of refined triangular grids and space-filling curves. Eng. Comput. 20(4): 323-332 (2005) - [j2]José P. Suárez, Pilar Abad, Angel Plaza
Computational aspects of the refinement of 3D tetrahedral meshes. J. Comput. Methods Sci. Eng. 5(4): 215-224 (2005) - 2004
- [j1]Angel Plaza
Mesh quality improvement and other properties in the four-triangles longest-edge partition. Comput. Aided Geom. Des. 21: 353-369 (2004) - 2003
- [c6]Angel Plaza, Maria-Cecilia Rivara:
Mesh Refinement Based on the 8-Tetrahedra Longest- Edge Partition. IMR 2003: 67-78 - [c5]José P. Suárez, Angel Plaza, Graham F. Carey:
Propagation Path Properties in Iterative Longest-Edge Refinement. IMR 2003: 79-90 - [c4]José P. Suárez, Angel Plaza:
Refinement and Hierarchical Coarsening Schemes for Triangulated Surfaces. WSCG 2003
1990 – 1999
- 1999
- [c3]Angel Plaza:
Asymptotic Behavior of the Average of the Adjacencies of the Topological Entities in Some Simplex Partitions. IMR 1999: 233-240 - 1998
- [c2]Angel Plaza, José P. Suárez, Miguel A. Padron:
Mesh Graph Structure for Longest-Edge Refinement Algorithms. IMR 1998: 335-344 - 1992
- [c1]Angel Plaza, Luis Ferragut, Rafael Montenegro:
Derefinement Algorithms of Nested Meshes. IFIP Congress (1) 1992: 409-415
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: