Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Madan, Abhishek"'
Autor:
Madan, Abhishek, Levin, David I. W.
We present a general method for computing local parameterizations rooted at a point on a surface, where the surface is described only through a signed implicit function and a corresponding projection function. Using a two-stage process, we compute se
Externí odkaz:
http://arxiv.org/abs/2410.06330
By starting with the assumption that motion is fundamentally a decision making problem, we use the world-line concept from Special Relativity as the inspiration for a novel multi-agent path planning method. We have identified a particular set of prob
Externí odkaz:
http://arxiv.org/abs/2204.00567
Autor:
Madan, Abhishek, Levin, David I. W.
Publikováno v:
ACM Trans. Graph. 41, 4, Article 68 (July 2022), 17 pages
We present a new method for computing a smooth minimum distance function based on the LogSumExp function for point clouds, edge meshes, triangle meshes, and combinations of all three. We derive blending weights and a modified Barnes-Hut acceleration
Externí odkaz:
http://arxiv.org/abs/2108.10480
We present Diffusion Structures, a family of resilient shell structures from the eigenfunctions of a pair of novel diffusion operators. This approach is based on Michell's theorem but avoids expensive non-linear optimization with computation that amo
Externí odkaz:
http://arxiv.org/abs/2011.05550
In a simple pattern matching problem one has a pattern $w$ and a text $t$, which are words over a finite alphabet $\Sigma$. One may ask whether $w$ occurs in $t$, and if so, where? More generally, we may have a set $P$ of patterns and a set $T$ of te
Externí odkaz:
http://arxiv.org/abs/1806.04645
Autor:
Arora, Ayan, Madan, Abhishek, Sarika, Bhattacharjee, Manoswita, Nayak, Chittaranjan, V. Phani Kumar, Kanaparthi, Thipparaju, Rama Rao
Publikováno v:
In AEUE - International Journal of Electronics and Communications August 2020 123
Autor:
Madan, Abhishek, Levin, David I. W.
Publikováno v:
ACM Transactions on Graphics. 41:1-17
We present a new method for computing a smooth minimum distance function based on the LogSumExp function for point clouds, edge meshes, triangle meshes, and combinations of all three. We derive blending weights and a modified Barnes-Hut acceleration
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08bb319bec4e6829c2ed77042c8fd5bb
https://doi.org/10.1145/3528223.3530093
https://doi.org/10.1145/3528223.3530093
Proceedings of Graphics Interface 2019, Kingston, Ontario, Canada, 28 - 31 May 2019
Grammar-based procedural modelling on its own produces a larger space of generated models than is artistically desirable. Probabilistic sampling techniques can h
Grammar-based procedural modelling on its own produces a larger space of generated models than is artistically desirable. Probabilistic sampling techniques can h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d39957fd89da8a5dd5a7c4aa95dc18b1
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Indian Journal of Veterinary Research; Jan-Jun2021, Vol. 30 Issue 1, p19-25, 7p