Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Juyoung Yon"'
Publikováno v:
International Journal of Computational Geometry & Applications. 27:177-185
Let [Formula: see text] and [Formula: see text] be two discrete point sets in [Formula: see text] of sizes [Formula: see text] and [Formula: see text], respectively, and let [Formula: see text] be a given input threshold. The largest common point set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a502becb47e6572e10fd8410fbbfbaa2
https://doi.org/10.1142/s0218195917500029
https://doi.org/10.1142/s0218195917500029
Publikováno v:
Computational Geometry. 47:15-24
We present an algorithm to compute a rigid motion that approximately maximizes the volume of the intersection of two convex polytopes P"1 and P"2 in R^3. For all @e@?(0,1/2] and for all n>=1/@e, our algorithm runs in O(@e^-^3nlog^3^.^5n) time with pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::501fb88e78be707087f1f00c7b7aba31
https://doi.org/10.1016/j.comgeo.2013.08.001
https://doi.org/10.1016/j.comgeo.2013.08.001
Publikováno v:
International Journal of Computational Geometry and Applications
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2011, 21 (2), pp.179-188. ⟨10.1142/S0218195911003603⟩
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2011, 21 (2), pp.179-188. ⟨10.1142/S0218195911003603⟩
Reverse nearest neighbor queries are defined as follows: Given an input point-set P, and a query point q, find all the points p in P whose nearest point in P U {q} \ {p} is q. We give a data structure to answer reverse nearest neighbor queries in fix
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08e8ce022b2c58511fc0d49ced32a371
