Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Roman Waupotitsch"'
Publikováno v:
Image and Vision Computing. 21:137-143
We address the problem of 3D reconstruction from a single perspective view of a mirror symmetric scene. We establish the fundamental result that it is geometrically equivalent to observing the scene with two cameras, the cameras being symmetrical wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::132bf650935e1be056d32b9d7555ca81
https://doi.org/10.1016/s0262-8856(02)00149-x
https://doi.org/10.1016/s0262-8856(02)00149-x
Publikováno v:
International Journal of Computational Geometry & Applications. 10:267-284
We study the maintenance of a simplicial grid or complex under changing density requirements. The proposed method works in any fixed dimension and generates grids by projecting cross-sections of a monotone simplicial complex that lives in one dimensi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e1c44215a2cfb974bc0faa9becb314e
https://doi.org/10.1142/s0218195900000164
https://doi.org/10.1142/s0218195900000164
Publikováno v:
Symposium on Computational Geometry
A homeomorphism from R 2 to itself distorts metric quantities, such as distance and area. We describe an algorithm that constructs homeomorphisms with prescribed area distortion. Such homeomorphisms can be used to generate cartograms, which are geogr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a8a31f439eb03332b35ef76ddec1230
https://doi.org/10.1016/s0925-7721(96)00006-5
https://doi.org/10.1016/s0925-7721(96)00006-5
Publikováno v:
SIAM Journal on Scientific and Statistical Computing. 13:994-1008
It is shown that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time $O(n^2 \log n)$ and space $O(n)$. The algorithm is fairly easy to implement and is based on the edge-insertion scheme that ite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6620a9be4471e3d9e7ceb4a08eca18a5
https://doi.org/10.1137/0913058
https://doi.org/10.1137/0913058
Publikováno v:
Symposium on Computational Geometry
We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca864ed58c4a5f23ecb2ecbeededef85
https://doi.org/10.1145/98524.98535
https://doi.org/10.1145/98524.98535
Conference
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.