Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Carlos M. Nicolas"'
Autor:
Prosenjit Bose, Carlos M. Nicolas, Jesús García, Pedro Ramos, Ferran Hurtado, Manuel Abellanas
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Given a set $\emph{P}$ of $\emph{n}$ points in the plane, the order-$\emph{k}$ Delaunay graph is a graph with vertex set $\emph{P}$ and an edge exists between two points p,q ∊ $\emph{P}$ when there is a circle through $\emph{p}$ and $\emph{q}$ with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::453ff9b2b5b0228945722d1960ce3774
https://doi.org/10.1142/s0218195909003143
https://doi.org/10.1142/s0218195909003143
Autor:
Carlos M. Nicolas
Publikováno v:
Discrete & Computational Geometry. 38:389-397
Let P be a finite set of points in general position in the plane. Let C(P) be the convex hull of P and let CiP be the ith convex layer of P. A minimal convex set S of P is a convex subset of P such that every convex set of P ∩ C(S) different from S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db48b570bb9e08f80cccf1dc277dae7f
https://doi.org/10.1007/s00454-007-1343-6
https://doi.org/10.1007/s00454-007-1343-6
Autor:
Carlos M. Nicolás
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AK,..., Iss Proceedings (2009)
A $k$-triangulation of the $n$-gon is a maximal set of diagonals of the $n$-gon containing no subset of $k+1$ mutually crossing diagonals. The number of $k$-triangulations of the $n$-gon, determined by Jakob Jonsson, is equal to a $k \times k$ Hankel
Externí odkaz:
https://doaj.org/article/0051495c4e884da8a64a74eb8dd37b10