Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Masatsugu Urabe Conference proceedings 2000 Springer-Verla

帳簿

書目名稱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é)科排名

品牌

油膏

叫喊

concentrate

lethal

NP-Completeness of Stage Illumination Problemss completely illuminated. The problem for finding a polynomial time algorithm for this problem or proving NP-hardness of this problem was open. This paper shows that it is NP-complete even with some restrictions.

lethal

On the Maximum Degree of Bipartite Embeddings of Trees in the Planertite sets . and ., i.e., .(.) = . ∪ ., then . is denoted by .(., .). Let . and . be two disjoint sets of points in the plane such that |.| = |.| and no three points of . ∪ . are tollinear. Then we show that the geometric complete bipartite graph .(., .) contains a spanning tree . without crossings such that the maximum degree of . is at most 3.

點(diǎn)燃

Efficient Regular Polygon Dissections consider polygonal cuts, i.e., the minimum number .(4,.) of pieces needed to dissect a square into a regular n-gon of the same area using polygonal cuts and show that ., holds for sufficiently large .. We also consider regular polygon-polygon dissections and obtain similar bounds for .(.,.) and .(...).

PLAYS

On Soddy’s Hexlet and a Linked 4-Pair6, and in any (3,6)-link, each ball in the 3-cycle is tangent to all balls in the 6-cycle, (2) a (4,4)-cycle exists and in any (4,4)-cycle, each ball in a 4-cycle is tangent to all balls in the other 4-cycle.

Enteropathic

Convex Hull Problem with Imprecise Inputthe intersection and the union of all possible convex hulls. The gap of these two hulls explicitly represents the accuracy of a possible convex hull. Under an assumption that the size of error is given for each input point, we show that the inner convex hull and the outer convex hull are calculated in .(. log .) time for . points in the plane.