Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano Conference proceedings 2003 Springer-Verlag Berlin Heidelb

乳缽

書目名稱Discrete and Computational Geometry影響因子(影響力)




書目名稱Discrete and Computational Geometry影響因子(影響力)學(xué)科排名




書目名稱Discrete and Computational Geometry網(wǎng)絡(luò)公開度




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




書目名稱Discrete and Computational Geometry被引頻次




書目名稱Discrete and Computational Geometry被引頻次學(xué)科排名




書目名稱Discrete and Computational Geometry年度引用




書目名稱Discrete and Computational Geometry年度引用學(xué)科排名




書目名稱Discrete and Computational Geometry讀者反饋




書目名稱Discrete and Computational Geometry讀者反饋學(xué)科排名

巨碩

Congruent Dudeney Dissections of Polygons,lows: Hinge the parts of . like a string along the perimeter of . , then fix one of the parts to form . with the perimeter of . going into its interior and with its perimeter consisting of the dissection lines in the interior of . , without turning the surfaces over. In this paper we discuss a speci

知識(shí)分子

Playing with Triangulations,cting, transforming, and marking triangulations. In various situations, we develop polynomial-time algorithms to determine who wins a given game under optimal play, and to find a winning strategy. Along the way, we show connections to existing combinatorial games such as Kayles.

注射器

謙卑

cavity

cavity

On the Minimum Perimeter Triangle Enclosing a Convex Polygon,sence of a property called the .. This property was crucial in the linear-time solution for the minimum area triangle enclosing a convex polygon. We have discovered a non-trivial interspersing property for the minimum perimeter problem. This resulted in an optimal solution to the minimum perimeter t

capsaicin

Succinct Data Structures for Approximating Convex Functions with Applications,res requiring only . time, we explore different applications of such data structures to efficiently solve problems in clustering and facility location. Our data structures are succinct using only .((1/.)log.(.)) bits of storage. We show that this is optimal by providing a matching lower bound showin

LITHE

fulcrum