Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Nattawut Phetmak"'
Publikováno v:
Algorithms, Vol 16, Iss 6, p 281 (2023)
We consider a problem in computational origami. Given a piece of paper as a convex polygon P and a point f located within, we fold every point on a boundary of P to f and compute a region that is safe from folding, i.e., the region with no creases. T
Externí odkaz:
https://doaj.org/article/9aed67fc9f51401b8ae60e98667e50db
Publikováno v:
Algorithms; Volume 16; Issue 6; Pages: 281
We consider a problem in computational origami. Given a piece of paper as a convex polygon P and a point f located within, we fold every point on a boundary of P to f and compute a region that is safe from folding, i.e., the region with no creases. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::44b7119456a1ca2f1ee583e76b23d233
Publikováno v:
JCSSE
We consider visibility problems on a terrain. Given two stations located at different points on the terrain, we would like to find the minimum heights of communication towers at the two locations so that they can communicate freely. Formally, given t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c14335d5b677d29ae9173342dd1fde9c
https://doi.org/10.1109/jcsse49651.2020.9268436
https://doi.org/10.1109/jcsse49651.2020.9268436
Publikováno v:
Intelligent Information and Database Systems ISBN: 9783319054759
ACIIDS (1)
ACIIDS (1)
There is a trade-off between password security and usability; longer password provides higher security but can reduce usability, as it is harder to remember. To address this challenge, this paper proposed a novel password scheme, called "Travel Passw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::338f078fb891c1a07a60d2760dd6eb35
https://doi.org/10.1007/978-3-319-05476-6_41
https://doi.org/10.1007/978-3-319-05476-6_41
