158 citations · 160 across the 3 of their papers we have counts for
3 papers
cs.CG2022★ 1 cited
Approximating triangular meshes by implicit, multi-sided surfaces
Ágoston Sipos, Tamás Várady, Péter Salvi
The I-patch is a multi-sided surface representation, defined as a combination of implicit ribbon and bounding surfaces, whose pairwise intersections determine the natural boundarie…
cs.GR2020★ 1 cited
Computationally efficient transfinite patches with fullness control
Péter Salvi, István Kovács, Tamás Várady
Transfinite patches provide a simple and elegant solution to the problem of representing non-four-sided continuous surfaces, which are useful in a variety of applications, such as…
cs.LG2007★ 158 cited
The on-line shortest path problem under partial monitoring
Andras Gyorgy, Tamas Linder, Gabor Lugosi +1
The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (a…