Titlebook: Computational Geometry - Methods, Algorithms and Applications; International Worksh H. Bieri,H. Noltemeier Conference proceedings 1991 Spri

Orthosis

書目名稱Computational Geometry - Methods, Algorithms and Applications影響因子(影響力)




書目名稱Computational Geometry - Methods, Algorithms and Applications影響因子(影響力)學(xué)科排名




書目名稱Computational Geometry - Methods, Algorithms and Applications網(wǎng)絡(luò)公開度




書目名稱Computational Geometry - Methods, Algorithms and Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computational Geometry - Methods, Algorithms and Applications被引頻次




書目名稱Computational Geometry - Methods, Algorithms and Applications被引頻次學(xué)科排名




書目名稱Computational Geometry - Methods, Algorithms and Applications年度引用




書目名稱Computational Geometry - Methods, Algorithms and Applications年度引用學(xué)科排名




書目名稱Computational Geometry - Methods, Algorithms and Applications讀者反饋




書目名稱Computational Geometry - Methods, Algorithms and Applications讀者反饋學(xué)科排名

Hot-Flash

Intractable

Sample-Path-Based Policy Iterationing isothetic rectangles. We propose an .(n log .) time algorithm for finding, given a set . of . isothetic rectangles, a pair of isothetic rectangles (.) such that . and . enclose all rectangles of . and area(s) + area(t) is minimal. Moreover we prove an .(n log .) lower bound for the one-dimensional version of the problem.

Laconic

https://doi.org/10.1007/978-3-030-48306-7omputing the geodesic diameter and the link diameter for a polygon..We consider the rectilinear case of this problem and give a linear time algorithm to compute the rectilinear link diameter of a simple rectilinear polygon. To our knowledge this is the first optimal algorithm for the diameter problem of non-trivial classes of polygons.

flimsy

高調(diào)

高調(diào)

節(jié)省

compel

gnarled